• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

预测科学家的引文计数作为链接预测问题。

Predicting Citation Count of Scientists as a Link Prediction Problem.

出版信息

IEEE Trans Cybern. 2020 Oct;50(10):4518-4529. doi: 10.1109/TCYB.2019.2900495. Epub 2019 Mar 12.

DOI:10.1109/TCYB.2019.2900495
PMID:30872250
Abstract

The studies dealing with the problem of predicting scientific impacts in the scientific world mostly focus on predicting citation count of papers (PCCP). However, in the literature, only a little bit of research has been conducted on estimating the future influence of scientists individually. Estimating the impact of scientists individually is a worthwhile task for the following scientific research and cooperatives. From this point of view, a new supervised link prediction method is proposed to predict the citation count of scientists (PCCS). Many PCCP studies employ document-based attributes, such as titles, abstracts, and keywords of papers; institutions of scientists; impact factors of publishers; etc. and they do not take advantage of any topological features of complex networks formed with citations among papers. However, citation networks include valuable features for PCCP and PCCS. Therefore, we formulate the problem of PCCS as a link prediction problem in directed, weighted, and temporal citation networks. The proposed approach predicts not only links but also its weights. Our supervised link prediction method is tested on two citation networks in Experiment 1. The results of Experiment 1 confirm that our method achieves promising performances when considering prediction links with its weights are addressed for the first time in terms of link prediction in directed, weighted, and temporal networks. In Experiment 2, the performance of the proposed link prediction metric and five well-known link prediction metrics are compared in terms of prediction new links in complex networks. The results of Experiment 2 demonstrate that the proposed link prediction metric outperforms all baseline link prediction metrics.

摘要

研究科学世界中预测科学影响力的问题主要集中在预测论文的引文计数(PCCP)上。然而,在文献中,只有很少的研究致力于估计科学家个人的未来影响力。对于以下科学研究和合作来说,估计科学家的个人影响力是一项有价值的任务。从这个角度来看,提出了一种新的有监督链接预测方法来预测科学家的引文计数(PCCS)。许多 PCCP 研究采用基于文档的属性,例如论文的标题、摘要和关键词;科学家的机构;出版商的影响因素等;它们没有利用论文之间引文形成的复杂网络的任何拓扑特征。然而,引文网络包含了 PCCP 和 PCCS 的有价值特征。因此,我们将 PCCS 问题表述为有向、加权和时间引用网络中的链接预测问题。在实验 1 中,我们的方法在两个引文网络上进行了测试。实验 1 的结果证实,当首次在有向、加权和时间网络中的链接预测中考虑预测链接及其权重时,我们的方法可以实现有前途的性能。在实验 2 中,我们比较了所提出的链接预测指标和五个著名的链接预测指标在复杂网络中预测新链接的性能。实验 2 的结果表明,所提出的链接预测指标优于所有基准链接预测指标。

相似文献

1
Predicting Citation Count of Scientists as a Link Prediction Problem.预测科学家的引文计数作为链接预测问题。
IEEE Trans Cybern. 2020 Oct;50(10):4518-4529. doi: 10.1109/TCYB.2019.2900495. Epub 2019 Mar 12.
2
The application of degree related clustering coefficient in estimating the link predictability and predicting missing links of networks.度相关聚类系数在估计网络链接可预测性及预测缺失链接中的应用。
Chaos. 2019 May;29(5):053135. doi: 10.1063/1.5029866.
3
A potential energy and mutual information based link prediction approach for bipartite networks.基于势能和互信息的二部网络链路预测方法。
Sci Rep. 2020 Nov 26;10(1):20659. doi: 10.1038/s41598-020-77364-9.
4
Link Prediction in Weighted Networks: A Weighted Mutual Information Model.加权网络中的链路预测:一种加权互信息模型。
PLoS One. 2016 Feb 5;11(2):e0148265. doi: 10.1371/journal.pone.0148265. eCollection 2016.
5
An efficient method for link prediction in weighted multiplex networks.一种用于加权多重网络中链接预测的有效方法。
Comput Soc Netw. 2016;3(1):7. doi: 10.1186/s40649-016-0034-y. Epub 2016 Nov 5.
6
Seven-Layer Model in Complex Networks Link Prediction: A Survey.复杂网络链路预测的七层模型:综述。
Sensors (Basel). 2020 Nov 17;20(22):6560. doi: 10.3390/s20226560.
7
Information Extraction as Link Prediction: Using Curated Citation Networks to Improve Gene Detection.作为链接预测的信息提取:利用精心策划的引文网络改进基因检测
WASA. 2009 Jan 1;5682:541-550. doi: 10.1007/978-3-642-03417-6_53.
8
Quantifying the Effects of Topology and Weight for Link Prediction in Weighted Complex Networks.量化加权复杂网络中拓扑结构和权重对链路预测的影响
Entropy (Basel). 2018 May 13;20(5):363. doi: 10.3390/e20050363.
9
Homophily and missing links in citation networks.引用网络中的同质性与缺失链接。
EPJ Data Sci. 2016;5(1):7. doi: 10.1140/epjds/s13688-016-0068-2. Epub 2016 Mar 3.
10
A neural network framework for predicting dynamic variations in heterogeneous social networks.用于预测异质社交网络动态变化的神经网络框架。
PLoS One. 2020 Apr 27;15(4):e0231842. doi: 10.1371/journal.pone.0231842. eCollection 2020.

引用本文的文献

1
Predicting co-word links via heterogeneous graph convolutional networks.通过异构图卷积网络预测共词链接。
Sci Rep. 2025 Jul 2;15(1):23143. doi: 10.1038/s41598-025-05853-w.
2
Two-stage multi-objective evolutionary algorithm for overlapping community discovery.用于重叠社区发现的两阶段多目标进化算法
PeerJ Comput Sci. 2024 Jul 16;10:e2185. doi: 10.7717/peerj-cs.2185. eCollection 2024.
3
Trends in Congenital Insensitivity to Pain with Anhidrosis: A Bibliometric Analysis from 2000 to 2021.先天性无痛觉伴无汗症的研究趋势:2000年至2021年的文献计量分析
J Pain Res. 2022 Dec 14;15:3911-3919. doi: 10.2147/JPR.S390207. eCollection 2022.
4
Citation analysis of the 100 top-cited articles on discectomy via endoscopy since 2011 using alluvial diagrams: bibliometric analysis.2011 年以来经内镜椎间盘切除术 100 篇高引文献的引文分析:文献计量学分析。
Eur J Med Res. 2022 Sep 1;27(1):169. doi: 10.1186/s40001-022-00782-0.
5
Bibliometric Analysis of Cathepsin B Research From 2011 to 2021.2011年至2021年组织蛋白酶B研究的文献计量分析
Front Med (Lausanne). 2022 Jul 6;9:898455. doi: 10.3389/fmed.2022.898455. eCollection 2022.
6
The Global Status and Trends of Enteropeptidase: A Bibliometric Study.肠肽酶的全球现状与趋势:一项文献计量学研究
Front Med (Lausanne). 2022 Feb 10;9:779722. doi: 10.3389/fmed.2022.779722. eCollection 2022.
7
Applied Research on the Combination of Weighted Network and Supervised Learning in Acupoints Compatibility.加权网络与监督学习在穴位配伍中应用研究
J Healthc Eng. 2021 Oct 29;2021:4699420. doi: 10.1155/2021/4699420. eCollection 2021.