Multi-label learning plays a crucial role in numerous real-world applications, where each instance may be associated with multiple semantic labels. However, in practical scenarios, label noise is widespread and poses a significant challenge, as it can simultaneously distort multiple labels due to ambiguous annotations, human fatigue, or automated labeling inaccuracies. While considerable progress has been made in developing noise-robust methods for single-label learning, addressing noise in multi-label settings remains substantially more challenging due to the intricate interplay among multiple potentially corrupted labels. This underscores the pressing need for effective label correction strategies tailored to noisy multi-label learning. To address this gap, we propose a latent contrastive embedding framework designed for noisy multi-label scenarios. The approach not only learns robust feature representations through supervised contrastive learning but also dynamically identifies clean labels via a small-loss guided sample selection strategy. Moreover, the embedding and label correction processes are jointly optimized, allowing the model to capture the semantic structure of both features and labels under noisy conditions. Specifically, we adopt a small-loss criterion to distinguish clean from noisy samples during the early training phase. In addition, a balanced loss is introduced to mitigate the effects of label imbalance and sample difficulty. Finally, comprehensive experiments conducted under various patterns and levels of label noise demonstrate the superior robustness and generalization ability of the proposed method in noisy multi-label classification tasks.

Partial multilabel learning is a pivotal area in machine learning that tackles scenarios where training instances are annotated with a set of candidate labels, only a subset of which is relevant. Existing approaches typically rely on global-level feature learning or noise disambiguation; however, they often struggle to effectively capture the multigranularity relationships inherent in feature and label spaces, and tend to overlook critical intrafeature information essential for accurate label discrimination. To address these limitations, we propose a novel partial multilabel learning framework based on a dynamic coarse-to-fine granularity feature aggregation strategy, which hierarchically extracts feature representations across multiple levels of granularity and dynamically emphasizes label-relevant feature components. Specifically, the dynamic fine-granularity graph captures label-specific local information by modeling the fuzzy aggregations among fine-granularity feature components, while the dynamic coarse-granularity graph learns adaptive label representations by identifying feature-aware correlations of labels and suppressing noise. By jointly leveraging these two complementary granularity levels, the model effectively integrates multilevel semantic relationships and enhances the overall discriminative capacity of the learned features. Extensive experiments conducted on benchmark datasets under varying noise conditions demonstrate that the proposed method consistently outperforms state-of-the-art approaches in partial multilabel classification.

In recent years, it has been difficult for multilabel classification to obtain complete multilabel data in real-world applications, and even a large number of labels for training samples are randomly missed. As a result, the classification task of incomplete multilabel data with missing labels faces formidable challenges. This paper presents a two-stage-neighborhood-based multilabel classification method for incomplete data with missing labels in neighborhood decision systems. First, to solve the problem of selecting the neighborhood radius manually, as well as balancing the samples in the neighborhood, the neighborhood radius based on the feature distribution function is defined, and the differences and similarities between samples through the identifiable and indiscernible matrices are, respectively, computed. Then, a restoration method for missing feature values is proposed for use in the first stage. Second, to consider the nonlinear relationship among features, a neighborhood-based fuzzy similarity relationship between samples is investigated based on the Gaussian kernel function. By integrating the fuzzy similarity relationship matrix, label-specific feature matrix, and label correlation matrix, an objective function based on the regression model is presented, the optimal solutions to the label-specific feature and label correlation matrices based on the gradient descent strategy are provided, and a new multilabel classification method with missing labels is developed during the second stage. Finally, two-stage multilabel classification algorithms are designed. Experiments on 18 multilabel data sets demonstrate that our designed algorithms are effective not only for recovering missing feature values, but also for improving the classification performance of data with missing labels.

A granular structure of intuitionistic fuzzy (IF) information presents simultaneously the similarity and diversity of samples. However, this structural representation has rarely displayed its technical capability in data mining and information processing due to the lack of suitable constructive methods and semantic interpretation for IF information with regard to real data. To pursue better performance of the IF-based technique in real-world data mining, in this article, we examine information granularity, information entropy of IF granular structures, and their applications to data reduction of IF information systems. First, several types of partial-order relations at different hierarchical levels are defined to reveal the granularity of IF granular structures. Second, the granularity invariance between different IF granular structures is characterized by using relational mappings. Third, Shannon's entropies are generalized to IF entropies and their relationships with the partial-order relations are addressed. Based on the theoretical analysis above, the significance of intuitionistic attributes using the information measures is then introduced and the information-preserving algorithm for data reduction of IF information systems is constructed. Finally, by inducing substantial IF relations from public datasets that take both the similarity/diversity between the samples from the same/different classes into account, a collection of numerical experiments is conducted to confirm the performance of the proposed technique.

Attribute subset selection is an important issue in data mining and information processing. However, most automatic methodologies consider only the relevance factor between samples while ignoring the diversity factor. This may not allow the utilization value of hidden information to be exploited. For this reason, we propose a hybrid model named intuitionistic fuzzy (IF) rough set to overcome this limitation. The model combines the technical advantages of rough set and IF set and can effectively consider the above-mentioned statistical factors. First, fuzzy information granules based on IF relations are defined and used to characterize the hierarchical structures of the lower and upper approximations of IF rough set within the framework of granular computing. Then, the computation of IF rough approximations and knowledge reduction in IF information systems are investigated. Third, based on the approximations of IF rough set, significance measures are developed to evaluate the approximation quality and classification ability of IF relations. Furthermore, a forward heuristic algorithm for finding one optimal reduct of IF information systems is developed using these measures. Finally, numerical experiments are conducted on public datasets to examine the effectiveness and efficiency of the proposed algorithm in terms of the number of selected attributes, computational time, and classification accuracy.