Community learning by graph approximation

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 232-241

  Long, Bo ^a   Wu, Xiaoyun ^b   Yu, Philip S ^c   Zhang, Zhongfei ^a  

^a BINGHAMTON UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; EDUCATION; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; INFORMATION MANAGEMENT; LEARNING ALGORITHMS; MINING; POLYNOMIAL APPROXIMATION; SEARCH ENGINES;

COMMUNITY LEARNING; COMMUNITY STRUCTURES; EXPERIMENTAL EVALUATIONS; GENERAL MODEL; GRAPH PARTITIONING; INTERNATIONAL CONFERENCES; LEARNING COMMUNITIES; PRIOR KNOWLEDGE; THEORETICAL ANALYSIS;

MODEL STRUCTURES;

EID: 49749120972     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.42     Document Type: Conference Paper

References (35)

1. http://trec.nist.gov/.
2. E. Airoldi, D. Blei, E. Xing, and S. Fienberg. Mixed membership stochastic block models for relational data with application to protein-protein interactions. In ENAR-2006.
3. A. Banerjee, I. S. Dhillon, J. Ghosh, and S. Sra. Generative model-based clustering of directional data. In KDD'03), pages 19-28.
4. T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In PPSC, pages 445-452, 1993.
5. P. K. Chan, M. D. F. Schlag, and J. Y. Zien. Spectral k-way ratio-cut partitioning and clustering. In DAC '93, pages 749-754, 1993.
6. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Eur. Phys, 2004.
7. I. Dhillon, Y. Guan, and B. Kulis. A unified view of kernel k-means, spectral clustering and graph cuts. Technical Report TR-04-25, University of Texas at Austin, 2004.
8. I. Dhillon, Y. Guan, and B. Kulis. A fast kernel-based multilevel algorithm for graph clustering. In KDD '05, 2005.
9. I. Dhillon, Y. Guan, and B. Kulis. A fast kernel-based multilevel algorithm for graph clustering. In KDD '05, pages 629-634, 2005.
10. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269-274, 2001.
11. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of ICDM 2001, pages 107-114, 2001.
12. S. E. Fienberg, M. M. Meyer, and S. Wasserman. Satistical analysis of multiple cociometric relations. Journal of American Satistical Association, 80:51-87, 1985.
13. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In National Academic Science, 2001.
14. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Supercomputing '95, page 28, 1995.
15. M. Henzinger, R. Motwani, and C. Silverstein. Challenges in web search engines. In Proc. of the 18th International Joint Conference on Artificial Intelligence, pages 1573-1579, 2003.
16. P. Hoff, A. Rafery, and M. Handcock. Latent space approaches to social network analysis. Journal of American Satistical Association, 97:1090-1098, 2002.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
18. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
19. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
20. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11-16), 1999.
21. K. Lang. News weeder: Learning to filter netnews. In ICML, 1995.
22. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, pages 556-562, 2000.
23. B. Long, Z. M. Zhang, X. Wu, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML'06, 2006.
24. M. E. J. Newman. Detecting community structure in networks. Eur. Phys, 38:321-330, 2003.
25. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev., E" 2004.
26. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 2001.
27. P. Reddy and M. Kitsuregawa. Inferring web communities through relaxed cocitation and dense bipartite graphs. In Data Basis Engineering Workshop, 2001.
28. R. Salakhutdinov and S. Roweis. Adaptive overrelaxed bound optimization methods. In ICML'03, 2003.
29. J. P. Scott. Social Network Analysis: A Handbook. SAGE Publications, January 2000.
30. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
31. T. Snijders. Markov chain monte carlo estimation of exponential random graph models. Journal of Ssocial Structure, 2002.
32. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. In AAAI 2002, pages 93-98, 2002.
33. A. Y. Wu, M. Garland, and J. Han. Mining scale-free networks using geodesic clustering. In KDD '04, pages 719-724. ACM Press, 2004.
34. S. Yu and J. Shi. Multiclass spectral clustering. In ICCV'03., 2003.
35. H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Bi-partite graph partitioning and data clustering. In ACM CIKM'01, 2001.