{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,17]],"date-time":"2026-11-17T20:42:53Z","timestamp":1794948173951,"version":"4.9.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>\n            Given a social graph, the problem of influence maximization is to determine a set of nodes that maximizes the spread of influences. While some recent research has studied the problem of influence maximization, these works are generally too time consuming for practical use in a large-scale social network. In this article, we develop a new framework,\n            <jats:italic>community-based influence maximization<\/jats:italic>\n            (CIM), to tackle the influence maximization problem with an emphasis on the time efficiency issue. Our proposed framework, CIM, comprises three phases: (i) community detection, (ii) candidate generation, and (iii) seed selection. Specifically, phase (i) discovers the community structure of the network; phase (ii) uses the information of communities to narrow down the possible seed candidates; and phase (iii) finalizes the seed nodes from the candidate set. By exploiting the properties of the community structures, we are able to avoid overlapped information and thus efficiently select the number of seeds to maximize information spreads. The experimental results on both synthetic and real datasets show that the proposed CIM algorithm significantly outperforms the state-of-the-art algorithms in terms of efficiency and scalability, with almost no compromise of effectiveness.\n          <\/jats:p>","DOI":"10.1145\/2532549","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T15:24:14Z","timestamp":1398698654000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":162,"title":["CIM"],"prefix":"10.1145","volume":"5","author":[{"given":"Yi-Cheng","family":"Chen","sequence":"first","affiliation":[{"name":"Tamkang University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-Yuan","family":"Zhu","sequence":"additional","affiliation":[{"name":"National Chiao Tung University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-Chih","family":"Peng","sequence":"additional","affiliation":[{"name":"National Chiao Tung University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suh-Yin","family":"Lee","sequence":"additional","affiliation":[{"name":"National Chiao Tung University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,4,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/43601"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 26th IEEE International Conference on Data Engineering (ICDE'10)","author":"Bortner D.","unstructured":"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. 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."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 6th SNA-KDD Workshop on Social Network Mining and Analysis held in conjunction with KDD'12 (SNA-KDD'12)","author":"Chen Y.","unstructured":"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. 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.16"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96)","author":"Ester M.","unstructured":"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. 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."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the International Joint Conference on Neural Networks (IJCNN'07)","author":"Estevez P.","unstructured":"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. 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."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 9th International Conference on Data Warehousing and Knowledge Discovery (DaWaK'07)","author":"Feng Z.","unstructured":"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. 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."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML'11)","author":"Gomez-Rodrigues M.","unstructured":"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. 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."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835933"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871469"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_2_1_22_1","first-page":"4","article-title":"Benchmark graphs for testing community detection algorithms. Phy","volume":"78","author":"Lancichinetti A.","year":"2008","unstructured":"A. Lancichinetti , S. Fortnato , and F. Radicchi . 2008 . Benchmark graphs for testing community detection algorithms. Phy . Rev. E 78 , 4 . A. Lancichinetti, S. Fortnato, and F. Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Phy. Rev. E 78, 4.","journal-title":"Rev. E"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458115"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS'10)","author":"Myers S.","unstructured":"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. 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."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Conference on Neural Information Processing Systems: Natural and Synthetic (NIPS'01)","author":"Ng A.","unstructured":"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. 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."},{"key":"e_1_2_1_26_1","first-page":"6","article-title":"Fast algorithm for detecting community structure in networks. Phy","volume":"69","author":"Newman M.","year":"2004","unstructured":"M. Newman . 2004 . Fast algorithm for detecting community structure in networks. Phy . Rev. E 69 , 6 . M. Newman. 2004. Fast algorithm for detecting community structure in networks. Phy. Rev. E 69, 6.","journal-title":"Rev. E"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"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.  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.","DOI":"10.1038\/nature03607"},{"key":"e_1_2_1_29_1","volume-title":"Diffusion of Innovations","author":"E.","unstructured":"E. ROGERS. 2003. Diffusion of Innovations . 5 th Ed., Free Press, New York , NY. E. ROGERS. 2003. Diffusion of Innovations. 5th Ed., Free Press, New York, NY.","edition":"5"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.72"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0396-2"},{"key":"e_1_2_1_32_1","volume-title":"Network Models of the Diffusion of Innovations","author":"Valente T.","unstructured":"T. Valente . 1995. Network Models of the Diffusion of Innovations . Hampton Press . T. Valente. 1995. Network Models of the Diffusion of Innovations. Hampton Press."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88192-6_64"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03348-3_34"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"S. Wasserman and K. Faust. 1994. Social network analysis: Methods and applications. Cambridge University Press.  S. Wasserman and K. Faust. 1994. Social network analysis: Methods and applications. Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 5th SIAM International Conference on Data Mining (SDM'05)","author":"White S.","unstructured":"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. 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."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_1_38_1","volume-title":"The diffusion of innovations in social networks. Economics Working Paper 437","author":"Young H.","unstructured":"H. Young . 2000. The diffusion of innovations in social networks. Economics Working Paper 437 , Johns Hopkins University . H. Young. 2000. The diffusion of innovations in social networks. Economics Working Paper 437, Johns Hopkins University."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2532549","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2532549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:22Z","timestamp":1750232062000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2532549"}},"subtitle":["Community-Based Influence Maximization in Social Networks"],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.1145\/2532549"],"URL":"https:\/\/doi.org\/10.1145\/2532549","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"2012-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}