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

IF 2.4 3区 管理学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Aslib Journal of Information Management Pub Date : 2024-02-22 DOI:10.1108/ajim-09-2023-0352
Yuzhuo Wang, Chengzhi Zhang, Min Song, Seongdeok Kim, Youngsoo Ko, Juhee Lee
{"title":"Exploring academic influence of algorithms by co-occurrence network based on full-text of academic papers","authors":"Yuzhuo Wang, Chengzhi Zhang, Min Song, Seongdeok Kim, Youngsoo Ko, Juhee Lee","doi":"10.1108/ajim-09-2023-0352","DOIUrl":null,"url":null,"abstract":"<h3>Purpose</h3>\n<p>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.</p><!--/ Abstract__block -->\n<h3>Design/methodology/approach</h3>\n<p>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.</p><!--/ Abstract__block -->\n<h3>Findings</h3>\n<p>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.</p><!--/ Abstract__block -->\n<h3>Originality/value</h3>\n<p>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.</p><!--/ Abstract__block -->","PeriodicalId":53152,"journal":{"name":"Aslib Journal of Information Management","volume":"17 1","pages":""},"PeriodicalIF":2.4000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aslib Journal of Information Management","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1108/ajim-09-2023-0352","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于学术论文全文的共现网络探索算法的学术影响力
目的 在人工智能(AI)时代,算法获得了前所未有的重要性。科学研究表明,算法在论文中被频繁提及,提及频率成为衡量算法受欢迎程度和影响力的经典指标。然而,当代评估影响力的方法往往只关注单个算法,而忽视了这些算法之间相互关联所产生的集体影响,而这种影响可以为揭示算法集群中算法的作用和重要性提供一种新方法。本文旨在基于学术论文的全文内容,构建自然语言处理领域算法的共现网络,并根据网络的特征分析算法群中算法的学术影响力。设计/方法/途径我们利用深度学习模型从文章中提取算法实体,构建整体、累积和年度共现网络。我们首先分析了算法网络的特征,然后利用各种中心度指标得出了每个算法在整个领域和每个年度的群体影响力得分和排名。结果表明,算法网络也具有复杂网络的特征,节点之间的紧密联系发展了大约四十年。对于不同的算法,经典的、高性能的、出现在不同时代交界处的算法会在网络中拥有较高的流行度、控制力、中心地位和均衡的影响力。当一种算法在群体中的影响力逐渐减弱时,它通常会首先失去其核心地位,随后与其他算法的关联也会逐渐减弱。本文的时间覆盖面广,跨越了四十多年的学术出版物,确保了网络的深度和完整性。我们的研究成果为构建将算法、学者和任务相互联系起来的多层面网络奠定了基石,为今后探索它们的科学作用和语义关系提供了便利。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Aslib Journal of Information Management
Aslib Journal of Information Management COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
5.30
自引率
19.20%
发文量
79
期刊介绍: Aslib Journal of Information Management covers a broad range of issues in the field, including economic, behavioural, social, ethical, technological, international, business-related, political and management-orientated factors. Contributors are encouraged to spell out the practical implications of their work. Aslib Journal of Information Management Areas of interest include topics such as social media, data protection, search engines, information retrieval, digital libraries, information behaviour, intellectual property and copyright, information industry, digital repositories and information policy and governance.
期刊最新文献
Exploring the impact of team engagement on patient satisfaction: insights from social support and transactive memory system Factors affecting user intention to use social commerce continuously from a habit perspective What decision-making process do mHealth users go through when faced with privacy disclosure behaviors? A dual trade-off perspective Collaborative online shopping: customer satisfaction and the influence of product type, gender and involvement An associative text analyzer to facilitate effectiveness of exploring historical texts for digital humanities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1