{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:50:51Z","timestamp":1761745851447,"version":"3.40.5"},"reference-count":25,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T00:00:00Z","timestamp":1688083200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Zhejiang Provincial Key Research and Development Program","award":["2023C01233"],"award-info":[{"award-number":["2023C01233"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"<jats:p>Evaluating scientific articles has always been a challenging task, made even more difficult by the constantly evolving citation networks. Despite numerous attempts at solving this problem, most existing approaches fail to consider the link relationships within the citation network, which can often result in biased evaluation results. To overcome this limitation, we present an optimization ranking algorithm that leverages the P-Rank algorithm and weighted citation networks to provide a more accurate article ranking. The proposed approach employs two hyperbolic tangent functions to calculate the corresponding age of articles and the number of citations, while also updating the link relationships of each paper node in the citation network. We validate the effectiveness of the proposed approach using three evaluation indicators and conduct experiments on three public datasets. The obtained experimental results demonstrate that the optimization article ranking method can achieve competitive performance when compared to other unweighted ranking algorithms. In addition, we note that the optimal Spearman\u2019s rank correlation and robustness can all be achieved by using a combination of the following parameters:<jats:inline-formula><a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><a:mi>\u03b1<\/a:mi><a:mo>=<\/a:mo><a:mn>10<\/a:mn><\/a:math><\/jats:inline-formula>,<jats:inline-formula><c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><c:mi>\u03b2<\/c:mi><c:mo>=<\/c:mo><c:mn>5<\/c:mn><\/c:math><\/jats:inline-formula>, and<jats:inline-formula><e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><e:mi>\u03b3<\/e:mi><e:mo>=<\/e:mo><e:mn>2<\/e:mn><\/e:math><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1155\/2023\/7988848","type":"journal-article","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T23:50:08Z","timestamp":1688169008000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["An Optimization Ranking Approach Based on Weighted Citation Networks and P-Rank Algorithm"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2012-6855","authenticated-orcid":true,"given":"Jian-feng","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Information Engineering, Suzhou Industrial Park Institute of Services Outsourcing, Suzhou 215123, China"}]},{"given":"Shen","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China"}]},{"given":"Lan-tao","family":"You","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Suzhou Industrial Park Institute of Services Outsourcing, Suzhou 215123, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-018-2973-6"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2895737"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3154619"},{"first-page":"533","article-title":"FutureRank: ranking scientific articles by predicting their future PageRank","author":"H. Sayyadi","key":"4"},{"first-page":"537","article-title":"Weighted p-rank: a weighted article ranking algorithm based on a heterogeneous scholarly network","author":"J. Zhou","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-020-03422-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1126\/science.178.4060.471"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1023\/a:1014800407876"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507655102"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-006-0147-4"},{"volume-title":"The PageRank Citation Ranking: Bringing Order to the Web. Technical Report","year":"1998","author":"L. Page","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-006-0176-z"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/tnse.2014.2380315"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.03.012"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2007\/06\/p06010"},{"issue":"3","key":"16","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/asi.21461","article-title":"P-rank: An indicator measuring prestige in heterogeneous scholarly networks","volume":"62","author":"E. Yan","year":"2011","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"article-title":"Ranking scientific articles by exploiting citations, authors, journals, and time information","author":"Y. Wang","key":"18","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v27i1.8627"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2019.03.013"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2022.3164975"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2022.3140779"},{"first-page":"1055","article-title":"A topic modeling approach and its integration into the random walk framework for academic search","author":"J. Tang","key":"22"},{"first-page":"990","article-title":"Arnetminer: extraction and mining of academic social networks","author":"J. Tang","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481251"},{"volume-title":"Research Design and Statistical Analysis","year":"2010","author":"J. Myers","key":"25"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7988848.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7988848.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7988848.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T06:33:36Z","timestamp":1702708416000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2023\/7988848\/"}},"subtitle":[],"editor":[{"given":"Siew Ann","family":"Cheong","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,6,30]]},"references-count":25,"alternative-id":["7988848","7988848"],"URL":"https:\/\/doi.org\/10.1155\/2023\/7988848","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2023,6,30]]}}}