Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minyoung Bae

dblp:366/5554 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0004-9267-7138ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
Segmentation and scene understanding · 41% Generative modeling · 20% Deep learning architectures and training · 20%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
data augmentation
0.912025
Sample-Efficient Multi-Round Generative Data Augmentation for Long-Tail Instance Segmentation · NeurIPS 2025
Machine learning › Generative modeling
diffusion model
0.912025
Sample-Efficient Multi-Round Generative Data Augmentation for Long-Tail Instance Segmentation · NeurIPS 2025
Computer vision › Segmentation and scene understanding
instance segmentation
0.912025
Sample-Efficient Multi-Round Generative Data Augmentation for Long-Tail Instance Segmentation · NeurIPS 2025
Computer vision › Segmentation and scene understanding › instance segmentation
long-tailed instance segmentation
0.912025
Sample-Efficient Multi-Round Generative Data Augmentation for Long-Tail Instance Segmentation · NeurIPS 2025
Machine learning › Learning paradigms
semi-supervised learning
0.812024
Semi-Supervised Learning for Time Series Collected at a Low Sampling Rate · KDD 2024
Data mining
anomaly detection
0.812024
Breaking the Time-Frequency Granularity Discrepancy in Time-Series Anomaly Detection · WWW 2024
Data mining › anomaly detection
time series anomaly detection
0.812024
Breaking the Time-Frequency Granularity Discrepancy in Time-Series Anomaly Detection · WWW 2024
Image and video processing
super-resolution
0.812024
Semi-Supervised Learning for Time Series Collected at a Low Sampling Rate · KDD 2024

Methods — techniques the papers use, named apart from their topics

super-resolution module · 2.3semi-supervised learning · 2.3consistency regularization · 2.3feedback-guided generation · 0.9diffusion model · 0.9time-frequency alignment · 0.8nested-sliding windows · 0.8
YearPublicationVenuePosition
2025 Sample-Efficient Multi-Round Generative Data Augmentation for Long-Tail Instance Segmentation
abstract
Data synthesis has become increasingly crucial for long-tail instance segmentation tasks to mitigate class imbalance and high annotation costs. Previous methods have primarily prioritized the selection of data from a pre-generated image object pool, which frequently leads to the inefficient utilization of generated data. To address this inefficiency, we propose a **collaborative** approach that incorporates feedback from an instance segmentation model to guide the augmentation process. Specifically, the diffusion model uses feedback to generate objects that exhibit high uncertainty. The number and size of synthesized objects for each class are dynamically adjusted based on the model state to improve learning in underrepresented classes. This augmentation process is further strengthened by running **multiple rounds**, allowing feedback to be refined throughout training. In summary, **multi-round collaborative augmentation (MRCA)** enhances sample efficiency by providing optimal synthetic data at the right moment. Our framework requires **only 6\%** of the data generation needed by state-of-the-art methods while outperforming them.
Minyoung Bae, Jae-Gil Lee 0001
NeurIPS2
2024 Semi-Supervised Learning for Time Series Collected at a Low Sampling Rate
abstract
Although time-series classification has many applications in healthcare and manufacturing, the high cost of data collection and labeling hinders its widespread use. To reduce data collection and labeling costs while maintaining high classification accuracy, we propose a novel problem setting, called semi-supervised learning with low-sampling-rate time series, in which the majority of time series are collected at a low sampling rate and are unlabeled whereas the minority of time series are collected at a high sampling rate and are labeled. For this novel problem scenario, we develop the SemiTSR framework equipped with the super-resolution module and the semi-supervised learning module. Here, low-sampling-rate time series are upsampled precisely, taking periodicity and trend at each timestamp into account, and both labeled and unlabeled high-sampling-rate time series are utilized for training. In particular, consistency regularization between artificially downsampled time series derived from an original high-sampling-rate time series is effective at overcoming limited sampling rates. We demonstrate that SemiTSR significantly outperforms conventional semi-supervised learning techniques by assuring high classification accuracy with low-sampling-rate time series.
Minyoung Bae, Yooju Shin, Youngeun Nam, Youngseop Lee, Jae-Gil Lee 0001
KDD1
2024 Breaking the Time-Frequency Granularity Discrepancy in Time-Series Anomaly Detection
abstract
In light of the remarkable advancements made in time-series anomaly detection(TSAD), recent emphasis has been placed on exploiting the frequency domain as well as the time domain to address the difficulties in precisely detecting pattern-wise anomalies. However, in terms of anomaly scores, the window granularity of the frequency domain is inherently distinct from the data-point granularity of the time domain. Owing to this discrepancy, the anomaly information in the frequency domain has not been utilized to its full potential for TSAD. In this paper, we propose a TSAD framework, Dual-TF, that simultaneously uses both the time and frequency domains while breaking the time-frequency granularity discrepancy. To this end, our framework employs nested-sliding windows, with the outer and inner windows responsible for the time and frequency domains, respectively, and aligns the anomaly scores of the two domains. As a result of the high resolution of the aligned scores, the boundaries of pattern-wise anomalies can be identified more precisely. In six benchmark datasets, our framework outperforms state-of-the-art methods by 12.0--147%, as demonstrated by experimental results.
Youngeun Nam, Susik Yoon, Yooju Shin, Minyoung Bae, Hwanjun Song, Jae-Gil Lee 0001, Byung Suk Lee 0001
WWW4