Demo Data from EDBT 2026 / reviewers in the wild / expert
Tanakitti Sachati
dblp:275/4735
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Empirical software engineering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
citation analysis |
0.4 | 1 | 2020 | Automatic Classification of Algorithm Citation Functions in Scientific Literature · IEEE Trans. Knowl. Data Eng. 2020 |
Empirical software engineering
mining software repositories |
0.4 | 1 | 2020 | Automatic Classification of Algorithm Citation Functions in Scientific Literature · IEEE Trans. Knowl. Data Eng. 2020 |
Methods — techniques the papers use, named apart from their topics
heterogeneous ensemble machine learning · 0.9base classifiers · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Automatic Classification of Algorithm Citation Functions in Scientific LiteratureabstractComputer 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. Suppawong Tuarob, Sung Woo Kang, Poom Wettayakorn, Chanathip Pornprasit, Tanakitti Sachati, Saeed-Ul Hassan, Peter Haddawy |
IEEE Trans. Knowl. Data Eng. | 5 |