{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:59Z","timestamp":1750220399337,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"GRF","award":["14200420"],"award-info":[{"award-number":["14200420"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,8]]},"DOI":"10.1145\/3487351.3488347","type":"proceedings-article","created":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T12:16:07Z","timestamp":1645272967000},"page":"209-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Pricing social visibility service in online social networks"],"prefix":"10.1145","author":[{"given":"Shiyuan","family":"Zheng","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}]},{"given":"Hong","family":"Xie","sequence":"additional","affiliation":[{"name":"Chongqing University"}]},{"given":"John C. S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Pricing social visibility service in online social networks: Modeling and algorithms,\" arXiv preprint arXiv:2106.10473","author":"Zheng S.","year":"2021","unstructured":"S. Zheng , H. Xie , and J. Lui , \" Pricing social visibility service in online social networks: Modeling and algorithms,\" arXiv preprint arXiv:2106.10473 , 2021 . S. Zheng, H. Xie, and J. Lui, \"Pricing social visibility service in online social networks: Modeling and algorithms,\" arXiv preprint arXiv:2106.10473, 2021."},{"key":"e_1_3_2_1_2_1","volume-title":"Notes on the N-person Game-II: The Value of an N-person Game","author":"Shapley L. S.","year":"1951","unstructured":"L. S. Shapley , Notes on the N-person Game-II: The Value of an N-person Game . Rand Corporation , 1951 . L. S. Shapley, Notes on the N-person Game-II: The Value of an N-person Game. Rand Corporation, 1951."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-009-9078-9"},{"key":"e_1_3_2_1_4_1","first-page":"1343","volume-title":"Proc. Int. Conf. on World Wide Web Companion","author":"Kunegis J.","year":"2013","unstructured":"J. Kunegis , \"KO NECT - The Koblenz Network Collection ,\" in Proc. Int. Conf. on World Wide Web Companion , 2013 , pp. 1343 -- 1350 . J. Kunegis, \"KONECT - The Koblenz Network Collection,\" in Proc. Int. Conf. on World Wide Web Companion, 2013, pp. 1343--1350."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-014-7170-x"},{"key":"e_1_3_2_1_6_1","volume-title":"ACM KDD","author":"Kempe D.","year":"2003","unstructured":"D. Kempe , J. Kleinberg , and \u00c9. Tardos, \"Maximizing the spread of influence through a social network,\" in Proc . ACM KDD , 2003 . D. Kempe, J. Kleinberg, and \u00c9. Tardos, \"Maximizing the spread of influence through a social network,\" in Proc. ACM KDD, 2003."},{"key":"e_1_3_2_1_7_1","volume-title":"ACM KDD. ACM","author":"Domingos P.","year":"2001","unstructured":"P. Domingos and M. Richardson , \" Mining the network value of customers,\" in Proc . ACM KDD. ACM , 2001 . P. Domingos and M. Richardson, \"Mining the network value of customers,\" in Proc. ACM KDD. ACM, 2001."},{"key":"e_1_3_2_1_8_1","first-page":"883","volume-title":"IEEE","author":"Lin Y.","year":"2017","unstructured":"Y. Lin , W. Chen , and J. C. Lui , \" Boosting information spread: An algorithmic approach,\" in 2017 IEEE 33rd International Conference on Data Engineering (ICDE) . IEEE , 2017 , pp. 883 -- 894 . Y. Lin, W. Chen, and J. C. Lui, \"Boosting information spread: An algorithmic approach,\" in 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, 2017, pp. 883--894."},{"key":"e_1_3_2_1_9_1","volume-title":"ACM KDD. ACM","author":"Richardson M.","year":"2002","unstructured":"M. Richardson and P. Domingos , \" Mining knowledge-sharing sites for viral marketing,\" in Proc . ACM KDD. ACM , 2002 . M. Richardson and P. Domingos, \"Mining knowledge-sharing sites for viral marketing,\" in Proc. ACM KDD. ACM, 2002."},{"issue":"6","key":"e_1_3_2_1_10_1","first-page":"11501170","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"Zhou L. L","year":"2011","unstructured":"L. L and T. Zhou , \" Link prediction in complex networks: A survey ,\" Physica A: Statistical Mechanics and its Applications , vol. 390 , no. 6 , p. 11501170 , Mar 2011 . L. L and T. Zhou, \"Link prediction in complex networks: A survey,\" Physica A: Statistical Mechanics and its Applications, vol. 390, no. 6, p. 11501170, Mar 2011.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"4","key":"e_1_3_2_1_11_1","first-page":"69","article-title":"A survey of link prediction in complex networks","volume":"49","author":"Mart\u00ednez V.","year":"2017","unstructured":"V. Mart\u00ednez , F. Berzal , and J.-C. Cubero , \" A survey of link prediction in complex networks ,\" ACM CSUR , vol. 49 , no. 4 , p. 69 , 2017 . V. Mart\u00ednez, F. Berzal, and J.-C. Cubero, \"A survey of link prediction in complex networks,\" ACM CSUR, vol. 49, no. 4, p. 69, 2017.","journal-title":"ACM CSUR"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245121"},{"key":"e_1_3_2_1_14_1","volume-title":"ACM SIGIR. ACM","author":"Ma H.","year":"2014","unstructured":"H. Ma , \"On measuring social friend interest similarities in recommender systems,\" in Proc . ACM SIGIR. ACM , 2014 . H. Ma, \"On measuring social friend interest similarities in recommender systems,\" in Proc. ACM SIGIR. ACM, 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"e_1_3_2_1_16_1","volume-title":"IEEE\/ACM CGCC. IEEE Computer Society","author":"Xie X.","year":"2010","unstructured":"X. Xie , \"Potential friend recommendation in online social network,\" in Proc . IEEE\/ACM CGCC. IEEE Computer Society , 2010 . X. Xie, \"Potential friend recommendation in online social network,\" in Proc. IEEE\/ACM CGCC. IEEE Computer Society, 2010."}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Virtual Event Netherlands","acronym":"ASONAM '21"},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488347","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3488347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:48Z","timestamp":1750191528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488347"}},"subtitle":["modeling and algorithms"],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":16,"alternative-id":["10.1145\/3487351.3488347","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3488347","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}