Graph degree linkage: Agglomerative clustering on a directed graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7572 LNCS, Issue PART 1, 2012, Pages 428-441

  Zhang, Wei ^a   Wang, Xiaogang ^a,b   Zhao, Deli ^a   Tang, Xiaoou ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATIVE ALGORITHM; AGGLOMERATIVE CLUSTERING; COMPUTER VISION PROBLEMS; FUNDAMENTAL CONCEPTS; GRAPH-BASED; HIGH DIMENSIONAL DATA; IMAGE CLUSTERING; IN-DEGREE; LOCAL GEOMETRY; OBJECT MATCHING; OUTDEGREE;

CLUSTERING ALGORITHMS; GRAPH THEORY;

COMPUTER VISION;

EID: 84867861862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33718-5_31     Document Type: Conference Paper

References (22)

1. Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning: Data mining, inference, and prediction, 2nd edn. Springer (2009)
2. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE TPAMI 22(8), 888-905 (2000)
3. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS (2001)
4. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15(6), 1373-1396 (2003)
5. Grady, L., Schwartz, E.: Isoperimetric graph partitioning for image segmentation. IEEE TPAMI 28(3), 469-475 (2006)
6. Zhang, W., Lin, Z., Tang, X.: Learning semi-Riemannian metrics for semisupervised feature extraction. IEEE TKDE 23(4), 600-611 (2011)
7. Frey, B., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972-976 (2007)
8. Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: ICML (2005)
9. Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM46(5), 604-632 (1999)
10. Mislove, A., Marcon, M., Gummadi, K., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proc. ACM SIGCOMM Conf. on Internet Measurement (2007)
11. Zelnik-Manor, L., Perona, P.: Self-tuning spectral clustering. In: NIPS (2005)
12. Wu, M., Schölkopf, B.: A local learning approach for clustering. In: NIPS (2007)
13. Franti, P., Virmajoki, O., Hautamaki, V.: Fast agglomerative clustering using a k-nearest neighbor graph. IEEE TPAMI 28(11), 1875-1881 (2006)
14. Cho, M., Lee, J., Lee, K.: Feature correspondence and deformable object matching via agglomerative correspondence clustering. In: ICCV (2009)
15. Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery 2(2), 169-194 (1998)
16. Ertöz, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: SIAM International Conf. on Data Mining (2003)
17. Karypis, G., Han, E., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer 32(8), 68-75 (1999)
18. Zhao, D., Tang, X.: Cyclizing clusters via zeta function of a graph. In: NIPS (2008)
19. Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. IJCV 59(2), 167-181 (2004)
20. Yu, S., Shi, J.: Multiclass spectral clustering. In: ICCV (2003)
21. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pair-wise constraints. In: ICCV (2005)
22. Liu, H., Yan, S.: Common visual pattern discovery via spatially coherent correspondences. In: CVPR (2010)