CIM: Community-based influence maximization in social networks

ACM Transactions on Intelligent Systems and Technology

Volumn 5, Issue 2, 2014, Pages

  Chen, Yi Cheng ^a   Zhu, Wen Yuan ^b   Peng, Wen Chih ^b   Lee, Wang Chien ^c   Lee, Suh Yin ^b  

^a TAMKANG UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Community detection; Diffusion models; Influence maximization; Social network analysis

Indexed keywords

ALGORITHMS; POPULATION DYNAMICS;

CANDIDATE GENERATION; COMMUNITY DETECTION; COMMUNITY STRUCTURES; DIFFUSION MODEL; INFLUENCE MAXIMIZATIONS; RECENT RESEARCHES; STATE-OF-THE-ART ALGORITHMS; TIME EFFICIENCIES;

SOCIAL NETWORKING (ONLINE);

EID: 84899737385     PISSN: 21576904     EISSN: 21576912     Source Type: Journal    
DOI: 10.1145/2532549     Document Type: Article

References (39)

1. R. Albert, H. Jeong, and A. Barabasi. 1999. Diameter of the World Wide Web. Nature 401, 130-131
2. A. Barabasi and R. Albert. 1999. Emergence of scaling in random networks. Science 286, 509-512
3. D. Bortner and J. Han. 2010. Progressive clustering of networks using structure-connected order of traversal. In Proceedings of the 26th IEEE International Conference on Data Engineering (ICDE?10). 653-656
4. Y. Chen, S. Chang, C. Chou, W. Peng, and S. Lee. 2012. Exploring community structures for influence maximization in social networks. In Proceedings of the 6th SNA-KDD Workshop on Social Network Mining and Analysis held in conjunction with KDD?12 (SNA-KDD?12). 1-6
5. W. Chen, Y. Wang, and S. Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD?09). 199-208
6. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. 2005. Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005, 9
7. P. Domingos. 2005. Mining social networks for viral marketing. IEEE Intell. Syst. 20, 1, 80-93
8. P. Domingos and M. Richardson. 2001. Mining the network value of customers. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD?01). 57-66
9. P. Domingos and M. Richardson. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD?02). 61-70
10. M. Ester, H. Kriegel, J. Sander, and X. Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD?96). 226-231
11. P. Estevez, P. Vera, and K. Saito. 2007. Selecting the most influential nodes in social network. In Proceedings of the International Joint Conference on Neural Networks (IJCNN?07). 2397-2402
12. Z. Feng, X. Xu, N. Yuruk, and T. Schweiger. 2007. A novel similarity-based modularity function for graph partitioning. In Proceedings of the 9th International Conference on Data Warehousing and Knowledge Discovery (DaWaK?07). 385-396
13. L. Freeman. 1977. A set of measures of centrality based on betweenness. Sociometry 40, 1, 35-41
14. M. Girvan and M. Newman. 2002. Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99, 12, 7821-7826
15. J. Goldenberg, B. Libai, and E. Muller. 2001. Talk of network: A complex systems look at the underlying process of word-of-mouth. Market. Lett. 12, 3, 211-223
16. M. Gomez-Rodrigues, D. Balduzzi, and B. Scholkopf. 2011. Uncovering the temporal dynamics of diffusion networks. In Proceedings of the 28th International Conference on Machine Learning (ICML?11). 561-568
17. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. 2010. Inferring networks of diffusion and influence. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining( KDD?10). 1019-1028
18. J. Huang, H. Sun, J. Han, H. Deng, Y. Sun, and Y. Liu. 2010. SHRINK: A structural clustering algorithm for detecting hierarchical communities in networks. In Proceedings of the 19th ACM Conference on Information and Knowledge Management (CIKM?10). 219-228
19. G. Karypis, and V. Kumar. 1996. Parallel multilevel k-way partitioning scheme for irregular graphs. In Proceedings of the ACM/IEEE Conference on Supercomputing (SC?96). 1-21
20. D. Kempe, J. Kleinberg, and E. Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD?03). 137-146
21. A. Lancichinetti, S. Fortnato, and J. Keryesz. 2009. Detecting the overlapping and hierarchical community structure in complex network. New J. Physics 11, 3
22. A. Lancichinetti, S. Fortnato, and F. Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Phy. Rev. E 78, 4
23. H. Ma, H. Yang, M. Lyu, and I. King. 2008. Mining social networks using heat diffusion processes for marketing candidates selection. In Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM?08). 233-242
24. S. Myers and J. Leskovec. 2010. On the convexity of latent social network inference. In Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS?10). 1741-1749
25. A. Ng, M. Jordan, and Y. Weiss. 2001. On spectral clustering: Analysis and an algorithm. In Proceedings of the Conference on Neural Information Processing Systems: Natural and Synthetic (NIPS?01). 849-856
26. M. Newman. 2004. Fast algorithm for detecting community structure in networks. Phy. Rev. E 69, 6
27. M. Newman. 2006. Modularity and community structure in networks. Proc. Nat. Acad. Sci. U.S.A 103, 23, 8577-8582
28. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. 2005. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435. 814-818
29. E. ROGERS. 2003. Diffusion of Innovations. 5th Ed., Free Press, New York, NY.
30. J. Ruan and W. Zhang. 2007. An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In Proceedings of the 7th IEEE International Conference on Data Mining (ICDM?07). 643-648
31. K. Saito, M. Kimura, K. Ohara, and H. Motoda. 2011. Efficient discovery of influential nodes for SIS models in social networks. Knowl. Inform. Syst. 30, 3, 613-635
32. T. Valente. 1995. Network Models of the Diffusion of Innovations. Hampton Press
33. L.Wan, J. Liao, and X. Zhu. 2008. Finding evaluating community structure in social networks. In Proceedings of the 4th International Conference on Advanced Data Mining and Applications (ADMA?08). 620-627
34. Y. Wang and X. Feng. 2009. A potential-based node selection strategy for influence maximization in a social network. In Proceedings of the 5th International Conference on Advanced Data Mining and Applications( ADMA?09). 350-361
35. S.Wasserman and K. Faust. 1994. Social network analysis: Methods and applications. Cambridge University Press
36. S. White and P. Smyth. 2005. A spectral clustering approach to finding communities in graph. In Proceedings of the 5th SIAM International Conference on Data Mining (SDM?05). 274-286
37. X. Xu, N. Yuruk, Z. Feng, and T. Schweiger. 2007. SCAN: A structural clustering algorithm for networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD?07). 824-833
38. H. Young. 2000. The diffusion of innovations in social networks. Economics Working Paper 437, Johns Hopkins University
39. W. Zachary. 1997. An information flow model for conflict and fission in small group. J. Anthro. Res. 33, 452-473