Clustering on complex graphs

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 659-664

  Long, Bo ^a   Zhang, Mark ^a   Yu, Philip S ^b   Xu, Tianbing ^a  

^a State University of New York   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX GRAPHS; EXPERIMENTAL EVALUATIONS; FRAMEWORK AND ALGORITHMS; GENERAL FRAMEWORKS; GRAPH PARTITIONING; LEARNING CLUSTERS; STATISTICAL PROPERTIES; WEB MININGS;

APPLICATIONS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; BIONICS; INFORMATION SERVICES; LEARNING ALGORITHMS;

CLUSTERING ALGORITHMS;

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

References (22)

1. Banerjee, A.; Dhillon, I. S.; Ghosh, J.; Merugu, S.; and Modha, D. S. 2004a. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. In KDD, 509-514.
2. Banerjee, A.; Merugu, S.; Dhillon, I. S.; and Ghosh, J. 2004b. Clustering with bregman divergences. In SDM.
3. Chan, P. K.; Schlag, M. D. F; and Zien, J. Y. 1993. Spectral k-way ratio-cut partitioning and clustering. In DAC '93, 749-754.
4. Dhillon, I.; Guan, Y.; and Kulis, B. 2004. A unified view of kernel k-means, spectral clustering and graph cuts. Technical Report TR-04-25, University of Texas at Austin.
5. Dhillon, I. S. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, 269-274.
6. Ding, C. H. Q.; He, X.; Zha, H.; Gu, M.; and Simon, H. D. 2001. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of ICDM 2001, 107-114.
7. Gao, B.; Liu, T.-Y; Zheng, X.; Cheng, Q.-S.; and Ma, W.-Y 2005. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In KDD '05, 41-50.
8. Hendrickson, B., and Leland, R. 1995. A multilevel algorithm for partitioning graphs. In Supercomputing '95, 28.
9. Karypis, G., and Kumar, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Com-put. 20(1): 359-392.
10. Kernighan, B., and Lin, S. 1970. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49(2): 291-307.
11. Lang, K. 1995. News weeder: Learning to filter netnews. In ICML.
12. Lee, D. D., and Seung, H. S. 2000. Algorithms for non-negative matrix factorization. In NIPS, 556-562.
13. Long, B.; Wu, X.; Zhang, Z. M.; and Yu, P. S. 2006. Unsupervised learning on k-partite graphs. In KDD'06.
14. Long, B.; Xu, X.; Zhang, Z. M.; and Yu, P. S. 2007. Community learning by graph approximation. In ICDM, 232-241.
15. Neville, J.; Adler, M.; and Jensen, D. 2003. Clustering relational data using attribute and link information. In Proceedings of the Text Mining and Link Analysis Workshop, IJCAI'03.
16. Salakhutdinov, R., and Roweis, S. 2003. Adaptive overrelaxed bound optimization methods. In ICML'03.
17. S.D. Pietra, V.D. Pietera, J. 2001. Duality and auxiliary functions for bregman distances. Technical Report CMU-CS-01-109, Carnegie Mellon University.
18. Shental, N.; Zomet, A.; Hertz, T; and Weiss, Y. 2004. Pairwise clustering and graphical models. In Thrun, S.; Saul, L.; and Schölkopf, B., eds., NIPS'03. Cambridge, MA: MIT Press.
19. Shi, J., and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8): 888-905.
20. Strehl, A., and Ghosh, J. 2002. Cluster ensembles - a knowledge reuse framework for combining partitionings. In AAAI 2002, 93-98. http://trec.nist.gov/.
21. van Dongen, S. M. 2000. Graph Clustering by Flow Simulation. Ph.D. Dissertation, University of Utrecht.
22. Yu, K.; Yu, S.; and Tresp, V. 2005. Soft clustering on graphs. In NIPS'05.