Complexity versus Agreement for Many Views

DOI10.1007/978-3-642-04414-4_21zbMath1262.68152OpenAlexW1540952048MaRDI QIDQ3648755

Odalric-Ambrym Maillard, Nicolas Vayatis

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_21

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation, metric entropy and small ball estimates for Gaussian measures
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Small ball estimates for Brownian motion under a weighted sup-norm
• Learning Theory and Kernel Machines
• A Sober Look at Clustering Stability
• Learning Theory

This page was built for publication: Complexity versus Agreement for Many Views