Exploring academic influence of algorithms by co-occurrence network based on full-text of academic papers

计算机科学 算法 图书馆学 情报检索
作者
Y. Y. Wang,Chengzhi Zhang,Min Song,S. Kim,Y. J. Ko,Ju Hee Lee
出处
期刊:Aslib journal of information management [Emerald Publishing Limited]
标识
DOI:10.1108/ajim-09-2023-0352
摘要

Purpose In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network. Design/methodology/approach We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms. Findings The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms. Originality/value To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Jonathan发布了新的文献求助10
刚刚
1秒前
wt完成签到,获得积分20
1秒前
huanglongjie完成签到,获得积分10
1秒前
1秒前
honey完成签到,获得积分10
1秒前
和月折樱完成签到,获得积分10
2秒前
无糖乐发布了新的文献求助10
2秒前
CCC发布了新的文献求助30
2秒前
panpan完成签到,获得积分10
3秒前
3秒前
3秒前
3秒前
科研通AI6.2的应助被王就采纳,获得10
3秒前
Kevin Li的应助被讨厌下雨采纳,获得10
4秒前
mqh完成签到,获得积分10
4秒前
隐形曼青的应助被潇洒的亦凝采纳,获得10
5秒前
5秒前
5秒前
5秒前
冷静雅青发布了新的文献求助10
6秒前
orbitforyee发布了新的文献求助10
6秒前
6秒前
脑洞疼的应助被ttttt采纳,获得10
7秒前
7秒前
科研通AI6.4的应助被赵景豪采纳,获得10
7秒前
WXD发布了新的文献求助10
7秒前
爱沫哈完成签到,获得积分10
7秒前
偷书贼完成签到,获得积分10
8秒前
8秒前
lijun完成签到,获得积分10
8秒前
锅包肉完成签到 ,获得积分10
8秒前
dxzdxj发布了新的文献求助10
9秒前
11秒前
11秒前
12秒前
12秒前
cc完成签到 ,获得积分10
14秒前
orixero的应助被单纯惜灵采纳,获得10
14秒前
chentong0完成签到 ,获得积分10
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Les Mantodea De Guyane 2000
Energie-Contracting 1500
Klimaschutzrecht durch den Energiesektor im Mehrebenensystem – Ein Rechtsvergleich 1000
Stochastic Models in Operations Research,Vol. 2 600
Guidelines for fracture-safe and fatigue-reliable design of steel structures 600
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8026619
求助须知:如何正确求助?哪些是违规求助? 9467708
关于积分的说明 21228120
捐赠科研通 7597304
什么是DOI,文献DOI怎么找? 3387574
关于科研通互助平台的介绍 2520164
邀请新用户注册赠送积分活动 2423989