Demo Data from VLDB 2026 / reviewers in the wild / expert
Baekkwan Park
dblp:326/4353
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
1 paper |
Information extraction and text analysis · 87% Trustworthy machine learning · 13% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Medical and health informatics
clinical prediction |
0.8 | 1 | 2024 | Multi-TA: Multilevel Temporal Augmentation for Robust Septic Shock Early Prediction · IJCAI 2024 |
Natural language and speech › Information extraction and text analysis › named entity recognition
low-resource named entity recognition |
0.6 | 1 | 2022 | Robust and Informative Text Augmentation (RITA) via Constrained Worst-Case Transformations for Low-Resource Named Entity Recognition · KDD 2022 |
Natural language and speech › Information extraction and text analysis
named entity recognition |
0.6 | 1 | 2022 | Robust and Informative Text Augmentation (RITA) via Constrained Worst-Case Transformations for Low-Resource Named Entity Recognition · KDD 2022 |
Machine learning › Trustworthy machine learning
robustness |
0.2 | 1 | 2022 | Robust and Informative Text Augmentation (RITA) via Constrained Worst-Case Transformations for Low-Resource Named Entity Recognition · KDD 2022 |
Methods — techniques the papers use, named apart from their topics
temporal augmentation · 0.8worst-case transformation · 0.6constrained optimization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Multi-TA: Multilevel Temporal Augmentation for Robust Septic Shock Early Prediction
Hyunwoo Sohn, Kyungjin Park, Baekkwan Park, Min Chi |
IJCAI | 3 |
| 2022 | Robust and Informative Text Augmentation (RITA) via Constrained Worst-Case Transformations for Low-Resource Named Entity RecognitionabstractRecent advances in deep learning have brought remarkable performance improvements in named entity recognition (NER), specifically in token-level classification problems. However, deep learning models often require a large amount of annotated data to achieve satisfactory performance, and NER annotation is significantly time-consuming and labor-intensive due to the fine-grained labels. To address this issue, we propose a textual data augmentation method that can automatically generate informative synthetic samples, which contribute to the development of a robust classifier. The proposed method generates additional training data by estimating the optimal level of worst-case transformation of training data while preserving the original annotation, and includes them into training to construct a robust decision boundary. Extensive experiments conducted on two benchmark datasets in a low-resource environment reveal that the proposed method outperforms two baseline augmentation methods including human annotation, which is typically considered to provide a decent amount of performance boost. To elucidate the processes, we also present in-depth analyses of the generated samples and estimated model parameters. Hyunwoo Sohn, Baekkwan Park |
KDD | 2 |