Nearest neighbor clustering: A baseline method for consistent clustering with arbitrary objective functions

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 657-698

  Bubeck, Sébastien ^a   Von Luxburg, Ulrike ^b  

^a INRIA   (France)

^b MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

Author keywords

Clustering; Consistency; Minimizing objective functions

Indexed keywords

BASELINE METHODS; CLUSTERING; CONSISTENCY; DATA SETS; DISCRETE OPTIMIZATION PROBLEMS; DISCRETE OPTIMIZATIONS; FUNCTION CLASS; K-NEAREST NEIGHBOR CLASSIFIERS; MINIMIZING OBJECTIVE FUNCTIONS; NEAREST NEIGHBOR CLUSTERING; OPTIMIZATION SCHEMES; QUALITY MEASURES; RESTRICTED FUNCTIONS;

LEARNING ALGORITHMS; OPTIMIZATION; SUPERVISED LEARNING;

CLUSTERING ALGORITHMS;

EID: 64149110401     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. S. Ben-David. A framework for statistical clustering with constant time approximation algorithms for k-median and k-means clustering. Machine Learning, 66:243 - 257, 2007.
2. J. Buhmann. Empirical risk approximation: An induction principle for unsupervised learning. Technical report, University of Bonn, 1998.
3. A. Czumaj and C. Sohler. Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms, 30(l-2):226-256, 2007.
4. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, New York, 1996.
5. M. Figueiredo and A. Jain. Unsupervised learning of finite mixture models. PAMI, 24(3):381-396, 2002.
6. C. Fraley and A. Raftery. How many clusters? Which clustering method? Answers via model-based cluster analysis. Comput. J, 41(8):578-588, 1998.
7. J. Fritz. Distribution-free exponential error bound for nearest neighbor pattern classification. IEEE Trans. Inf. Th., 21(5):552-557, 1975.
8. M. Garey, D. Johnson, and H. Witsenhausen. The complexity of the generalized Lloyd - max problem (corresp.). IEEE Trans. Inf. Theory, 28(2):255-256, 1982.
9. P. Grünwald. The Minimum Description Length Principle. MIT Press, Cambridge, MA, 2007.
10. S. Guattery and G. Miller. On the quality of spectral separators. SIAM Journal of Matrix Anal. Appl., 19(3):701 - 719, 1998.
11. J. Hartigan. Consistency of single linkage for high-density clusters. JASA, 76(374):388 - 394, 1981.
12. J. Hartigan. Statistical theory in clustering. Journal of Classification, 2:63 - 76, 1985.
13. M. Inaba, N. Katoh, and H. Imai. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In Proceedings of the 10th Annual Symposium on Computational Geometry, pages 332-339. ACM Press, Stony Brook, USA, 1994.
14. P. Indyk. Sublinear time algorithms for metric space problems. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing (STOC), pages 428-434. ACM Press, New York, 1999.
15. S. Jegelka. Statistical learning theory approaches to clustering. Master's thesis, University of Tübingen, 2007. Available at http://www.kyb.mpg.de/publication.html?user=jegelka.
16. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, 51(3):497-515,2004.
17. C. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, pages 148 - 188, 1989. Cambridge University Press.
18. G. McLachlan and D. Peel. Finite Mixture Models. John Wiley, New York, 2004.
19. N. Mishra, D. Oblinger, and L. Pitt. Sublinear time approximate clustering. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 439-447. ACM Press, New York, 2001.
20. M. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74:036104, 2006.
21. D. Pollard. Strong consistency of k-means clustering. Annals of Statistics, 9(1):135 - 140, 1981.
22. A. Rakhlin and A. Caponnetto. Stability of k-means clustering. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, MA, 2007.
23. D. Spielman and S. Teng. Spectral partitioning works: planar graphs and finite element meshes. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 96 - 105. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996. (See also extended technical report version.).
24. A. W. van der Vaart and J. A. Wellner. Weak Convergence and Empirical Processes. Springer, New York, 1996.
25. V. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, New York, 1995.
26. U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395 - 416, 2007.
27. U. von Luxburg and S. Ben-David. Towards a statistical theory of clustering. In PASCAL workshop on Statistics and Optimization of Clustering, London, 2005.
28. U. von Luxburg, M. Belkin, and O. Bousquet. Consistency of spectral clustering. Annals of Statistics, 36(2):555 - 586, 2008.
29. U. von Luxburg, S. Bubeck, S. Jegelka, and M. Kaufmann. Consistent minimization of clustering objective functions. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems (NIPS) 21. MIT Press, Cambridge, MA, 2008.
30. D. Wagner and F. Wagner, Between min cut and graph bisection. In Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 744 - 750, London, 1993. Springer.
31. M. Wong and T. Lane. A kth nearest neighbor clustering procedure. J.R. Statist.Soc B, 45(3): 362-368,1983.