{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:09:01Z","timestamp":1772147341473,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:00:00Z","timestamp":1604534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFB1003602"],"award-info":[{"award-number":["2018YFB1003602"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms used for influential node identification are based on the structure of the network such as the degree of the nodes. However, the attribute information of nodes also affects the ranking of nodes\u2019 influence. In this paper, we consider both the attribute information between nodes and the structure of networks. Therefore, the similarity ratio, based on attribute information, and the degree ratio, based on structure derived from trust-value, are proposed. The trust\u2013PageRank (TPR) algorithm is proposed to identify influential nodes in complex networks. Finally, several real networks from different fields are selected for experiments. Compared with some existing algorithms, the results suggest that TPR more rationally and effectively identifies the influential nodes in networks.<\/jats:p>","DOI":"10.3390\/a13110280","type":"journal-article","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:00:37Z","timestamp":1604534437000},"page":"280","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Identifying Influential Nodes of Complex Networks Based on Trust-Value"],"prefix":"10.3390","volume":"13","author":[{"given":"Jinfang","family":"Sheng","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiafu","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yayun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8815-7533","authenticated-orcid":false,"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng\u2019ang","family":"Hou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Kleinberg","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"122930","DOI":"10.1016\/j.physa.2019.122930","article-title":"Complex network construction of Internet finance risk","volume":"540","author":"Xu","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","article-title":"A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks","volume":"187","author":"Tang","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.physa.2016.02.028","article-title":"Identify influential spreaders in complex networks, the role of neighborhood","volume":"452","author":"Liu","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s12043-019-1727-1","article-title":"A modified efficiency centrality to identify influential nodes in weighted networks","volume":"92","author":"Wang","year":"2019","journal-title":"Pramana"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.65.036104","article-title":"Immunization of complex networks","volume":"65","author":"Vespignani","year":"2002","journal-title":"Phys. Rev. E"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.engappai.2016.01.019","article-title":"Social network regularized sparse linear model for top-n recommendation","volume":"51","author":"Feng","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2012.02.006","article-title":"Recommender systems","volume":"519","author":"Medo","year":"2012","journal-title":"Phys. Rep."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"025103","DOI":"10.1103\/PhysRevE.69.025103","article-title":"Structural vulnerability of the North American power grid","volume":"69","author":"Albert","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_10","first-page":"814","article-title":"Fast Automatic Generation Method for Software Testing Data Based on Key-Point Path","volume":"27","author":"Ding","year":"2016","journal-title":"J. Softw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ins.2018.04.078","article-title":"Identifying influential genes in protein\u2013protein interaction networks","volume":"454","author":"Sun","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","article-title":"Identifying influential nodes in complex networks","volume":"391","author":"Chen","year":"2012","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_16","first-page":"1","article-title":"Identifying influential spreaders by gravity model","volume":"9","author":"Li","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.physa.2018.03.076","article-title":"Fast ranking nodes importance in complex networks based on LS-SVM method","volume":"506","author":"Wen","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., Zhang, Y.C., Yeung, C.H., and Zhou, T. (2011). Leaders in social networks, the delicious case. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0021202"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"J. ACM"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"Zhou","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.physa.2018.08.053","article-title":"Leveraging local h-index to identify and rank influential spreaders in networks","volume":"512","author":"Liu","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"16569","DOI":"10.1073\/pnas.0507655102","article-title":"An index to quantify an individual\u2019s scientific research output","volume":"102","author":"Hirsch","year":"2005","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1360\/972013-1280","article-title":"Review of ranking nodes in complex networks","volume":"59","author":"REN","year":"2014","journal-title":"Chin. Sci. Bull."},{"key":"ref_25","first-page":"1","article-title":"Finding vital node by node importance evaluation matrix in complex networks","volume":"61","author":"Zhou","year":"2012","journal-title":"Acta Phys. Sin."},{"key":"ref_26","first-page":"441","article-title":"Node Ranking in Complex Networks based on LeaderRank and Modes Similarity","volume":"46","author":"Gu","year":"2017","journal-title":"J. Univ. Electron. Sci. Technol. China"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms1396","article-title":"Ranking stability and super-stable nodes in complex networks","volume":"2","author":"Ghoshal","year":"2011","journal-title":"Nat. Commun."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Jeh, G., and Widom, J. (2002, January 23\u201326). SimRank: A measure of structural-context similarity. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775047.775126"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"020204","DOI":"10.7498\/aps.62.020204","article-title":"Key nodes in complex networks identified by multi-attribute decision-making method","volume":"62","author":"Yu","year":"2013","journal-title":"Acta Phys. Sin."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"126879","DOI":"10.1016\/j.physleta.2020.126879","article-title":"Influential node detection of social networks based on network invulnerability","volume":"384","author":"Chen","year":"2020","journal-title":"Phys. Lett. A"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"124215","DOI":"10.1016\/j.physa.2020.124215","article-title":"Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach","volume":"553","author":"Kumar","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"123769","DOI":"10.1016\/j.physa.2019.123769","article-title":"Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction","volume":"545","author":"Malang","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","article-title":"A new measure of rank correlation","volume":"30","author":"Kendall","year":"1938","journal-title":"Biometrika"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/11\/280\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:29:27Z","timestamp":1760178567000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/11\/280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,5]]},"references-count":33,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["a13110280"],"URL":"https:\/\/doi.org\/10.3390\/a13110280","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,5]]}}}