{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T01:13:22Z","timestamp":1776474802564,"version":"3.51.2"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672483, 61403358, U1605251, 61325010 and 71329201"],"award-info":[{"award-number":["61672483, 61403358, U1605251, 61325010 and 71329201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1648664"],"award-info":[{"award-number":["IIS-1648664"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2017,8,31]]},"abstract":"<jats:p>For a long time, PageRank has been widely used for authority computation and has been adopted as a solid baseline for evaluating social influence related applications. However, when measuring the authority of network nodes, the traditional PageRank method does not take the nodes\u2019 prior knowledge into consideration. Also, the connection between PageRank and social influence modeling methods is not clearly established. To that end, this article provides a focused study on understanding PageRank as well as the relationship between PageRank and social influence analysis. Along this line, we first propose a linear social influence model and reveal that this model generalizes the PageRank-based authority computation by introducing some constraints. Then, we show that the authority computation by PageRank can be enhanced if exploiting more reasonable constraints (e.g., from prior knowledge). Next, to deal with the computational challenge of linear model with general constraints, we provide an upper bound for identifying nodes with top authorities. Moreover, we extend the proposed linear model for better measuring the authority of the given node sets, and we also demonstrate the way to quickly identify the top authoritative node sets. Finally, extensive experimental evaluations on four real-world networks validate the effectiveness of the proposed linear model with respect to different constraint settings. The results show that the methods with more reasonable constraints can lead to better ranking and recommendation performance. Meanwhile, the upper bounds formed by PageRank values could be used to quickly locate the nodes and node sets with the highest authorities.<\/jats:p>","DOI":"10.1145\/3046941","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T12:19:44Z","timestamp":1490271584000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["An Influence Propagation View of PageRank"],"prefix":"10.1145","volume":"11","author":[{"given":"Qi","family":"Liu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biao","family":"Xiang","sequence":"additional","affiliation":[{"name":"Ant Financial"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas Jing","family":"Yuan","sequence":"additional","affiliation":[{"name":"Microsoft Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Xiong","sequence":"additional","affiliation":[{"name":"Rutgers University, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zheng","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1971972"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of SIAM Conference on Data Mining (SDM\u201911)","author":"Aggarwal C. C.","unstructured":"C. C. Aggarwal, A. Khan, and X. Yan. 2011. On flow authority discovery in social networks. In Proceedings of SIAM Conference on Data Mining (SDM\u201911). 522--533."},{"key":"e_1_2_1_3_1","volume-title":"Internet: Diameter of the world-wide web. Nature 401, 6749","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Internet: Diameter of the world-wide web. Nature 401, 6749 (1999), 130--131."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.167"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2601921"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609592"},{"key":"e_1_2_1_11_1","volume-title":"Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle. Applied Mathematics 8 Computation 197, 1","author":"Ding Feng","year":"2008","unstructured":"Feng Ding, Peter X. Liu, and Jie Ding. 2008. Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle. Applied Mathematics 8 Computation 197, 1 (2008), 41--50."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21467"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1656289.1656306"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999792.2999963"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502412875"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020430"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398620"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_2_1_20_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"1996","unstructured":"Gene H. Golub and Charles F. Van Loan. 1996. Matrix Computations. Johns Hopkins University Press, 392--396."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3042817.3043011"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718518"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_2_1_24_1","volume-title":"Threshold models of collective behavior. American Journal of Sociology","author":"Granovetter M.","year":"1978","unstructured":"M. Granovetter. 1978. Threshold models of collective behavior. American Journal of Sociology (1978), 1420--1443."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2518176"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_31_1","first-page":"259","article-title":"Tractable models for information diffusion in social networks","volume":"2006","author":"Kimura M.","year":"2006","unstructured":"M. Kimura and K. Saito. 2006. Tractable models for information diffusion in social networks. Knowledge Discovery in Databases 2006 (2006), 259--271.","journal-title":"Knowledge Discovery in Databases"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488451"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129091"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2022850.2022884"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.126"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2366005"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662009"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.48"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783334"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of ECAI Workshop on Recommender Systems.29--33","author":"Massa Paolo","year":"2006","unstructured":"Paolo Massa and Paolo Avesani. 2006. Trust-aware bootstrapping of recommender systems. In Proceedings of ECAI Workshop on Recommender Systems.29--33."},{"key":"e_1_2_1_45_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1999. The pagerank citation ranking: Bringing order to the web. (1999)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367567"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339691"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297920"},{"key":"e_1_2_1_49_1","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Subbian Karthik","unstructured":"Karthik Subbian, Chidananda Sridhar, Charu C. Aggarwal, and Jaideep Srivastava. 2014. Scalable information flow mining in networks. In Machine Learning and Knowledge Discovery in Databases. Springer, 130--146."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.159"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020573"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339627"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718520"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2540128.2540523"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939799"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487685"},{"key":"e_1_2_1_58_1","volume-title":"proceedings of European Conference on Machine Learning and Knowledge Discovery in Databases. 548--564","author":"Yang Y.","unstructured":"Y. Yang, E. Chen, Q. Liu, B. Xiang, T. Xu, and S. Shad. 2012. On approximation of real-world influence spread. In proceedings of European Conference on Machine Learning and Knowledge Discovery in Databases. 548--564."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742801"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670030"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2700398"},{"key":"e_1_2_1_62_1","volume-title":"Yu","author":"Zhang Jiawei","year":"2015","unstructured":"Jiawei Zhang and Philip S. Yu. 2015. Community detection for emerging networks. In Proceedings of SIAM Conference on Data Mining (SDM\u201915)."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2717314"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063931"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3046941","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3046941","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3046941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:37:45Z","timestamp":1763458665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3046941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,8,31]]}},"alternative-id":["10.1145\/3046941"],"URL":"https:\/\/doi.org\/10.1145\/3046941","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,21]]},"assertion":[{"value":"2015-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-01-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}