Please wait a minute...
文章检索
复杂系统与复杂性科学  2015, Vol. 12 Issue (3): 77-84    DOI: 10.13306/j.1672-3813.2015.03.012
  本期目录 | 过刊浏览 | 高级检索 |
基于持续关注度衰减的重要论文预测
张美平, 尚明生
电子科技大学互联网科学中心,成都 611731
Citation Prediction Based on Sustained Attention Decay
ZHANG Meiping, SHANG Mingsheng
Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 611731, China
全文: PDF(1338 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 针对现有方法存在预测精度较低或者计算复杂等问题,通过真实数据集的实证分析,发现论文的年均引用次数与论文未来的被引次数有很大的相关性,由此提出持续关注度的概念。进一步,结合论文引用的时间衰减特性,提出一种基于持续关注度衰减的重要论文预测算法。在两个典型数据集上的实验结果表明,该方法不仅计算简单,而且具有较高的预测精度。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
张美平
尚明生
关键词 持续关注度时间衰减论文引用预测    
Abstract:Existing methods have problems such as low accuracy or time consuming. Through empirical analysis of real data sets, we find that there is a strong correlation between future citations and annual citation of papers, i.e. the sustained attention; meanwhile, the future citations have apparent characteristics of time decay. Thus we put forward a method based on sustained attention decay to predict the future citations of papers, and then to find papers of potential importance with these results. Experimental results on two benchmark data sets show that the proposed method can predict precisely with lower time complexity.
Key wordssustained attention    time decay    citation    prediction
收稿日期: 2014-03-17      出版日期: 2026-06-22
ZTFLH:  N94  
基金资助:国家自然科学基金(61370150);四川省科技厅项目(2012FZ0120)
作者简介: 张美平(1989-),女,湖南邵阳人,硕士研究生,主要研究方向为复杂网络分析。
引用本文:   
张美平, 尚明生. 基于持续关注度衰减的重要论文预测[J]. 复杂系统与复杂性科学, 2015, 12(3): 77-84.
ZHANG Meiping, SHANG Mingsheng. Citation Prediction Based on Sustained Attention Decay[J]. Complex Systems and Complexity Science, 2015, 12(3): 77-84.
链接本文:  
https://fzkx.qdu.edu.cn/CN/10.13306/j.1672-3813.2015.03.012      或      https://fzkx.qdu.edu.cn/CN/Y2015/V12/I3/77
[1] Wang D, Song C, Barabási A L. Quantifying long-term scientific impact[J]. Science, 2013, 342(6154): 127-132.
[2] Hirsch J E. An index to quantify an individual's scientific research output[J]. Proceedings of the National academy of Sciences of the United States of America, 2005, 102(46): 16569-16572.
[3] Egghe L. Theory and practise of the g-index[J]. Scientometrics, 2006, 69(1): 131-152.
[4] Ding Y, Yan E, Frazho A, et al. PageRank for ranking authors in co-citation networks[J]. Journal of the American Society for Information Science and Technology, 2009, 60(11): 2229-2243.
[5] Liu X, Bollen J, Nelson M L, et al. Co-authorship networks in the digital library research community[J]. Information Processing & Management, 2005, 41(6): 1462-1480.
[6] Medo M, Cimini G, Gualdi S. Temporal effects in the growth of networks[J]. Physical Review Letters, 2011, 107(23): 238701.
[7] Berberich K, Vazirgiannis M, Weikum G. Time-aware authority ranking[J]. Internet Mathematics, 2005, 2(3): 301-332.
[8] Walker D, Xie H, Yan K K, et al. Ranking scientific publications using a model of network traffic[J]. Journal of Statistical Mechanics: Theory and Experiment, 2007, 2007(06): P06010.
[9] Zhou Y B, Lü L, Li M. Quantifying the influence of scientists and their publications: distinguishing between prestige and popularity[J]. New Journal of Physics, 2012, 14(3): 033033.
[10] Yan E, Ding Y, Sugimoto C R. P-Rank: an indicator measuring prestige in heterogeneous scholarly networks[J]. Journal of the American Society for Information Science and Technology, 2011, 62(3): 467-477.
[11] Zhou D, Orshanskiy S A, Zha H, et al. Co-ranking authors and documents in a heterogeneous network[J]. IEEE International Conference on Data Mining, 2007, 739-744.
[12] Kleinberg J M. Authoritative sources in a hyperlinked environment[J]. Journal of the ACM (JACM), 1999, 46(5): 604-632.
[13] Shen H, Wang D, Song C, et al. Modeling and predicting popularity dynamics via reinforced poisson processes[J]. Eprint arXiv, 2014: arXiv:1401.0778.
[14] Yan E, Ding Y. Weighted citation: an indicator of an article's prestige[J]. Journal of the American Society for Information Science and Techno-logy, 2010, 61(8): 1635-1643.
[15] Sayyadi H, Getoor L. FutureRank: ranking scientific articles by predicting their future pagerank[J]. Proc of Siam International Conference on Data Mining, 2009: 533-544.
[16] Page L, Brin S, Motwani R, et al. The pageRank citation ranking: bringing order to the web[J]. Lecture Notes in Engineering, 1998,9(1): 1-14.
[17] Radicchi F, Fortunato S, Vespignani A. Citation networks[J]. Understanding Complex Systems, 2012: 233-257.
[18] Wu Z X, Holme P. Modeling scientific-citation patterns and other triangle-rich acyclic networks[J]. Physicl Review E, 2009, 80(3): 037101.
[19] Newman M E J. Prediction of highly cited papers[J]. Earophysics Letters, 2014,105(2): 28002-28007.
[20] Newman M E J. The first-mover advantage in scientific publication[J]. Europhysics Letters, 2009, 86(6): 68001.
[1] 马星河, 徐磊, 马永强. 基于样本熵与BWO优化的VMD-DELM短期多特征负荷预测[J]. 复杂系统与复杂性科学, 2026, 23(2): 109-117.
[2] 徐鸿宇, 陈谋, 邵书义. 基于模仿学习的尾桨卡滞无人直升机飞行轨迹规划方法[J]. 复杂系统与复杂性科学, 2026, 23(2): 67-74.
[3] 卢新彪, 刘泽诚, 陈贵允, 杨铁流, 高兴. 基于图卷积网络的复杂网络能控性提升方法[J]. 复杂系统与复杂性科学, 2025, 22(4): 24-28.
[4] 谢煜轩, 王红君, 岳有军, 赵辉. 考虑VMD残差量和优化BiLSTM的短期负荷预测[J]. 复杂系统与复杂性科学, 2024, 21(4): 149-156.
[5] 孔令仁, 亓庆源. 含参数不确定及时滞的线性系统自适应模型预测控制[J]. 复杂系统与复杂性科学, 2024, 21(3): 136-143.
[6] 常丁懿, 石娟, 瞿丽莉, 何子春, 张银龙, 郑鹏. 基于FOA-BP的风电运维人员不安全行为风险评价[J]. 复杂系统与复杂性科学, 2024, 21(1): 119-125.
[7] 李若晨, 肖人彬. 基于改进狼群算法优化LSTM网络的舆情演化预测[J]. 复杂系统与复杂性科学, 2024, 21(1): 1-11.
[8] 顾亦然, 徐泽彬, 杨海根. 基于多任务与用户兴趣变化的短视频用户行为预测算法[J]. 复杂系统与复杂性科学, 2023, 20(4): 69-76.
[9] 崔晓丽, 薛乐洋, 张鹏. 基于结构平衡理论与地位理论的符号预测算法[J]. 复杂系统与复杂性科学, 2023, 20(3): 68-73.
[10] 曾茜, 韩华, 李秋晖, 李巧丽. 基于分包的混合朴素贝叶斯链路预测模型[J]. 复杂系统与复杂性科学, 2023, 20(2): 10-19.
[11] 李巧丽, 韩华, 李秋晖, 曾茜. 基于最优路径相似度传输矩阵的链路预测方法[J]. 复杂系统与复杂性科学, 2023, 20(1): 9-17.
[12] 王雅静, 郭强, 邓春燕, 林青轩, 刘建国. 基于LDA主题模型的用户特征预测研究[J]. 复杂系统与复杂性科学, 2020, 17(4): 9-15.
[13] 吕亚楠, 韩华, 贾承丰, 瞿倩倩. 基于有偏向的重启随机游走链路预测算法[J]. 复杂系统与复杂性科学, 2018, 15(4): 17-24.
[14] 贾珺, 胡晓峰, 贺筱媛. 网络结构特征与链路预测算法关系研究[J]. 复杂系统与复杂性科学, 2017, 14(1): 28-37.
[15] 尹怀仙, 王凯, 张铁柱, 华青松, 秦勇, 郭建媛. 基于PSO-BP神经网络的城轨列车转向架轮对轴箱故障预测[J]. 复杂系统与复杂性科学, 2015, 12(4): 97-103.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed