Uncovering milestone papers: A network diffusion and game theory approach

IF 3.4 2区 管理学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Wei Zhang , Juyang Cao , Manuel Sebastian Mariani , Zhen-Zhen Wang , Mingyang Zhou , Wei Chen , Hao Liao
{"title":"Uncovering milestone papers: A network diffusion and game theory approach","authors":"Wei Zhang ,&nbsp;Juyang Cao ,&nbsp;Manuel Sebastian Mariani ,&nbsp;Zhen-Zhen Wang ,&nbsp;Mingyang Zhou ,&nbsp;Wei Chen ,&nbsp;Hao Liao","doi":"10.1016/j.joi.2024.101545","DOIUrl":null,"url":null,"abstract":"<div><p>Methods to rank documents in large-scale citation data are increasingly assessed in terms of their ability to identify small sets of expert-selected papers. Here, we propose an algorithm for the accurate identification of milestone papers from citation networks. The algorithm combines an influence propagation process with game theory concepts. It outperforms state-of-the-art metrics in the identification of milestone papers in aggregate citation network data, while potentially mitigating the ranking's temporal bias compared with metrics that have similar milestone identification performance. The proposed method sheds light on the interplay between ranking accuracy and temporal bias.</p></div>","PeriodicalId":48662,"journal":{"name":"Journal of Informetrics","volume":"18 3","pages":"Article 101545"},"PeriodicalIF":3.4000,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Informetrics","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1751157724000580","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Methods to rank documents in large-scale citation data are increasingly assessed in terms of their ability to identify small sets of expert-selected papers. Here, we propose an algorithm for the accurate identification of milestone papers from citation networks. The algorithm combines an influence propagation process with game theory concepts. It outperforms state-of-the-art metrics in the identification of milestone papers in aggregate citation network data, while potentially mitigating the ranking's temporal bias compared with metrics that have similar milestone identification performance. The proposed method sheds light on the interplay between ranking accuracy and temporal bias.

揭示里程碑式的论文:网络扩散和博弈论方法
在大规模引文数据中对文献进行排序的方法越来越多地从其识别专家选择的小论文集的能力方面进行评估。在此,我们提出了一种从引文网络中准确识别里程碑论文的算法。该算法将影响力传播过程与博弈论概念相结合。与具有类似里程碑识别性能的指标相比,该算法在识别总引用网络数据中的里程碑论文方面优于最先进的指标,同时有可能减轻排名的时间偏差。所提出的方法揭示了排名准确性与时间偏差之间的相互作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Informetrics
Journal of Informetrics Social Sciences-Library and Information Sciences
CiteScore
6.40
自引率
16.20%
发文量
95
期刊介绍: Journal of Informetrics (JOI) publishes rigorous high-quality research on quantitative aspects of information science. The main focus of the journal is on topics in bibliometrics, scientometrics, webometrics, patentometrics, altmetrics and research evaluation. Contributions studying informetric problems using methods from other quantitative fields, such as mathematics, statistics, computer science, economics and econometrics, and network science, are especially encouraged. JOI publishes both theoretical and empirical work. In general, case studies, for instance a bibliometric analysis focusing on a specific research field or a specific country, are not considered suitable for publication in JOI, unless they contain innovative methodological elements.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信