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

Mingming Han

dblp:169/5424 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
1 paper
Data mining · 70% Database theory · 30%

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

TopicWeightPapersLastEvidence papers
Database theory › query complexity
data complexity
0.912025
Rethinking Oversampling With Class Alliance Constraints From Data Complexity Perspective · IEEE Trans. Knowl. Data Eng. 2025
Data mining › predictive modeling › classification
imbalanced classification
0.912025
Rethinking Oversampling With Class Alliance Constraints From Data Complexity Perspective · IEEE Trans. Knowl. Data Eng. 2025
Data mining › predictive modeling › classification › imbalanced classification
oversampling
0.912025
Rethinking Oversampling With Class Alliance Constraints From Data Complexity Perspective · IEEE Trans. Knowl. Data Eng. 2025
Data mining › predictive modeling
classification
0.312025
Rethinking Oversampling With Class Alliance Constraints From Data Complexity Perspective · IEEE Trans. Knowl. Data Eng. 2025

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

region-level filtering · 0.9oversampling · 0.9
YearPublicationVenuePosition
2025 A new data complexity measure for multi-class imbalanced classification tasks
abstract
The skewed class distribution and data complexity may severely affect the imbalanced classification results. The cost of classification can be significantly reduced if these data complexity are measured and pre-processed prior to training, particularly when dealing with large-scale and high-dimensional datasets. Although many methods have been proposed to evaluate data complexity, most of them fail to fully consider the interaction among different data characteristics, or the connection between class imbalance and these characteristics, thus posing a serious challenge to effectively evaluate the difficulty of classification. This paper presents a new data complexity measure MFII (multi-factor imbalance index), which measures the combined effects of the skewed class distribution and data characteristics on classification difficulty. In particular, it further comprehensively investigates the impact of overlap size, confusion degree, and sub-cluster structure. VoR (value of resolution) and DoC (degree of consistency) are also proposed to evaluate the resolution and interpretability of complexity measures. The experimental results demonstrate that MFII has lower VoR and a stronger correlation with classification metrics, which indicates that MFII can more accurately evaluate the difficulty of multi-class imbalanced classification tasks.
Mingming Han, Husheng Guo
Pattern Recognit.1
2025 Rethinking Oversampling With Class Alliance Constraints From Data Complexity Perspective
abstract
Class overlap is a major factor of data complexity that hampers classifier performance, particularly in imbalanced learning scenarios. Most existing oversampling methods rely on conservative seed sample selection and decoupled synthesis strategies, which limit sample diversity and fail to effectively control overlap risk. This paper proposes a novel oversampling framework called TMACO (Class Alliance-Constrained Oversampling), which integrates data complexity considerations into both seed selection and sample generation. First, TMACO selects seed sample units using a class alliance constraint that jointly considers spatial geometry and class distribution to enhance diversity and representativeness. Second, it generates synthetic samples based on three-point units to ensure regional stability. Third, a region-level filtering mechanism is applied to prevent synthetic samples from intruding into majority class areas. Extensive experiments on benchmark and real-world datasets demonstrate that TMACO consistently improves minority class performance and overall classification accuracy compared to state-of-the-art oversampling techniques. The proposed method also offers interpretable parameter control and adapts well to varying task objectives.
Mingming Han, Husheng Guo, Gaoxia Jiang, Wenjian Wang 0001
IEEE Trans. Knowl. Data Eng.1