{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:00Z","timestamp":1750306320213,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":4,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation of Korea","award":["NRF-2014R1A2A1A10054151","No.2015R1A5A7037751"],"award-info":[{"award-number":["NRF-2014R1A2A1A10054151","No.2015R1A5A7037751"]}]},{"name":"the Institute for Information and Communications Technology Promotion","award":["No.R22121500070001002"],"award-info":[{"award-number":["No.R22121500070001002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1145\/2872518.2889407","type":"proceedings-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T20:35:52Z","timestamp":1485203752000},"page":"59-60","source":"Crossref","is-referenced-by-count":5,"title":["Accurate Path-based Methods for Influence Maximization in Social Networks"],"prefix":"10.1145","author":[{"given":"Yun-Yong","family":"Ko","sequence":"first","affiliation":[{"name":"Hanyang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Kyu","family":"Chae","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2872518.2889407-1","doi-asserted-by":"crossref","unstructured":"W. Chen et al. Efficient influence maximization in social networks. In SIGKDD, pages 199--208. ACM, 2009.","DOI":"10.1145\/1557019.1557047"},{"key":"key-10.1145\/2872518.2889407-2","doi-asserted-by":"crossref","unstructured":"A. Goyal et al. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM, pages 211--220. IEEE, 2011.","DOI":"10.1109\/ICDM.2011.132"},{"key":"key-10.1145\/2872518.2889407-3","doi-asserted-by":"crossref","unstructured":"D. Kempe et al. Maximizing the spread of influence through a social network. In SIGKDD, pages 137--146. ACM, 2003.","DOI":"10.1145\/956750.956769"},{"key":"key-10.1145\/2872518.2889407-4","doi-asserted-by":"crossref","unstructured":"J. Kim et al. Scalable and parallelizable processing of influence maximization for large-scale social networks? In ICDE, pages 266--277. IEEE, 2013.","DOI":"10.1109\/ICDE.2013.6544831"}],"event":{"number":"25","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '16 Companion","name":"the 25th International Conference Companion","start":{"date-parts":[[2016,4,11]]},"location":"Montréal, Québec, Canada","end":{"date-parts":[[2016,4,15]]}},"container-title":["Proceedings of the 25th International Conference Companion on World Wide Web - WWW '16 Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2872518.2889407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2889407&ftid=1707781&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:16Z","timestamp":1750222456000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2872518.2889407"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2016]]},"references-count":4,"URL":"https:\/\/doi.org\/10.1145\/2872518.2889407","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}