Publication: Automatic Classification of Algorithm Citation Functions in Scientific Literature
Issued Date
2020-10-01
Resource Type
ISSN
15582191
10414347
10414347
Other identifier(s)
2-s2.0-85091230018
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
IEEE Transactions on Knowledge and Data Engineering. Vol.32, No.10 (2020), 1881-1896
Suggested Citation
Suppawong Tuarob, Sung Woo Kang, Poom Wettayakorn, Chanatip Pornprasit, Tanakitti Sachati, Saeed Ul Hassan, Peter Haddawy Automatic Classification of Algorithm Citation Functions in Scientific Literature. IEEE Transactions on Knowledge and Data Engineering. Vol.32, No.10 (2020), 1881-1896. doi:10.1109/TKDE.2019.2913376 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/59041
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Automatic Classification of Algorithm Citation Functions in Scientific Literature
Other Contributor(s)
Abstract
© 1989-2012 IEEE. Computer sciences and related disciplines evolve around developing, evaluating, and applying algorithms. Typically, an algorithm is not developed from scratch, but uses and builds upon existing ones, which often are proposed and published in scholarly articles. The ability to capture this evolution relationship among these algorithms in scientific literature would not only allow us to understand how a particular algorithm is composed, but also shed light on large-scale analysis of algorithmic evolution through different temporal spans and thematic scales. We propose to capture such evolution relationship between two algorithms by investigating the knowledge represented in citation contexts, where authors explain how cited algorithms are used in their works. A set of heterogeneous ensemble machine-learning methods is proposed, where the combination of two base classifiers trained with heterogeneous feature types is used to automatically identify the algorithm usage relationship. The proposed heterogeneous ensemble methods achieve the best average F1 of 0.749 and 0.905 for fine-grained and binary algorithm citation function classification, respectively. The success of this study will allow us to generate a large-scale algorithm citation network from a collection of scholarly documents representing multiple time spans, venues, and fields of study. Such a network will be used as an instrument not only to answer critical questions in algorithm search, such as identifying the most influential and generalizable algorithms, but also to study the evolution of algorithmic development and trends over time.