22 January 2021 in IEEE Transactions on Fuzzy Systems
Recently, multilabel classification has generated considerable research interest. However, the high dimensionality of multilabel data incurs high costs; moreover, in many real applications, a number of labels of training samples are randomly missed. Thus, multilabel classification can have great complexity and ambiguity, which means some feature selection methods exhibit poor robustness and yield low prediction accuracy. To solve these issues, this article presents a novel feature selection method based on multilabel fuzzy neighborhood rough sets (MFNRS) and maximum relevance minimum redundancy (MRMR) that can be used on multilabel data with missing labels. First, to handle multilabel data with missing labels, a relation coefficient of samples, label complement matrix, and label-specific feature matrix are constructed and implemented in a linear regression model to recover missing labels. Second, the margin-based fuzzy neighborhood radius, fuzzy neighborhood similarity relationship, and fuzzy neighborhood information granule are developed. The MFNRS model is built based on multilabel neighborhood rough sets combined with fuzzy neighborhood rough sets. Based on algebra and information views, certain fuzzy neighborhood entropy-based uncertainty measures are proposed for MFNRS. The fuzzy neighborhood mutual information-based MRMR model with label correlation is improved to evaluate the performance of candidate features. Finally, a feature selection algorithm is designed to improve the performance for multilabel data with missing labels. Experiments on 20 datasets verify that our method is effective not only for recovering missing labels but also for selecting significant features with better classification performance.
4 December 2019 in IEEE Access
1 April 2026 in IEEE/CAA Journal of Automatica Sinica
Advances in data acquisition and accumulation on a massive scale are fueling “the curse of dimensionality” which may deteriorate the generalization performance of machine learning models. Such a dilemma gives birth to the technique of feature selection excelling in the presence of high-dimensional data. As a specific method based on rough set theory, rough feature selection (RFS) has been widely concerned and fruitfully applied. In this survey, we provide a comprehensive review of RFS algorithms that have proliferated in recent years. Firstly, we briefly introduce some typical rough set models especially neighborhood rough set and fuzzy rough set, as well as representative rough feature evaluation criteria. We then systematically discuss several emerging topics of RFS including accelerated, ensemble, incremental, label ambiguous, weakly-supervised, and multi-granularity RFS. Additionally, we illuminate the regular performance validation scheme of RFS and conduct a number of experiments to present benchmarking results of state-of-the-art RFS algorithms. Finally, we summarize the pros and cons of existing research efforts and outline the open challenges and opportunities of class imbalance, multimodal scenario, causality inference, and high-level representation for RFS. By providing indepth knowledge of RFS, we anticipate this survey will: 1) serve as a guidebook for newcomers intending to delve into RFS and a stepping-stone for researchers and practitioners to solve domain-specific problems; 2) gain insights into the state-of-the-art published findings, triggering a series of breakthroughs in RFS; 3) underscore some challenges ahead of RFS, directing future efforts toward punctuating advances beyond questions currently pursued.
22 July 2025 in IEEE Transactions on Multimedia
Traditional multilabel feature selection (MFS) typically relies on pre-computing global information within the feature space. However, in real-world applications, features are dynamically generated and continuously arrive over time, known as streaming features, rendering many existing approaches ineffective. Some MFS methods for streaming features have been developed, several challenges persist: (1) Previous research often uses certain strategies to model streaming feature evaluation, failing to process fuzzy information effectively; (2) The maximum correlation between features and class is emphasized, while inter-class separability is ignored, leading to inaccurate feature evaluation; (3) The continuous influx of streaming features brings the dynamics and unknowns to data distribution, has been largely overlooked in previous work; (4) Streaming feature selection requires immediate feedback on newly arriving features, posing challenges to the algorithm's real-time responsiveness. Motivated by these observations, this paper introduces a novel online MFS strategy for streaming features. First, the weighted manifold distance is designed, and the fuzzy manifold similarity learning strategy is formalized to analyze the instance relationships of unknown distribution. Second, the fuzzy manifold intra-class correlation and inter-class separability are devised to quantify feature discriminability. Finally, a novel multilabel streaming feature analysis framework is established, with feature discriminability as the guiding factor. Incoming features are categorized as weakly relevant, strongly relevant, or redundant, culminating in generating a reliable feature selection subset. Extensive experiments on fifteen public datasets demonstrate that our algorithm achieves competitive performance compared to nine state-of-the-art offline and online algorithms.
2 June 2026 in Expert Systems with Applications
1 January 2026 in IEEE Transactions on Image Processing
Representation learning serves as a critical bridge between human cognition and the data world, constituting an essential component of machine learning architectures where comprehensiveness and flexibility are paramount. However, existing multi-view feature selection methods are constrained by the raw-scale representations, neglecting comprehensive depth-breadth integration and flexible adaptability. This paper presents multi-scale fuzzy fusion-based heterogeneous granular-ball flexible representation learning for multi-view feature selection (MFHGBFR). A comprehensive multi-view, multi-scale analytical foundation is established to promote depth-breadth representation learning, where views represent breadth and scales represent depth in human cognition. Heterogeneous granular ball-based flexible representations are adaptively developed via multi-scale fuzzy fusion, effectively capturing intricate data manifolds and implicit fuzzy patterns across multi-granularity spaces. Intricate data manifolds are fitted with heterogeneous rather than conventional homogeneous structures to improve the adaptability of representations' multi-granularity. Implicit fuzzy patterns are extracted with fuzzy approximation operators to mitigate fuzziness and uncertainty in a multi-granularity space. For the first time, granular-ball representation learning and feature selection are adaptively optimized in a unified one-step framework, rather than the conventional two-step frameworks, for flexible adaptability. An effective optimization algorithm with proven convergence is derived. Through the learned high-quality representations, the MFHGBFR manifests superior performance, robustness, and efficiency. Comparative experiments against contemporary state-of-the-art algorithms substantiate these advantages quantitatively and qualitatively.