Dense neighborhoods on affinity graph

International Journal of Computer Vision

Volumn 98, Issue 1, 2012, Pages 65-82

  Liu, Hairong ^a   Yang, Xingwei ^b   Latecki, Longin Jan ^b   Yan, Shuicheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b TEMPLE UNIVERSITY   (United States)

Author keywords

Affinity graph; Clustering; Nearest neighbor; Semi supervised learning

Indexed keywords

AFFINITY GRAPH; CLUSTERING; DATA CLUSTERING; EFFICIENT ALGORITHM; GRAPH CONSTRUCTION; K-NEAREST NEIGHBORS; NEAREST NEIGHBOR; OBJECT O; POINT SET; REAL WORLD DATA; SEMI-SUPERVISED LEARNING; SHAPE RETRIEVAL; SIMPLE METHOD; THEORETIC ANALYSIS; VECTORIAL DATA;

CLUSTERING ALGORITHMS; SUPERVISED LEARNING;

GRAPHIC METHODS;

EID: 84859268447     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-011-0496-1     Document Type: Article

References (43)

1. S. Arya D. Mount N. Netanyahu R. Silverman A. Wu 1998 An optimal algorithm for approximate nearest neighbor searching fixed dimensions Journal of the ACM 45 6 891 923 1678846 1065.68650 10.1145/293347.293348
2. Y. Asahiro R. Hassin K. Iwama 2002 Complexity of finding dense subgraphs Discrete Applied Mathematics 121 1-3 15 26 1906583 1002.68108 10.1016/S0166-218X(01)00243-8 (Pubitemid 34548382)
3. J. Bentley 1975 Multidimensional binary search trees used for associative searching Communications of the ACM 18 9 517 525 904133 10.1145/361002.361007
4. M. Bomze E. De Klerk 2002 Solving standard quadratic optimization problems via linear, semidefinite and copositive programming Journal of Global Optimization 24 2 163 185 1934026 1047.90038 10.1023/A:1020209017701 (Pubitemid 35168547)
5. T. Caetano T. Caelli D. Schuurmans D. Barone 2006 Graphical models and point pattern matching IEEE Transactions on Pattern Analysis and Machine Intelligence 28 10 1646 1663 10.1109/TPAMI.2006.207 (Pubitemid 46405083)
6. T. Chan 1998 Approximate nearest neighbor queries revisited Discrete & Computational Geometry 20 3 359 373 1649777 0910.68218 10.1007/PL00009390 (Pubitemid 128352175)
7. Chang, C.-C., & Lin, C.-J. (2001). LIBSVM: a library for support vector machines.
8. Chapelle, O., Scholkopf, B., & Zien, A. (2006a) Semi-supervised learning.
9. Chapelle, O., Scholkopf, B., & Zien, A. (2006b). The Benchmark Data Sets. http://www.kyb.tuebingen.mpg.de/ssl-book/benchmarks.html.
10. A. Clauset C. Moore M. Newman 2008 Hierarchical structure and the prediction of missing links in networks Nature 453 7191 98 101 10.1038/nature06830 (Pubitemid 351630323)
11. K. P. M. Connor 2010 Fast construction of k-nearest neighbor graphs for point clouds IEEE Transactions on Visualization and Computer Graphics 16 4 599 608 10.1109/TVCG.2010.9
12. T. Cover P. Hart 1967 Nearest neighbor pattern classification IEEE Transactions on Information Theory 13 1 21 27 0154.44505 10.1109/TIT.1967. 1053964
13. Crammer, K., Talukdar, P., & Pereira, F. (2008). A rate-distortion one-class model and its applications to clustering. In Proceedings of the 25th international conference on machine learning (pp. 184-191).
14. Denoeux, T. (2008). A k-nearest neighbor classification rule based on Dempster-Shafer theory. In Classic works of the Dempster-Shafer theory of belief functions (pp. 737-760).
15. Dhillon, I., Guan, Y., & Kulis, B. (2004). Kernel k-means: spectral clustering and normalized cuts. In International conference on knowledge discovery and data mining (pp. 551-556). (Pubitemid 40114969)
16. Fleishman, S., Cohen-Or, D., & Silva, C. (2005). Robust moving least-squares fitting with sharp features. In ACM special interest group on graphics and interactive techniques (pp. 552-560).
17. Frank, A., & Asuncion, A. (2010). UCI Machine Learning Repository. http://archive.ics.uci.edu/ml
18. B. Frey D. Dueck 2007 Clustering by passing messages between data points Science 315 5814 972 976 2292174 1226.94027 10.1126/science.1136800 (Pubitemid 46281181)
19. B. Georgescu P. Meer 2004 Point matching under large image deformations and illumination changes IEEE Transactions on Pattern Analysis and Machine Intelligence 26 674 688 10.1109/TPAMI.2004.2
20. Gibson, D., Kumar, R., & Tomkins, A. (2005). Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st international conference on very large data bases (pp. 732-741).
21. M. Goldstein 1972 K-nearest neighbor classification IEEE Transactions on Information Theory 18 5 627 630 0242.62032 10.1109/TIT.1972.1054888
22. Gupta, G., & Ghosh, J. (2005). Robust one-class clustering using hybrid global and local search. In Proceedings of the 22nd international conference on machine learning (pp. 273-280). (Pubitemid 43183343)
23. Han, E., Karypis, G., & Kumar, V. (2001). Text categorization using weight adjusted k-nearest neighbor classification. In Advances in knowledge discovery and data mining (pp. 53-65). (Pubitemid 33255095)
24. Horton, P., & Nakai, K. (1997). Better prediction of protein cellular localization sites with the k nearest neighbors classifier. In International conference on intelligent systems for molecular biology (Vol. 5, pp. 147-152).
25. H. Hu X. Yan Y. Huang J. Han X. Zhou 2005 Mining coherent dense subgraphs across massive biological networks for functional discovery Bioinformatics 21 213 226 10.1093/bioinformatics/bti1049 (Pubitemid 41794492)
26. Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th annual ACM symposium on theory of computing (pp. 604-613).
27. Jebara, T., & Shchogolev, V. (2006). B-matching for spectral clustering. In European conference on machine learning (pp. 679-686). (Pubitemid 44618877)
28. Jebara, T., Wang, J., & Chang, S. (2009). Graph construction and b-matching for semi-supervised learning. In International conference on machine learning (pp. 441-448).
29. Kolahdouzan, M., & Shahabi, C. (2004). Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of the international conference on very large data bases (pp. 851-860).
30. Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., & Protopapas, Z. (1996). Fast nearest neighbor search in medical image databases. In Proceedings of the international conference on very large data bases (pp. 215-226).
31. Kuhn, W., & Tucker, A. (1951). Nonlinear programming. In Proceedings of 2nd Berkeley symposium (pp. 481-492).
32. Leordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. In International conference on computer vision (pp. 1482-1489). (Pubitemid 44042353)
33. L. Li C. Weinberg T. Darden L. Pedersen 2001 Gene selection for sample classification based on gene expression data: study of sensitivity to choice of parameters of the GA/KNN method Bioinformatics 17 12 1131 1139 10.1093/bioinformatics/17.12.1131
34. H. Ling D. Jacobs 2007 Shape classification using the inner-distance IEEE Transactions on Pattern Analysis and Machine Intelligence 29 2 286 299 10.1109/TPAMI.2007.41 (Pubitemid 46420888)
35. T. Motzkin E. Straus 1965 Maxima for graphs and a new proof of a theorem of Turán Canadian Journal of Mathematics 17 4 533 540 175813 0129.39902 10.4153/CJM-1965-053-6
36. Ng, A., Jordan, M., & Weiss, Y. (2001). On spectral clustering: analysis and an algorithm. In Advances in neural information processing systems (pp. 849-856).
37. Q. Ouyang P. Kaplan S. Liu A. Libchaber 1997 DNA solution of the maximal clique problem Science 80 446 448 10.1126/science.278.5337.446 (Pubitemid 27454425)
38. M. Pavan M. Pelillo 2007 Dominant sets and pairwise clustering IEEE Transactions on Pattern Analysis and Machine Intelligence 29 1 167 172 10.1109/TPAMI.2007.250608 (Pubitemid 46415954)
39. J. Shi J. Malik 2000 Normalized cuts and image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 22 8 888 905 10.1109/34.868688
40. Yu, C., Ooi, B., Tan, K., & Jagadish, H. (2001). Indexing the distance: An efficient method to kNN processing. In Proceedings of the international conference on very large data bases (pp. 421-430).
41. Zaki, M., Parthasarathy, S., Ogihara, M., & Li, W. (1997). New algorithms for fast discovery of association rules. In International conference on knowledge discovery and data mining (Vol. 20, pp. 283-286).
42. Zhou, D., Bousquet, O., Lal, T., Weston, J., & Schlkopf, B. (2004). Learning with local and global consistency. In Advances in neural information processing systems (pp. 595-602).
43. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. In International conference on machine learning (Vol. 20, pp. 912-919).