{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:43:14Z","timestamp":1726058594515},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349790"},{"type":"electronic","value":"9783030349806"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-34980-6_12","type":"book-chapter","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T01:03:07Z","timestamp":1573434187000},"page":"95-107","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hop-Based Sketch for Large-Scale Influence Analysis"],"prefix":"10.1007","author":[{"given":"Phuc D.","family":"Thai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thang N.","family":"Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038. ACM (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: CIKM, pp. 629\u2013638. ACM (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"12_CR4","unstructured":"Du, N., Song, L., Gomez-Rodriguez, M., Zha, H.: Scalable influence estimation in continuous-time diffusion networks. In: NIPS, pp. 3147\u20133155 (2013)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: WWW, pp. 591\u2013600. ACM (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp. 187. ACM (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lucier, B., Oren, J., Singer, Y.: Influence at scale: distributed computation of complex contagion in networks. In: KDD, pp. 735\u2013744. ACM (2015)","DOI":"10.1145\/2783258.2783334"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Nguyen, T.P., Phan, N., Dinh, T.N.: Importance sketching of influence dynamics in billion-scale networks. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 337\u2013346. IEEE (2017)","DOI":"10.1109\/ICDM.2017.43"},{"issue":"1","key":"12_CR10","first-page":"20","volume":"1","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Nguyen, T.P., Vu, T.N., Dinh, T.N.: Outward influence and cascade size estimation in billion-scale networks. Proc. ACM Measur. Anal. Comput. Syst. 1(1), 20 (2017)","journal-title":"Proc. ACM Measur. Anal. Comput. Syst."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Cost-aware targeted viral marketing in billion-scale networks. In: INFOCOM, pp. 1\u20139. IEEE (2016)","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, New York, NY, USA, pp. 695\u2013710. ACM (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans. Netw. 25(4), 2419\u20132429 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"12","key":"12_CR14","first-page":"1077","volume":"9","author":"N Ohsaka","year":"2016","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.-I.: Dynamic influence analysis in evolving networks. VLDB 9(12), 1077\u20131088 (2016)","journal-title":"VLDB"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Popova, D., Ohsaka, N., Kawarabayashi, K.-I., Thomo, A.: Nosingles: a space-efficient algorithm for influence maximization. In: Proceedings of the 30th International Conference on Scientific and Statistical Database Management, p. 18. ACM (2018)","DOI":"10.1145\/3221269.3221291"},{"key":"12_CR16","unstructured":"SNAP: Stanford network analysis project (2017). \nhttp:\/\/snap.stanford.edu"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34980-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T01:10:04Z","timestamp":1573434604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34980-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349790","9783030349806"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34980-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"120","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":"22","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":"8","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":"18% - 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":"5","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)"}}]}}