arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6328cs.DLcs.NAmath.NA
收藏

文献计量指标的最新进展与PaperRank问题

Recent advances in bibliometric indexes and the PaperRank problem

Università di Bari(巴里大学);Università di Firenze(佛罗伦萨大学)

Pierluigi Amodio, Luigi Brugnano

AI总结:

本文借鉴PageRank方法解决PaperRank问题,提出基于数学模型的引文排序新启发式,并通过数值测试证明其优于传统引文计数方法。

摘要:

文献计量指标通常用于评估科学研究的影响力,尽管众所周知,在不同研究领域中这些指标可能分布在非常不同的区间。有时,即使在单个研究领域内,这种差异也很明显,使得科学论文的评估变得非常困难(且不准确)。另一方面,该问题可以重新表述为与有效处理网页排序相同的框架,即制定Google的PageRank。因此,我们将此问题称为PaperRank问题,并通过使用类似于PageRank的方法来解决。所得到的数学上合理的解将用于比较通常的引文计数启发式方法与本文提出的新启发式方法。一些数值测试表明,基于单纯引文数量的新启发式方法比当前使用的方法更可靠。此外,我们证明我们的模型改进了最近提出的模型。

英文摘要:

Bibliometric indexes are customary used in evaluating the impact of scientific research, even though it is very well known that in different research areas they may range in very different intervals. Sometimes, this is evident even within a single given field of investigation making very difficult (and inaccurate) the assessment of scientific papers. On the other hand, the problem can be recast in the same framework which has allowed to efficiently cope with the ordering of web-pages, i.e., to formulate the PageRank of Google. For this reason, we call such problem the PaperRank problem, here solved by using a similar approach to that employed by PageRank. The obtained solution, which is mathematically grounded, will be used to compare the usual heuristics of the number of citations with a new one here proposed. Some numerical tests show that the new heuristics is much more reliable than the currently used ones, based on the bare number of citations. Moreover, we show that our model improves on recently proposed ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑