Pruning nearest neighbor cluster trees

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 225-232

  Kpotufe, Samory ^a   Von Luxburg, Ulrike ^a  

^a MAX PLANCK INSTITUTE FOR INTELLIGENT SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER STRUCTURE; CLUSTER TREE; CONSISTENT ESTIMATORS; DATA MINING APPLICATIONS; FINITE SAMPLE RESULTS; FINITE SAMPLES; NEAREST NEIGHBORS; SPURIOUS CLUSTER; SUBGRAPHS; UNDERLYING DISTRIBUTION;

LEARNING SYSTEMS; PLANT EXTRACTS; SAMPLING;

TREES (MATHEMATICS);

EID: 80053435626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Angluin, D. and Valiant, L.G. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences, 19:155-193, 1979. (Pubitemid 9461409)
2. Bousquet, O., Boucheron, S., and Lugosi, G. Introduction to statistical learning theory. Lecture Notes in Artificial Intelligence, (3176):169-207, 2004.
3. Chaudhuri, K. and Dasgupta, S. Rates of convergence for the cluster tree. Neural Information Processing Systems, 2010.
4. Devroye, L.P. and Wagner, T.J. The strong uniform consistency of nearest neighbor density estimates. The Annals of Statistics, 5:536-540, 1977.
5. Hartigan, J.A. Consistency of single linkage for high-density clusters. Journal of the American Statistical Association, 76(374):388-394, 1981.
6. Kpotufe, S. and Von Luxburg, U. Pruning nearest neighbor cluster trees. arXiv: 1105.0540, 2011.
7. Maier, M., Hein, M., and Von Luxburg, U. Optimal construction of k-nearest neighbor graphs for identifying noisy clusters. Theoretical Computer Science, 410:1749-1764, 2009.
8. Rigollet, P. and Vert, R. Fast rates for plug-in estimators of density level sets. Bernouilli, 15(4):1154-1178, 2009.
9. Rinaldo, A. and Wasserman, L. Generalized density clustering. Annals of Statistics, 38(5):2678-2722, 2010.
10. Rinaldo, A., Singh, A., Nugent, R., and Wasserman, L. Stability of density based clustering. arXiv.1011.2771v1, pp. 2760-2782, 2010.
11. Singh, A., Scott, C., and Nowak, R. Adaptive hausdorff estimation of density level sets. Annals of Statistics, 37(5), 2009.
12. Stueltze, W. and Nugent, R. Clustering with confidence: A binning approach. International Federation Classification Societies Conference, 2009.
13. Stueltze, W. and Nugent, R. A generalized single linkage method for estimating the cluster tree of a density. Journal of Computational and Graphical Statistics, 19(2):397-418, 2010.
14. Wishart, D. Mode analysis: A generalization of nearest neighbor which reduces chaining effects. Numerical Taxonomy, pp. 282-311, 1969.
15. Wong, M. and Lane, T. A kth nearest neighbor clustering procedure. Journal of the Royal Statistical Society Series B, 45(3):362-368, 1983.