Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters

Theoretical Computer Science

Volumn 410, Issue 19, 2009, Pages 1749-1764

  Maier, Markus ^a   Hein, Matthias ^b   von Luxburg, Ulrike ^a  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Clustering; Connected component; Neighborhood graph; Random geometric graph

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

CLUSTERING; CONNECTED COMPONENT; DATA POINTS; K-NEAREST NEIGHBORS; LEVEL SETS; NEIGHBORHOOD GRAPH; OPTIMAL CLUSTERING; OPTIMAL CONSTRUCTIONS; OPTIMAL PARAMETERS; RANDOM GEOMETRIC GRAPH; RANDOM SAMPLES;

CLUSTERING ALGORITHMS;

EID: 62749193549     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.01.009     Document Type: Article

References (14)

1. Bettstetter C. On the minimum node degree and connectivity of a wireless multihop network. MobiHoc'02: Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking & Computing (2002), ACM, New York, NY, USA 80-91
2. Biau G., Cadre B., and Pelletier B. A graph-based estimator of the number of clusters. ESIAM Probab. Statist. 11 (2007) 272-280
3. Bollobas B. Random Graphs (2001), Cambridge University Press, Cambridge
4. Bollobas B., and Riordan O. Percolation (2006), Cambridge University Press, Cambridge
5. Brito M., Chavez E., Quiroz A., and Yukich J. Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Statist. Probab. Lett. 35 (1997) 33-42
6. Devroye L., and Lugosi G. Combinatorial Methods in Density Estimation (2001), Springer, New York
7. Federer H. Geometric Measure Theory. Die Grundlehren der mathematischen Wissenschaften vol. 153 (1969), Springer-Verlag
8. Hartigan J. Consistency of single linkage for high-density clusters. J. Amer. Statist. Assoc. 76 (1981) 388-394
9. Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 (1963) 13-30
10. Kunniyur S.S., and Venkatesh S.S. Threshold functions, node isolation, and emergent lacunae in sensor networks. IEEE Trans. Inform. Theory 52 12 (2006) 5352-5372
11. Maier M., Hein M., and von Luxburg U. Cluster identification in nearest-neighbor graphs. In: Hutter M., Servedio R., and Takimoto E. (Eds). Proc. of the 18th Conf. on Algorithmic Learning Theory. ALT (2007), Springer, Berlin 196-210
12. Penrose M. Random Geometric Graphs (2003), Oxford University Press, Oxford
13. Rao B.L.S.P. Nonparametric Functional Estimation (1983), Academic Press, New York
14. Santi P., and Blough D. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Trans. Mobile Computing 02 1 (2003) 25-39