Locally-scaled spectral clustering using empty region graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1330-1338

  Correa, Carlos D ^a   Lindstrom, Peter ^a  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

proximity graphs; spectral clustering

Indexed keywords

AFFINITY MATRIX; ALGORITHM PARAMETERS; ARBITRARY SHAPE; CLUSTERING QUALITY; CONVENTIONAL APPROACH; DATA POINTS; EMPIRICAL STUDIES; GEOMETRIC DISTORTION; GLOBAL SCALE; K-NEAREST NEIGHBORS; NONLINEAR DIFFUSION; PROXIMITY GRAPHS; QUALITY CLUSTERING; RANDOM PERTURBATIONS; SPECTRAL CLUSTERING; SYNTHETIC DATASETS;

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; MATHEMATICAL TRANSFORMATIONS;

DATA MINING;

EID: 84866006491     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339736     Document Type: Conference Paper

References (34)

1. E. Biçici and D. Yuret. Locally scaled density based clustering. In Proc. 8th int. conf. on Adaptive and Natural Computing Algorithms, Part I, ICANNGA '07, pages 739-748, 2007.
2. P. Bose, S. Collette, S. Langerman, A. Maheshwari, P. Morin, and M. Smid. Sigma-local graphs. J. of Discrete Algorithms, 8:15-23, 2010.
3. J. Cardinal, S. Collette, and S. Langerman. Empty region graphs. Comput. Geom. Theory Appl., 42:183-195, 2009.
4. M. A. Carreira-Perpiñán and R. S. Zemel. Proximity graphs for clustering and manifold learning. In Advances in Neural Information Processing Systems, pages 225-232. MIT Press, 2005.
5. J. Choo, R. Jiamthapthaksin, C.-S. Chen, O. U. Celepcikay, C. Giusti, and C. F. Eick. Mosaic: A proximity graph approach for agglomerative clustering. In DaWaK, volume 4654 of Lecture Notes in Computer Science, pages 231-240. Springer, 2007.
6. R. J. Cimikowski. Properties of some euclidean proximity graphs. Pattern Recogn. Lett., 13:417-423, 1992.
7. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proc. of ACM SIGKDD int. conf. on Knowledge discovery and data mining, pages 269-274, 2001.
8. W. Donath and A. Hoffman. Lower bounds for partitioning of graphs. IBM J. Res. Dev., 17:420-425, 1973.
9. V. A. Epanechnikov. Non-parametric estimation of a multivariate probability density. Theory of Probability and Its Applications, 14, 1969.
10. M. Ester, H. peter Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Knowledge Discovery and Data Mining, pages 226-231, 1996.
11. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 1973.
12. S. Fortune. Voronoi diagrams and delaunay triangulations. In J. E. Goodman and J. O'Rourke, editors, Handbook of discrete and computational geometry, pages 377-388. 1997.
13. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
14. R. K. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):259-278, 1969.
15. L. Huang, D. Yan, M. I. Jordan, and N. Taft. Spectral clustering with perturbed data. In Neural Information Processing Systems, pages 705-712, 2008.
16. J. Jaromczyk and G. Toussaint. Relative neighborhood graphs and their relatives. Proc. of the IEEE, 80(9):1502-1517, 1992.
17. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. The ACM, 51:497-515, 2004.
18. D. Kirkpatrick and J. Radke. A framework for computational morphology. CG, 85:217-248, 1985.
19. Z. Li, J. Liu, S. Chen, and X. Tang. Noise robust spectral clustering. In IEEE int. conf. on Computer Vision, 2007, pages 1-8, 2007.
20. T. Lindeberg. Scale-Space Theory in Computer Vision. Kluwer Academic Publishers, 1994.
21. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In L. M. L. Cam and J. Neyman, editors, Proc. of the 5th Berkeley Symp. on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967.
22. M. Maier, U. von Luxburg, and M. Hein. How the result of graph clustering methods depends on the construction of the graph. CoRR, abs/1102.2075, 2011. informal publication.
23. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In Proc. 8th Int'l Conf. Computer Vision, volume 2, pages 416-423, July 2001.
24. D. L. Millman and V. Verma. A slow algorithm for computing the gabriel graph with double precision. In Proc. of the 23nd Canadian Conf. on Computational Geometry, pages 485-487, 2011.
25. B. Nadler and M. Galun. Fundamental limitations of spectral clustering. In Neural Information Processing Systems, pages 1017-1024, 2006.
26. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, pages 849-856. MIT Press, 2001.
27. J. Sander, M. Ester, H.-P. Kriegel, and X. Xu. Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Min. Knowl. Discov., 2:169-194, 1998.
28. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
29. Y. Song, W.-Y. Chen, H. Bai, C.-J. Lin, and E. Y. Chang. Parallel spectral clustering. In ECML PKDD '08, pages 374-389, 2008.
30. C. Tomasi and R. Manduchi. Bilateral filtering for gray and color images. In Proc. of the Sixth int. conf. on Computer Vision, ICCV '98, pages 839-, 1998.
31. G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12:261-268, 1980.
32. R. Urquhart. Graph theoretical clustering based on limited neighbourhood sets. Pattern Recognition, 15(3):173-187, 1982.
33. U. von Luxburg, M. Belkin, and O. Bousquet. Consistency of spectral clustering. Annals of Statistics, 36:555-586, 2008.
34. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In NIPS, 2004.