Research on Dimensional Reduction Methods for Incomplete Data Labeling Based on Maximal Consistent Blocks

Read full text Summarise with VIRAT
Authors: S. X. Chen, Zhongying Suo, Yuanbo Kong, Songlei Xue, Zhuoluo Wang
Cited by: 0
References: 25

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper proposes a unified approach based on maximal consistent blocks (MCBs) to address the problem of incomplete single-label and multi-label dimensional reduction. The matrix computation method for maximal consistent blocks is improved by introducing a dynamic multi-row detection mechanism and optimizing the block size determination criteria. The complete set of maximal consistent blocks can be efficiently obtained via matrix intersection operations. For incomplete single-label decision information systems, an attribute reduction algorithm is designed based on maximal consistent blocks. Redundant attributes are eliminated by preserving the upper and lower approximation distributions of decision classes. In the multi-label scenario, a complementary decision reduct method integrating coarse and fine decision functions is proposed, and a unified solution paradigm is adopted to accomplish multi-label dimensional reduction. The effectiveness in classification (F1-score, Ranking Loss, Hamming Loss), reduction performance, and runtime efficiency is validated via statistical tests, scalability studies, structured missingness studies, and comparisons with four representative baselines on Birds, Scene, and Yeast datasets (5%/10%/15% missing rates).

Fields of Study & Subjects

Rough Sets and Fuzzy Logic Text and Document Classification Technologies Machine Learning and Data Classification

Publication details

Journal / source
Axioms
Volume
15
Issue
4
Pages
246–246
Publication date
25 March 2026
Language
EN