{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:29:30Z","timestamp":1782959370906,"version":"3.54.5"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61772484"],"award-info":[{"award-number":["61772484"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association CAS","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"crossref"}]},{"name":"GRF","award":["14200420"],"award-info":[{"award-number":["14200420"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,6,28]]},"abstract":"<jats:p>Finding the set of most influential users in online social networks (OSNs) to trigger the largest influence cascade is meaningful, e.g., companies may leverage the \u201cword-of-mouth\u201d effect to trigger a large cascade of purchases by offering free samples\/discounts to those most influential users. This task is usually modeled as an influence maximization problem, and it has been widely studied in the past decade. However, considering that users in OSNs may participate in various online activities, e.g., joining discussion groups and commenting on same pages or products, influence diffusion through online activities becomes even more significant. In this article, we study the impact of online activities by formulating social-activity networks which contain both users and online activities, and thus induce two types of weighted edges, i.e., edges between users and edges between users and activities. To address the computation challenge, we define an influence centrality via random walks, and use the Monte Carlo framework to efficiently estimate the centrality. Furthermore, we develop a greedy-based algorithm with novel optimizations to find the most influential users for node recommendation. Experiments on real-world datasets show that our approach is very computationally efficient under different influence models, and also achieves larger influence spread by considering online activities.<\/jats:p>","DOI":"10.1145\/3451218","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T17:08:53Z","timestamp":1621444133000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["On Modeling Influence Maximization in Social Activity Networks under General Settings"],"prefix":"10.1145","volume":"15","author":[{"given":"Rui","family":"Wang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongkun","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China and AnHui Province Key Laboratory of High Performance Computing, Hefei"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuai","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Xie","sequence":"additional","affiliation":[{"name":"Chongqing University, Shapingba, Chongqing"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John C. S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, NT, Hong Kong SAR"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"[n.d.]. http:\/\/www.public.asu.edu\/ jtang20\/datasetcode\/truststudy.htm.  [n.d.]. http:\/\/www.public.asu.edu\/ jtang20\/datasetcode\/truststudy.htm."},{"key":"e_1_2_1_2_1","unstructured":"[n.d.]. SNAP. Retrieved from https:\/\/snap.standford.edu\/data\/index.html.  [n.d.]. SNAP. Retrieved from https:\/\/snap.standford.edu\/data\/index.html."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01461-4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397244"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634144"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882929"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2926112"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3399661"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2114-7"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.3390\/sym9070100"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-015-1606-6"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 2006 LWA.","author":"Hotho Andreas","year":"2006","unstructured":"Andreas Hotho , Robert J\u00e4schke , Christoph Schmitz , Gerd Stumme , and Klaus-Dieter Althoff . 2006 . Folkrank: A ranking algorithm for folksonomies . In Proceedings of the 2006 LWA. Andreas Hotho, Robert J\u00e4schke, Christoph Schmitz, Gerd Stumme, and Klaus-Dieter Althoff. 2006. Folkrank: A ranking algorithm for folksonomies. In Proceedings of the 2006 LWA."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"e_1_2_1_27_1","unstructured":"Stoppelman Jeremy and Simmons Russel. 2004. Yelp Dataset. Retrieved from https:\/\/www.yelp.com\/dataset_challenge\/dataset.  Stoppelman Jeremy and Simmons Russel. 2004. Yelp Dataset. Retrieved from https:\/\/www.yelp.com\/dataset_challenge\/dataset."},{"key":"e_1_2_1_28_1","volume-title":"Riley","author":"Juran Joseph M.","year":"1999","unstructured":"Joseph M. Juran and James F . Riley . 1999 . The Quality Improvement Process. McGraw Hill New York , NY. Joseph M. Juran and James F. Riley. 1999. The Quality Improvement Process. McGraw Hill New York, NY."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610526"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507173"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358063"},{"key":"e_1_2_1_33_1","volume-title":"Influence maximization on social graphs: A survey","author":"Li Yuchen","year":"2018","unstructured":"Yuchen Li , Ju Fan , Yanhao Wang , and Kian-Lee Tan . 2018. Influence maximization on social graphs: A survey .IEEE Transactions on Knowledge and Data Engineering 30, 10 ( 2018 ), 1852\u20131872. Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. 2018. Influence maximization on social graphs: A survey.IEEE Transactions on Knowledge and Data Engineering 30, 10 (2018), 1852\u20131872."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2015.06.012"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the Annual Technical Conference. USENIX.","author":"Rui Wang","unstructured":"Wang Rui , Yongkun Li , Hong Xie , Yinlong Xu , and John C. S. Lui . 2020. GraphWalker: An I\/O-efficient and resource-friendly graph analytic system for fast and scalable random walks . In Proceedings of the Annual Technical Conference. USENIX. Wang Rui, Yongkun Li, Hong Xie, Yinlong Xu, and John C. S. Lui. 2020. GraphWalker: An I\/O-efficient and resource-friendly graph analytic system for fast and scalable random walks. In Proceedings of the Annual Technical Conference. USENIX."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220101"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124309"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2783190"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544874"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2019.099747"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2624734"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348373"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the IEEE 35th International Conference on Data Engineering.","author":"Yongkun Li","unstructured":"Li Yongkun , Zhiyong Wu , Shuai Lin , Hong Xie , Min Lv , Yinlong Xu , and John C. S. Lui . 2019. Walking with perception: Efficient random walk sampling via common neighbor awareness . In Proceedings of the IEEE 35th International Conference on Data Engineering. Li Yongkun, Zhiyong Wu, Shuai Lin, Hong Xie, Min Lv, Yinlong Xu, and John C. S. Lui. 2019. Walking with perception: Efficient random walk sampling via common neighbor awareness. In Proceedings of the IEEE 35th International Conference on Data Engineering."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2579356"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113346"},{"key":"e_1_2_1_52_1","volume-title":"Social influence maximization in hypergraph in social networks","author":"Zhu Jianming","year":"2018","unstructured":"Jianming Zhu , Junlei Zhu , Smita Ghosh , Weili Wu , and Jing Yuan . 2018. Social influence maximization in hypergraph in social networks .IEEE Transactions on Network Science and Engineering 6, 4 ( 2018 ), 801\u201311. Jianming Zhu, Junlei Zhu, Smita Ghosh, Weili Wu, and Jing Yuan. 2018. Social influence maximization in hypergraph in social networks.IEEE Transactions on Network Science and Engineering 6, 4 (2018), 801\u201311."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3451218","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3451218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:25Z","timestamp":1750268965000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3451218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6,28]]}},"alternative-id":["10.1145\/3451218"],"URL":"https:\/\/doi.org\/10.1145\/3451218","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,19]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}