{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T19:29:15Z","timestamp":1782502155471,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835935","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"1039-1048","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":400,"title":["Community-based greedy algorithm for mining top-K influential nodes in mobile social networks"],"prefix":"10.1145","author":[{"given":"Yu","family":"Wang","sequence":"first","affiliation":[{"name":"Key Laboratory of Machine Perception, Ministry of Education, Peking University, China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Nanyang Technological University, Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guojie","family":"Song","sequence":"additional","affiliation":[{"name":"Key Laboratory of Machine Perception, Ministry of Education, Peking University, China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunqing","family":"Xie","sequence":"additional","affiliation":[{"name":"Key Laboratory of Machine Perception, Ministry of Education, Peking University, China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.136"},{"key":"e_1_3_2_2_3_1","volume-title":"Detecting communities in social networks using max-min modularity","author":"Chen J.","year":"2009","unstructured":"J. Chen , O. R. Zaiane , and R. Goebel . Detecting communities in social networks using max-min modularity . In SIAM , 2009 . J. Chen, O. R. Zaiane, and R. Goebel. Detecting communities in social networks using max-min modularity. In SIAM, 2009."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_2_5_1","volume-title":"Finding community structure in very large networks. Physical Review E, 70","author":"Clauset A.","year":"2004","unstructured":"A. Clauset , M. E. J. Newman , and C. Moore . Finding community structure in very large networks. Physical Review E, 70 , 2004 . A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70, 2004."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526915"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_91"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871637_27"},{"key":"e_1_3_2_2_12_1","first-page":"1371","volume-title":"AAAI","author":"Kimura M.","year":"2007","unstructured":"M. Kimura , K. Saito , and R. Nakano . Extracting influential nodes for information diffusion on social network . In AAAI , pages 1371 -- 1376 , 2007 . M. Kimura, K. Saito, and R. Nakano. Extracting influential nodes for information diffusion on social network. In AAAI, pages 1371--1376, 2007."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348559"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_2_15_1","first-page":"573","volume-title":"Journal of Economic Literature","author":"Lopez-Pintado D.","year":"2004","unstructured":"D. Lopez-Pintado . Diffusion in complex social networks . In Journal of Economic Literature , pages 573 -- 590 , 2004 . D. Lopez-Pintado. Diffusion in complex social networks. In Journal of Economic Literature, pages 573--590, 2004."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458115"},{"key":"e_1_3_2_2_17_1","volume-title":"Finding and evaluating community structure in networks. Physical Review E, 69","author":"Newman M. E. J.","year":"2004","unstructured":"M. E. J. Newman and M. Girvan . Finding and evaluating community structure in networks. Physical Review E, 69 , 2004 . M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004."},{"key":"e_1_3_2_2_18_1","author":"Raghavan U. N.","year":"2007","unstructured":"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 . 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.","journal-title":"In Phys.Rev.E76"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100510050359"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.37"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348553"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88192-6_64"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '10","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:03Z","timestamp":1750248543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":24,"alternative-id":["10.1145\/1835804.1835935","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835935","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}