共查询到20条相似文献，搜索用时 125 毫秒
1.
利用Google的PageRank原理进行期刊引文分析,提出期刊在引文网络中的影响力测度指标--引文网络影响力序位(Journal Impact Rank in Citation Net,Impact Rank或IR).通过对118种生物学领域的期刊进行期刊引文网络影响力测度,并将IR结果与JCR提供的影响因子(Impact Factor, IF)值进行统计学分析以考察二者的相关性和差异性.结果表明,IR值与IF值的相关性较弱,其差异性具有统计学意义.分析其原因,IR考虑了引证期刊的权重和期刊间的相互影响,更适于反映期刊在其相关学科或领域的引文网络中的相对影响力;IF值因其实质上是期刊论文篇均被引频次,其计算不考虑期刊之间的相互联系和引证期刊的权威性,因而更适用于期刊自身的纵向评价;IR与IF从两种不同角度评价期刊影响力,可互为补充. 相似文献
2.
链接分析对引文分析的启示:从PageRank到Paperank 总被引：1，自引：0，他引：1
链接分析的发展受引文分析理论的影响,在基本假设前提与应用等方面,链接分析都与引文分析相似,例如,网络影响因子来源于期刊影响因子,共链分析来源于共被引分析.另一方面,网络的动态性赋予了链接分析一些特性,这些特性对于引文分析研究有启示作用.本文在简要介绍引文分析与链接分析的相关理论之后,基于链接分析中的PageRank算法提出了Paperank算法,用于引文分析.在对算法的论证过程中,笔者选取了SCEI中的"Webometrics"相关论文为样本,通过比较这些论文的Paperank值与被引次数,凸显Paperank算法的优点.最后,本文提出了Paperank算法的应用前景--学术期刊论文数据库的检索结果排序. 相似文献
3.
分析节点在网络中的位置和关系是网络分析的重要内容,也是为科学评价问题提供了有益的借鉴.从评价的角度,作者和文献之间存在正向的相互影响效应,因此提构建了由作者和文献构成的异质二分网络评价模型,应用PageRank和HITS算法的思想,建立作者和文献的协同评价.基于混合网络模型的协同评价,综合了合作网络和引文网络的结构特征,能够提供更为均衡的度量指标.以情报和图书馆学领域为样本,对模型的参数特征及收敛性进行了分析,通过对比分析说明了算法的有效性. 相似文献
4.
传统基于引文网络的主路径分析方法没有考虑引文对施引文献的相对价值,认为一篇学术文献的所有引文对该文献具有同等程度的知识贡献。本文从引用行为的统计学层面和语义信息层面综合区分引文重要性,探讨引文对施引文献的重要性对构造主路径的影响。构建了引文重要度指标对主路径分析方法中的链接遍历计数进行调节,并通过实例验证了改进后的主路径分析方法在提取知识流方面的性能。实验结果显示,经过引文重要度加权调节后的关键主路径和全局主路径取得了实验中最高的精确值和F1值。研究结果表明,通过引文重要度加权调节可以增加主路径链接在时间上的连续性,提高节点间的相关性,提升主路径分析方法找到关键节点的能力和链接溯源能力。 相似文献
5.
网络的出现使网络引文分析成为研究热点,国内外学者对网络引文的研究却存在很大的差异.国内学者主要关注将网络文献作为学术论文参考文献的一种引文形式.国外学者主要关注网络上文本引文或纸质文献出版物在网络上的被引用.文章通过比较国内外研究内容,探讨了网络引文分析研究现状,最后提出了加强三种类型引文分析理论和方法的整合的建议. 相似文献
6.
对2012~2014年入选F5000的农业科学类论文的引文总数、中文引文数、外文引文数、近5年引文数、引文类别和发表年份进行核查,对其篇均引文数及普赖斯指数等引文计量指标进行统计分析.结果表明:829篇农业科学论文的引文率为99.88﹪,篇均引文、中文引文、外文引文和近5年引文数分别为27.70、15.68、12.02和11.40条/篇;11~30条引文的论文共有556篇,占论文总数的67.07﹪;11~30条引文的论文中更易出现高被引论文.各年F5000农业科学论文的篇均引文数、中文引文数、外文引文数及近5年引文数均呈波动性上升趋势,但普赖斯指数呈下降趋势,引文半衰期呈增大趋势. 相似文献
7.
从网络引文的可追溯性角度研究网络信息资源的老化规律.具体分析CSSCI(1998～2009年)的183 986条P(Print)-W(Web)网络引文,发现各年网络引文量呈逻辑增长,篇均引文量也呈逐年增长趋势,其中近一半(48%)的P-W引文不可追溯.在不可追溯的引文类型中,404所占比例最大;通过引入传统文献老化规律模型--负指数增长曲线分析,P-W网络引文的平均可追溯半衰期为7 13年.P-W网络引文可追溯性与其URL域名类型、URL网页类型、URL层数和年代等的关系方面,P-W引文不可追溯分布具有一定的规律性;URL层数与URL字符数之间具有显著线性相关关系. 相似文献
8.
基于C-value与TF-IDF的文献簇主题识别研究 总被引：1，自引：0，他引：1
引文分析是科技情报分析的一种重要方法和技术,特别是建立在共耦合和共被引基础上的引文聚类分析逐渐发展成为科技情报分析中最活跃的研究领域之一.引文聚类分析形成一系列由科技文献组成的文献簇,并不能直接体现出文献簇的主题,因此需要识别这些文献簇的内容特征.本文分析了引文分析中文献簇主题识别的典型方法及局限,提出了结合C-value和TF-IDF算法的文献簇主题识别方法.实验表明,该方法可以充分地利用C-value和TF-IDF算法的优点,对C-value和TF-IDF算法中不合理的地方予以了改进,从而可以更好地应用于引文分析中文献簇的主题识别. 相似文献
9.
从海量的学术文献中自动发现有价值的高质量文献和研究点的时序演变路径是现代学术趋势分析领域的重要研究内容.本文探讨了一种将引文分析技术、语义本体技术和可视化展示技术进行有效结合的学术文献关键路径自动识别方法和可视化呈现方法,通过结合时间维度,它可以更好帮助学者用户发现有价值的高质量文献群及其相关联系.该方法主要建立在基于振荡算法的学术文献权值算法,和利用基于引文关键词加权共现技术的领域本体设计的引文链接权值算法之上,同时提供了完整的可视化展示界面.最后,文章对相关测试实验做了详细的说明. 相似文献
10.
11.
专利排名算法——运用引用次数与引文网络计算美国专利的研究 总被引：1，自引：0，他引：1
顾立平 《现代图书情报技术》2011,(6):14-19
在网页排名和论文排名基础上,采用引用频次标准和引文网络计算排名数值,建立专利排名算法。分析美国专利和商标局的数据库中的数字图书馆相关专利,研究结果显示专利排名算法能够区分相同引用次数的专利排名。该研究是网页排名算法的一种新型应用。 相似文献
12.
Dalibor Fiala 《Journal of Informetrics》2012,6(3):370-388
In the past, recursive algorithms, such as PageRank originally conceived for the Web, have been successfully used to rank nodes in the citation networks of papers, authors, or journals. They have proved to determine prestige and not popularity, unlike citation counts. However, bibliographic networks, in contrast to the Web, have some specific features that enable the assigning of different weights to citations, thus adding more information to the process of finding prominence. For example, a citation between two authors may be weighed according to whether and when those two authors collaborated with each other, which is information that can be found in the co-authorship network. In this study, we define a couple of PageRank modifications that weigh citations between authors differently based on the information from the co-authorship graph. In addition, we put emphasis on the time of publications and citations. We test our algorithms on the Web of Science data of computer science journal articles and determine the most prominent computer scientists in the 10-year period of 1996–2005. Besides a correlation analysis, we also compare our rankings to the lists of ACM A. M. Turing Award and ACM SIGMOD E. F. Codd Innovations Award winners and find the new time-aware methods to outperform standard PageRank and its time-unaware weighted variants. 相似文献
13.
《Journal of Informetrics》2019,13(2):515-539
Counting of number of papers, of citations and the h-index are the simplest bibliometric indices of the impact of research. We discuss some improvements. First, we replace citations with individual citations, fractionally shared among co-authors, to take into account that different papers and different fields have largely different average number of co-authors and of references. Next, we improve on citation counting applying the PageRank algorithm to citations among papers. Being time-ordered, this reduces to a weighted counting of citation descendants that we call PaperRank. We compute a related AuthorRank applying the PageRank algorithm to citations among authors. These metrics quantify the impact of an author or paper taking into account the impact of those authors that cite it. Finally, we show how self- and circular-citations can be eliminated by defining a closed market of Citation-coins. We apply these metrics to the InSpire database that covers fundamental physics, presenting results for papers, authors, journals, institutes, towns, countries for all-time and in recent time periods. 相似文献
14.
《Journal of Informetrics》2014,8(3):683-692
This paper explores a possible approach to a research evaluation, by calculating the renown of authors of scientific papers. The evaluation is based on the citation analysis and its results should be close to a human viewpoint. The PageRank algorithm and its modifications were used for the evaluation of various types of citation networks. Our main research question was whether better evaluation results were based directly on an author network or on a publication network. Other issues concerned, for example, the determination of weights in the author network and the distribution of publication scores among their authors. The citation networks were extracted from the computer science domain in the ISI Web of Science database. The influence of self-citations was also explored. To find the best network for a research evaluation, the outputs of PageRank were compared with lists of prestigious awards in computer science such as the Turing and Codd award, ISI Highly Cited and ACM Fellows. Our experiments proved that the best ranking of authors was obtained by using a publication citation network from which self-citations were eliminated, and by distributing the same proportional parts of the publications’ values to their authors. The ranking can be used as a criterion for the financial support of research teams, for identifying leaders of such teams, etc. 相似文献
15.
The objective assessment of the prestige of an academic institution is a difficult and hotly debated task. In the last few years, different types of university rankings have been proposed to quantify it, yet the debate on what rankings are exactly measuring is enduring.To address the issue we have measured a quantitative and reliable proxy of the academic reputation of a given institution and compared our findings with well-established impact indicators and academic rankings. Specifically, we study citation patterns among universities in five different Web of Science Subject Categories and use the PageRank algorithm on the five resulting citation networks. The rationale behind our work is that scientific citations are driven by the reputation of the reference so that the PageRank algorithm is expected to yield a rank which reflects the reputation of an academic institution in a specific field. Given the volume of the data analysed, our findings are statistically sound and less prone to bias, than, for instance, ad–hoc surveys often employed by ranking bodies in order to attain similar outcomes. The approach proposed in our paper may contribute to enhance ranking methodologies, by reconciling the qualitative evaluation of academic prestige with its quantitative measurements via publication impact. 相似文献
16.
为提高引文网络社区划分的准确性,以文档之间的语义关系以及引文之间的引用关系为基础,结合词汇在文档中的位置关系等信息,构建基于词汇语义加权的引文网络。通过GloVe模型对词汇向量化以充分利用词汇语义信息,结合WMD模型度量文献之间的相似度,把文档相似度的计算转变为在约束条件下求线性规划最优解的问题,结合文本的内容及结构特征对网络中的边进行赋权,以Louvain社区发现算法对加权后的引文网络进行社区划分,并对划分后的社区进行分析与检验,实验证明GloVe-WMD模型可提高引文网络社区划分的准确度。 相似文献
17.
18.
We evaluate author impact indicators and ranking algorithms on two publication databases using large test data sets of well-established researchers. The test data consists of (1) ACM fellowship and (2) various life-time achievement awards. We also evaluate different approaches of dividing credit of papers among co-authors and analyse the impact of self-citations. Furthermore, we evaluate different graph normalisation approaches for when PageRank is computed on author citation graphs.We find that PageRank outperforms citation counts in identifying well-established researchers. This holds true when PageRank is computed on author citation graphs but also when PageRank is computed on paper graphs and paper scores are divided among co-authors. In general, the best results are obtained when co-authors receive an equal share of a paper's score, independent of which impact indicator is used to compute paper scores. The results also show that removing author self-citations improves the results of most ranking metrics. Lastly, we find that it is more important to personalise the PageRank algorithm appropriately on the paper level than deciding whether to include or exclude self-citations. However, on the author level, we find that author graph normalisation is more important than personalisation. 相似文献
19.
运用共词分析的方法,检索CNKI数据库中的链接分析领域论文,确定高频关键词,用Bicomb建立关键词共词矩阵,以SPSS为工具进行因子分析和聚类分析,探讨国内链接分析的研究现状与研究热点,发现应用于链接分析的方法主要有引文分析、共链分析、可视化、社会网络分析等,链接分析算法主要包括PageRank算法、HIST算法、网页排序等,应用研究集中于网络信息资源评价、网站的网络影响力评价和大学评价. 相似文献
20.
基于引文内容分析的引用情感识别研究 总被引：1，自引：0，他引：1
[目的/意义]针对自动识别论文引用情感问题,提出一种基于引文内容分析的识别方法并进行可视化展示,克服基于简单引用频次计量无法区分不同引用情感的问题。[方法/过程]首先,利用正则表达式抽取出论文全文中的引文内容信息;然后,利用TF-IDF算法筛选出引用情感特征词,结合情感词典,利用情感分析技术对引文内容进行引用情感识别;最后,利用可视化工具展示出引用情感整体分布情况。[结果/结论]该方法能够有效识别出抗衰老领域论文数据集中引用情感情况。实验结果显示,该领域正面引用占总引用次数的21%,中立引用占总引用次数的78%,负面引用仅占总引用次数的1%。与传统引文网络相比较,基于引用情感的可视化图谱可以有效识别出不同引用情感在整体数据集合上的分布情况。 相似文献