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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
solution完成签到 ,获得积分10
1秒前
内向忆南完成签到,获得积分10
1秒前
皮在痒完成签到,获得积分10
1秒前
1秒前
2秒前
3秒前
3秒前
orixero应助Justice采纳,获得10
4秒前
4秒前
wenxiansci完成签到,获得积分0
4秒前
5秒前
Liulu发布了新的文献求助10
5秒前
传奇3应助Tao采纳,获得10
5秒前
诚心完成签到 ,获得积分10
5秒前
echo完成签到,获得积分10
5秒前
久9发布了新的文献求助10
5秒前
顾矜应助一个迷途小书童采纳,获得10
6秒前
民工完成签到,获得积分10
6秒前
woshi123应助江俊采纳,获得10
7秒前
YyHyY完成签到,获得积分10
7秒前
molihuakai应助酸辣土豆丝采纳,获得10
8秒前
LLLLLL发布了新的文献求助10
9秒前
mojomars完成签到,获得积分10
10秒前
111发布了新的文献求助10
10秒前
montecount完成签到,获得积分10
11秒前
小太阳在营业举报Juanjuan求助涉嫌违规
11秒前
疯狂的水香完成签到,获得积分10
12秒前
欧高完成签到 ,获得积分10
12秒前
13秒前
高贵尔竹完成签到,获得积分20
13秒前
英俊的铭应助mojomars采纳,获得10
13秒前
14秒前
科研通AI6.3应助缪缪采纳,获得10
15秒前
16秒前
16秒前
无花果应助高贵尔竹采纳,获得10
17秒前
17秒前
17秒前
D调的华丽发布了新的文献求助10
17秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 1000
全员动态考核,锚定高质量发展:读懂同济大学教师人事改革新政的深层价值 900
Health Psychology 800
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
Römisch-Germanische Forschungen 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7594208
求助须知:如何正确求助?哪些是违规求助? 9171295
关于积分的说明 19631108
捐赠科研通 7171838
什么是DOI,文献DOI怎么找? 3267694
关于科研通互助平台的介绍 2432486
邀请新用户注册赠送积分活动 2260503