To read this content please select one of the options below:

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

Yuzhuo Wang (School of Management, Anhui University, Hefei, China)
Chengzhi Zhang (Department of Information Management, Nanjing University of Science and Technology, Nanjing, China)
Min Song (Department of Library and Information Science, Yonsei University, Seoul, South Korea)
Seongdeok Kim (Department of Library and Information Science, Yonsei University, Seoul, South Korea)
Youngsoo Ko (Department of Library and Information Science, Yonsei University, Seoul, South Korea)
Juhee Lee (Department of Library and Information Science, Yonsei University, Seoul, South Korea)

Aslib Journal of Information Management

ISSN: 2050-3806

Article publication date: 22 February 2024

84

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.

Keywords

Acknowledgements

This study has received support from the National Natural Science Foundation of China (Grant No. 72074113, 72374103) and the Ministry of Education of the Republic of Korea and the National Research Foundation of Korea (NRF-2020S1A5B1104865).

Citation

Wang, Y., Zhang, C., Song, M., Kim, S., Ko, Y. and Lee, J. (2024), "Exploring academic influence of algorithms by co-occurrence network based on full-text of academic papers", Aslib Journal of Information Management, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/AJIM-09-2023-0352

Publisher

:

Emerald Publishing Limited

Copyright © 2024, Emerald Publishing Limited

Related articles