Social influence based clustering of heterogeneous information networks

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

Volumn Part F128815, Issue , 2013, Pages 338-346

  Zhou, Yang ^a   Liu, Ling ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Graph clustering; Heterogeneous network; Social influence

Indexed keywords

DATA MINING; HETEROGENEOUS NETWORKS; INFORMATION SERVICES; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; RAPID THERMAL ANNEALING;

GRAPH CLUSTERING; HETEROGENEOUS INFORMATION; INFORMATION NETWORKS; ITERATIVE LEARNING ALGORITHMS; NONLINEAR FRACTIONAL PROGRAMMING; NONLINEAR PARAMETRIC PROGRAMMING; SOCIAL INFLUENCE; SOCIAL RELATIONSHIPS;

ECONOMIC AND SOCIAL EFFECTS;

EID: 85015290085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487640     Document Type: Conference Paper

References (28)

1. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
2. P. Domingos and M. Richardson. Mining the network value of customers. In KDD, pages 57-66, 2001.
3. H. Ma, H. Yang, M. R. Lyu, and I. King. Mining social networks using heat diffusion processes for marketing candidates selection. In CIKM, pages 233-242, 2008.
4. M. Roth, A. Ben-David, D. Deutscher, G. Flysher, I. Horn, A. Leichtberg, N. Leiser, Y. Matias, and R. Merom. Suggesting friends using the implicit social graph. In KDD, pages 233-242, 2010.
5. S. Myers, C. Zhu, J. Leskovec. Information Diffusion and External Influence in Networks. In KDD, pages 33-41, 2012.
6. B. Taskar, E. Segal, D. Koller. Probabilistic Classification and Clustering in Relational Data. In IJCAI, 2001.
7. D. Cai, Z. Shao, X. He, X. Yan, and J. Han. Community mining from multi-relational networks. In PKDD, 2005.
8. T. Yang, R. Jin, Y. Chi, and S. Zhu. Combining link and content for community detection: A discriminative approach. In KDD, pages 927-936, 2009.
9. M. Ji, J. Han, and M. Danilevsky. Ranking-based classification of heterogeneous information networks. In KDD, pages 1298-1306, 2011.
10. X. Yu, Y. Sun, P. Zhao, and J. Han. Query-driven discovery of semantically similar substructures in heterogeneous networks. In KDD, pages 1500-1503, 2012.
11. J. Shi and J. Malik. Normalized cuts and image segmentation. In TPAMI, 22(8), pages 888-905, 2000.
12. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. In Phys. Rev. E 69, 026113, 2004.
13. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: A structural clustering algorithm for networks. In KDD, 2007.
14. V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: Applications to community discovery. In KDD, 2009.
15. K. Macropol and A. Singh. Scalable discovery of best clusters on large graphs. In PVLDB, 3(1), 693-702, 2010.
16. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD, 567-580, 2008.
17. N. Zhang, Y. Tian, and J. M. Patel. Discovery-driven graph summarization. In ICDE, pages 880-891, 2010.
18. E. C. Kenley and Y.-R. Cho. Entropy-based graph clustering: Application to biological and social networks. In ICDM'11.
19. M. Shiga, I. Takigawa, H. Mamitsuka. A spectral clustering approach to optimally combining numericalvectors with a modular network. In KDD, 2007.
20. Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. In VLDB, 718-729, 2009.
21. Z. Xu, Y. Ke, Y. Wang, H. Cheng, and J. Cheng. A model-based approach to attributed graph clustering. In SIGMOD, pages 505-516, 2012.
22. Y. Sun, B. Norick, J. Han, X. Yan, P. Yu, X. Yu. Integrating Meta-Path Selection with User-Guided Object Clustering in Heterogeneous Information Networks. In KDD, 2012.
23. Y. Sun, C. C. Aggarwal, and J. Han. Relation strength-Aware clustering of heterogeneous information networks with incomplete attributes. PVLDB, 5(5):394-405, 2012.
24. 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, 2009.
25. L. Kaufman and P. J. Rousseeuw. Clustering by means of medoids. Statistical Data Analysis based on the L1 Norm, pages 405-416, 1987.
26. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1997.
27. L. Botton and Y. Bengio. Convergence properties of the k-means algorithms. In NIPS, pages 585-592, 1994.
28. Y. Zhou, H. Cheng, and J. X. Yu. Clustering large attributed graphs: An efficient incremental approach. In ICDM, 2010.