Yu Wang
ABSTRACT
With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. A mobile social network plays an essential role as the spread of information and influence in the form of "word-of-mouth". It is a fundamental issue to find a subset of influential individuals in a mobile social network such that targeting them initially (e.g. to adopt a new product) will maximize the spread of the influence (further adoptions of the new product). The problem of finding the most influential nodes is unfortunately NP-hard. It has been shown that a Greedy algorithm with provable approximation guarantees can give good approximation; However, it is computationally expensive, if not prohibitive, to run the greedy algorithm on a large mobile network.
In this paper we propose a new algorithm called Community-based Greedy algorithm for mining top-K influential nodes. The proposed algorithm encompasses two components: 1) an algorithm for detecting communities in a social network by taking into account information diffusion; and 2) a dynamic programming algorithm for selecting communities to find influential nodes. We also provide provable approximation guarantees for our algorithm. Empirical studies on a large real-world mobile social network show that our algorithm is more than an order of magnitudes faster than the state-of-the-art Greedy algorithm for finding top-K influential nodes and the error of our approximate algorithm is small.
Supplemental Material
- R. Albert and A. L. Barabasi. Statistical mechanics of complex networks. In Reviews of Modern Physics, 74, pages 47--97, 2002.Google Scholar
Cross Ref
- Y. Cai, G. Cong, X. Jia, H. Liu, J. He, J. Lu, and X. Du. Efficient algorithm for computing link-based similarity in real world networks. In ICDM, pages 734--739, 2009. Google ScholarDigital Library
- J. Chen, O. R. Zaiane, and R. Goebel. Detecting communities in social networks using max-min modularity. In SIAM, 2009.Google Scholar
- W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, pages 199--208, 2009. Google ScholarDigital Library
- A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70, 2004.Google Scholar
- P. Domingos and M. Richardson. Mining the network value of customers. In KDD, pages 57--66, 2001. Google ScholarDigital Library
- Z. B. Dong, G. J. Song, K. Q. Xie, and J. Y. Wang. An experimental study of large-scale mobile social network. In WWW, pages 1175--1176, 2009. Google ScholarDigital Library
- M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc.Natl.Acad.Sci.USA 99, pages 7821--7826, 2002.Google ScholarCross Ref
- D. Kempe, J. Kleinberg, and E. Tardos. Influential nodes in a diffusion model for social networks. In International colloquium on automata, languages and programming No32, pages 1127--1138, 2005. Google ScholarDigital Library
- D. Kempel, J. Kleinberg, and E. Tardos. Maximizing the spread of inffluence through a social network. In ACM SIGKDD, pages 137--146, 2003. Google ScholarDigital Library
- M. Kimura and K. Saito. Tractable models for information diffusion in social networks. In PKDD 2006, LNAI 4213, pages 259--271, 2006.Google ScholarCross Ref
- M. Kimura, K. Saito, and R. Nakano. Extracting influential nodes for information diffusion on social network. In AAAI, pages 1371--1376, 2007. Google ScholarDigital Library
- M. Kurucz, A. Benczur, K. Csalogany, and L. Lukacs. Spectral clustering in telephone call graphs. In SNAKDD, pages 82--91, 2007. Google ScholarDigital Library
- J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In In Proc. SIGKDD, pages 420--429, 2007. Google ScholarDigital Library
- D. Lopez-Pintado. Diffusion in complex social networks. In Journal of Economic Literature, pages 573--590, 2004.Google Scholar
- 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. Google ScholarDigital Library
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.Google Scholar
- U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. In Phys.Rev.E76, 2007.Google Scholar
- S. Redner. How popular is your paper? An empirical study of the citation distribution. European Physical Journal B, 4:131--134, Aug. 1998.Google ScholarCross Ref
- J. Scripps, P. N. Tan, and A. H. Esfahanian. Exploration of link structure and community-based node roles in network analysis. In Data Mining, IEEE International Conference, pages 649--654, 2007. Google ScholarDigital Library
- J. Scripps, P. N. Tan, and A. H. Esfahanian. Node roles and community structure in networks. In Joint 9th WEBKDD, pages 26--35, 2007. Google ScholarDigital Library
- J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888--905, 2000. Google ScholarDigital Library
- L. Wan, J. Liao, and X. Zhu. Cdpm: Finding and evaluating community structure in social networks. In ADMA, pages 620--627, 2008. Google ScholarDigital Library
- X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: A structural clustering algorithm for networks. In KDD, pages 824--833, 2007. Google ScholarDigital Library
Index Terms
- Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Recommendations
Scalable influence maximization for prevalent viral marketing in large-scale social networks
KDD '10: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data miningInfluence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under certain influence cascade models. The scalability of influence ...
Identifying the influential bloggers in a community
WSDM '08: Proceedings of the 2008 International Conference on Web Search and Data MiningBlogging becomes a popular way for a Web user to publish information on the Web. Bloggers write blog posts, share their likes and dislikes, voice their opinions, provide suggestions, report news, and form groups in Blogosphere. Bloggers form their ...
Selecting Influential Nodes in Social Networks Using Neighborhood Coreness
AbstractWith the proliferation of social networks, the study of the spread of influence has grabbed the attention of researchers from various disciplines. Finding a subset of nodes in a social network that maximizes the spread of influence in the network ...
Comments