Ranking-based clustering of heterogeneous information networks with star network schema

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

Volumn , Issue , 2009, Pages 797-805

  Sun, Yizhou ^a   Yu, Yintao ^a   Han, Jiawei ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Clustering; Heterogeneous information network

Indexed keywords

ATTRIBUTE OBJECTS; CLUSTER MEMBERSHIPS; CLUSTERING; CLUSTERING RESULTS; HETEROGENEOUS INFORMATION; HETEROGENEOUS INFORMATION NETWORK; HIDDEN STRUCTURES; HIGH QUALITY; HOMOGENEOUS NETWORK; INFORMATION NETWORKS; ITERATIVE ENHANCEMENT; NOVEL ALGORITHM; REAL-WORLD NETWORKS; STAR NETWORK; TOPIC MODEL;

HETEROGENEOUS NETWORKS; INFORMATION SERVICES;

CLUSTERING ALGORITHMS;

EID: 70350625449     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557107     Document Type: Conference Paper

References (23)

1. A. Banerjee, S. Basu, and S. Merugu. Multi-way clustering on relation graphs. In SIAM'07, 2007.
2. R. Bekkerman, R. El-Yaniv, and A. McCallum. Multi-way distributional clustering via pairwise interactions. In ICML'05, pages 41-48, 2005.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst., 30(1-7):107-117, 1998.
4. 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 ICDM'01, pages 107-114. IEEE Computer Society, 2001.
5. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM'99, pages 251-262, 1999.
6. T. Hofmann. Probabilistic latent semantic analysis. In UAI'99, pages 289-296, 1999.
7. G. Jeh and J. Widom. SimRank: a measure of structural-context similarity. In KDD'02, pages 538-543. ACM, 2002.
8. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
9. B. Long, Z. M. Zhang, X. W'u, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML'06, pages 585-592, 2006.
10. Q. Mei, D. Zhang, and C. Zhai. A general optimization framework for smoothing language models on graph structures. In SIGIR'08, pages 611-618, 2008.
11. M. E. J. Newman. The structure of scientific collaboration networks. Working Papers 00-07-037, Santa Fe Institute, July 2000.
12. M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89(20):208701+, October 2002.
13. Z. Nie, Y. Zhang, J.-R. Wen, and W.-Y. Ma. Object-level ranking: Bringing order to web objects. In WWW'05, pages 567-574. ACM, May 2005.
14. J. Shi and J. Malik. Normalized cuts and image segmentation. In CVPR'97, page 731. IEEE Computer Society, 1997.
15. M. Steyvers, P. Smyth, M. Rosen-Zvi, and T. Griffiths. Probabilistic author-topic models for information discovery. In KDD'04, pages 306-315, 2004.
16. Y. Sun, J. Han, P. Zhao, Z. Yin, H. Cheng, and T. Wu. Rankclus: Integrating clustering with ranking for heterogenous information network analysis. In EDBT'09, 2009.
17. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD'08, pages 567-580, 2008.
18. U. von Luxburg. A tutorial on spectral clustering. Technical report, Max Planck Institute for Biological Cybernetics, 2006.
19. N. Wang, S. Parthasarathy, K.-L. Tan, and A. K. H. Tung. Csv: visualizing and mining cohesive subgraphs. In SIGMOD'08, pages 445-458, 2008.
20. S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM'05, 2005.
21. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: a structural clustering algorithm for networks. In KDD'07, pages 824-833, 2007.
22. C. Zhai and J. D. Lafferty. A study of smoothing methods for language models applied to information retrieval. ACM Trans. Inf. Syst., 22(2):179-214, 2004.
23. C. Zhai, A. Velivelli, and B. Yu. A cross-collection mixture model for comparative text mining. In KDD'04, pages 743-748, 2004.