Demo Data from VLDB 2026 / reviewers in the wild / expert
Min-Kook Suh
dblp:341/4238
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-1654-3689ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 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
2 papers |
Transfer learning and domain adaptation · 47% Learning paradigms · 36% Representation and self-supervised learning · 18% | |
| Theoretical computer science
1 paper |
Information theory · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.9 | 1 | 2025 | Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025 |
Machine learning › Transfer learning and domain adaptation › few-shot learning
tabular few-shot learning |
0.9 | 1 | 2025 | Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025 |
Machine learning › Learning paradigms
class imbalance |
0.7 | 1 | 2023 | Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels · ICML 2023 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.7 | 1 | 2023 | Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels · ICML 2023 |
Machine learning › Learning paradigms
long-tailed recognition |
0.7 | 1 | 2023 | Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels · ICML 2023 |
Information theory › information measures › mutual information
mutual information maximization |
0.7 | 1 | 2023 | Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels · ICML 2023 |
Data mining › predictive modeling › classification
tabular data classification |
0.3 | 1 | 2025 | Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
few-shot learning · 1.7data augmentation · 1.7logit adjustment · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark
Kyungeun Lee, Moonjung Eo, Hye-Seung Cho, Min-Kook Suh, Seoyoon Kim, Ye Seul Sim, Suhee Yoon, Sanghyu Yoon, Woohyung Lim |
KDD (2) | 4 |
| 2023 | Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth LabelsabstractAlthough contrastive learning methods have shown prevailing performance on a variety of representation learning tasks, they encounter difficulty when the training dataset is long-tailed. Many researchers have combined contrastive learning and a logit adjustment technique to address this problem, but the combinations are done ad-hoc and a theoretical background has not yet been provided. The goal of this paper is to provide the background and further improve the performance. First, we show that the fundamental reason contrastive learning methods struggle with long-tailed tasks is that they try to maximize the mutual information between latent features and input data. As ground-truth labels are not considered in the maximization, they are not able to address imbalances between classes. Rather, we interpret the long-tailed recognition task as a mutual information maximization between latent features and ground-truth labels. This approach integrates contrastive learning and logit adjustment seamlessly to derive a loss function that shows state-of-the-art performance on long-tailed recognition benchmarks. It also demonstrates its efficacy in image segmentation tasks, verifying its versatility beyond image classification. Code is available at https://github.com/bluecdm/Long-tailed-recognition. Min-Kook Suh, Seung-Woo Seo |
ICML | 1 |
| 2022 | AFF-CAM: Adaptive Frequency Filtering Based Channel Attention Module
Dongwook Yang, Min-Kook Suh, Seung-Woo Seo |
ACCV (6) | 2 |