Graph-based algorithms for ranking researchers: not all swans are white!

被引:0
|
作者
Xiaorui Jiang
Xiaoping Sun
Hai Zhuge
机构
[1] Chinese Academy of Sciences,Key Lab of Intelligent Information Processing, Institute of Computing Technology
来源
Scientometrics | 2013年 / 96卷
关键词
Scientometrics; Researcher importance; Graph-based ranking; Citation count; Recommendation intensity; American physical society;
D O I
暂无
中图分类号
学科分类号
摘要
Scientific importance ranking has long been an important research topic in scientometrics. Many indices based on citation counts have been proposed. In recent years, several graph-based ranking algorithms have been studied and claimed to be reasonable and effective. However, most current researches fall short of a concrete view of what these graph-based ranking algorithms bring to bibliometric analysis. In this paper, we make a comparative study of state-of-the-art graph-based algorithms using the APS (American Physical Society) dataset. We focus on ranking researchers. Some interesting findings are made. Firstly, simple citation-based indices like citation count can return surprisingly better results than many cutting-edge graph-based ranking algorithms. Secondly, how we define researcher importance may have tremendous impacts on ranking performance. Thirdly, some ranking methods which at the first glance are totally different have high rank correlations. Finally, the data of which time period are chosen for ranking greatly influence ranking performance but still remains open for further study. We also try to give explanations to a large part of the above findings. The results of this study open a third eye on the current research status of bibliometric analysis.
引用
收藏
页码:743 / 759
页数:16
相关论文
共 50 条
  • [41] Characterization of Graph-Based Hierarchical Watersheds: Theory and Algorithms
    Deise Santana Maia
    Jean Cousty
    Laurent Najman
    Benjamin Perret
    Journal of Mathematical Imaging and Vision, 2020, 62 : 627 - 658
  • [42] An analysis of the effects of clustering in graph-based evolutionary algorithms
    Foo, Cherhan
    Kirley, Michael
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 2246 - 2253
  • [43] Algorithms and complexity results for graph-based pursuit evasion
    Richard Borie
    Craig Tovey
    Sven Koenig
    Autonomous Robots, 2011, 31 : 317 - 332
  • [44] Spanning graph-based nonrectilinear Steiner tree algorithms
    Zhu, Q
    Zhou, H
    Jing, T
    Hong, XL
    Yang, Y
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2005, 24 (07) : 1066 - 1075
  • [45] Adaptive edge weighting for graph-based learning algorithms
    Masayuki Karasuyama
    Hiroshi Mamitsuka
    Machine Learning, 2017, 106 : 307 - 335
  • [46] Algorithms for Image Processing in Graph-based Volumetric Segmentation
    Burdescu, Dumitru Dan
    Stanescu, Liana
    Brezovan, Marius
    Stoica Spahiu, Cosmin
    Slabu, Florin
    2016 7TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS & APPLICATIONS (IISA), 2016,
  • [47] Characterization of Graph-Based Hierarchical Watersheds: Theory and Algorithms
    Santana Maia, Deise
    Cousty, Jean
    Najman, Laurent
    Perret, Benjamin
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2020, 62 (05) : 627 - 658
  • [48] Graph-based algorithms for phase-type distributions
    Tobias Røikjer
    Asger Hobolth
    Kasper Munch
    Statistics and Computing, 2022, 32
  • [49] Salient region detection through sparse reconstruction and graph-based ranking
    Fareed, Mian Muhammad Sadiq
    Ahmed, Gulnaz
    Chun, Qi
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2015, 32 : 144 - 155
  • [50] Graph-based Density Peaks Ranking Approach for Extracting KeyPhrases (GDREK)
    Alfarra, Mahmoud
    Alfarra, Abdalfanah M.
    Salahedden, Ahmed
    2019 IEEE 7TH PALESTINIAN INTERNATIONAL CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (PICECE), 2019,