{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:33Z","timestamp":1767138873358,"version":"build-2238731810"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811532801","type":"print"},{"value":"9789811532818","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3281-8_13","type":"book-chapter","created":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:02:51Z","timestamp":1580882571000},"page":"142-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Influence Maximization Based on Community Closeness in Social Networks"],"prefix":"10.1007","author":[{"given":"Qingqing","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, San Francisco, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, Edmonton, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., Abbadi, A.-E.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, WWW, Hyderabad, pp. 665\u2013674 (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"He, X., Song, G., Chen, W.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM International Conference on Data Mining, SDM, Anaheim, pp. 463\u2013474 (2011)","DOI":"10.1137\/1.9781611972825.40"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429. ACM, San Jose (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, Washington (2003)","DOI":"10.1145\/956750.956769"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47\u201348. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208. ACM, Paris (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.physa.2017.11.138","volume":"492","author":"H-L Liu","year":"2018","unstructured":"Liu, H.-L., Ma, C., Xiang, B.-B.: Identifying multiple influential spreaders based on generalized closeness centrality. Phys. A 492, 2237\u20132248 (2018)","journal-title":"Phys. A"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"23405","DOI":"10.1109\/ACCESS.2017.2758353","volume":"5","author":"J Zhu","year":"2017","unstructured":"Zhu, J., Liu, Y., Yin, X.: A new structure-hole-based algorithm for influence maximization in large online social networks. IEEE Access 5, 23405\u201323412 (2017)","journal-title":"IEEE Access"},{"key":"13_CR11","unstructured":"Kim, J., Kim, S.-K., Yu, H.: Scalable and parallelizable processing of influence maximization for large-scale social networks. In: 29th IEEE International Conference on Data Engineering, pp. 266\u2013277. IEEE, Brisbane (2013)"},{"issue":"8","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu, B., Cong, G., Zeng, Y.: Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans. Knowl. Data Eng. 26(8), 1904\u20131917 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Ko, Y.-Y., Chae, D.-K., Kim, S.-W.: Accurate path-based methods for influence maximization in social networks. In: Proceedings of the 25th International Conference Companion on World Wide Web, WWW, Geneva, pp. 59\u201360 (2016)","DOI":"10.1145\/2872518.2889407"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"056102","DOI":"10.1103\/PhysRevE.79.056102","volume":"79","author":"A Galstyan","year":"2009","unstructured":"Galstyan, A., Musoyan, V.: Maximizing influence propagation in networks with community structure. Phys. Rev. E 79(2), 056102 (2009)","journal-title":"Phys. Rev. E"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Cao, T., Wu, X., Wang, S., Hu, X.: OASNET: an optimal allocation approach to influence maximization in modular social networks. In: ACM Symposium on Applied Computing, SAC, Sierre, pp. 1088\u20131094 (2010)","DOI":"10.1145\/1774088.1774314"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G.: Community-based greedy algorithm for mining top-K influential nodes in mobile social network. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039\u20131048. ACM, Washington (2010)","DOI":"10.1145\/1835804.1835935"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang, J., Zhou, S., Li, X.: CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117, 88\u2013100 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","volume":"512","author":"J Shang","year":"2018","unstructured":"Shang, J., Wu, H.: IMPC: influence maximization based on multi-neighbor potential in community networks. Phys. A 512, 1085\u20131103 (2018)","journal-title":"Phys. A"},{"issue":"12","key":"13_CR19","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-03348-3_34","volume-title":"Advanced Data Mining and Applications","author":"Y Wang","year":"2009","unstructured":"Wang, Y., Feng, X.: A potential-based node selection strategy for influence maximization in a social network. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS (LNAI), vol. 5678, pp. 350\u2013361. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03348-3_34"},{"issue":"4 Pt 2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4 Pt 2), 046110 (2008)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J\u00e1nos.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)","journal-title":"New J. Phys."}],"updated-by":[{"DOI":"10.1007\/978-981-15-3281-8_16","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000}}],"container-title":["Communications in Computer and Information Science","Web Information Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3281-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T02:18:34Z","timestamp":1585707514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3281-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811532801","9789811532818"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3281-8_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"1 April 2020","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The originally published version of the paper on p. 142 contained several inaccuracies in the content and references. To achieve better understanding the following corrections were made:","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2019.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WISE 2019 has been postponed until January 2020 because of the problems in Hong Kong. For CCIS volume, Submissions: 30. Full papers accepted: 10. Short papers accepted: 5.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}