Demo Data from EDBT 2026 / reviewers in the wild / expert
Chieh-Han Wu
dblp:173/9237
· DBLP profile ↗
5ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021
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
2 papers |
Recommender systems · 38% Data mining · 25% Information retrieval · 25% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › text mining
text classification |
0.6 | 1 | 2022 | Metadata-Induced Contrastive Learning for Zero-Shot Multi-Label Text Classification · WWW 2022 |
Recommender systems › knowledge-aware recommendation
knowledge graph-based recommendation |
0.4 | 1 | 2020 | In Search for a Cure: Recommendation With Knowledge Graph on CORD-19 · KDD 2020 |
Recommender systems › content recommendation
paper recommendation |
0.4 | 1 | 2020 | In Search for a Cure: Recommendation With Knowledge Graph on CORD-19 · KDD 2020 |
Knowledge graphs
knowledge graph construction |
0.1 | 1 | 2020 | In Search for a Cure: Recommendation With Knowledge Graph on CORD-19 · KDD 2020 |
Methods — techniques the papers use, named apart from their topics
metadata-induced learning · 0.6contrastive learning · 0.6knowledge graph · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Efficient level-3 secure certificateless signature against malicious KGC attacks for IoT
Yi-Fan Tseng, Chieh-Han Wu |
Comput. Networks | 2 |
| 2022 | Metadata-Induced Contrastive Learning for Zero-Shot Multi-Label Text ClassificationabstractLarge-scale multi-label text classification (LMTC) aims to associate a document with its relevant labels from a large candidate set. Most existing LMTC approaches rely on massive human-annotated training data, which are often costly to obtain and suffer from a long-tailed label distribution (i.e., many labels occur only a few times in the training set). In this paper, we study LMTC under the zero-shot setting, which does not require any annotated documents with labels and only relies on label surface names and descriptions. To train a classifier that calculates the similarity score between a document and a label, we propose a novel metadata-induced contrastive learning (MICoL) method. Different from previous text-based contrastive learning techniques, MICoL exploits document metadata (e.g., authors, venues, and references of research papers), which are widely available on the Web, to derive similar document–document pairs. Experimental results on two large-scale datasets show that: (1) MICoL significantly outperforms strong zero-shot text classification and contrastive learning baselines; (2) MICoL is on par with the state-of-the-art supervised metadata-aware LMTC method trained on 10K–200K labeled documents; and (3) MICoL tends to predict more infrequent labels than supervised methods, thus alleviates the deteriorated performance on long-tailed labels. Yu Zhang 0044, Zhihong Shen, Chieh-Han Wu, Boya Xie, Junheng Hao, Ye-Yi Wang, Kuansan Wang, Jiawei Han 0001 |
WWW | 3 |
| 2020 | Explainable and Sparse Representations of Academic Articles for Knowledge ExplorationabstractWe focus on a recently deployed system built for summarizing academic articles by concept tagging. The system has shown great coverage and high accuracy of concept identification which could be contributed by the knowledge acquired from millions of publications. Provided with the interpretable concepts and knowledge encoded in a pre-trained neural model, we investigate whether the tagged concepts can be applied to a broader class of applications. We propose transforming the tagged concepts into sparse vectors as representations of academic documents. The effectiveness of the representations is analyzed theoretically by a proposed framework. We also empirically show that the representations can have advantages on academic topic discovery and paper recommendation. On these applications, we reveal that the knowledge encoded in the tagging system can be effectively utilized and can help infer additional features from data with limited information. Keng-Te Liao 0001, Zhihong Shen, Chiyuan Huang, Chieh-Han Wu, Po-Chun Chen, Kuansan Wang, Shou-De Lin |
COLING | 4 |
| 2020 | In Search for a Cure: Recommendation With Knowledge Graph on CORD-19abstractThe whole globe has cranked up for coping with the COVID-19 situation. The hands-on tutorial targets at providing a comprehensive and pragmatic end-to-end walk-through for building an academic research paper recommender for the use case of COVID-19 related study, with the help of knowledge graph technology. The code examples that demonstrate the theories are reproducible and can hopefully provide value for researchers to build tools that support conducting research to find a cure to COVID-19. Iris Shen, Jianxun Lian, Chieh-Han Wu, Miguel González-Fierro, Andreas Argyriou |
KDD | 4 |
| 2015 | Robust and distributed web-scale near-dup document conflation in microsoft academic serviceabstractIn modern web-scale applications that collect data from different sources, entity conflation is a challenging task due to various data quality issues. In this paper, we propose a robust and distributed framework to perform conflation on noisy data in the Microsoft Academic Service dataset. Our framework contains two major components. In the offline component, we train a GBDT model to determine whether two papers from different sources should be conflated to the same paper entity. In the online component, we propose a scalable shingling algorithm that can apply our offline model to over 100 million instances. The result shows that our algorithm can conflate noisy data robustly and efficiently. Chieh-Han Wu, Yang Song 0008 |
IEEE BigData | 1 |