Open Continual Feature Selection via Granular-Ball Knowledge Transfer
Not on the map. Why?
Abstract (arXiv)
This paper presents a novel framework for continual feature selection (CFS) in data preprocessing, particularly in the context of an open and dynamic environment where unknown classes may emerge. CFS encounters two primary challenges: the discovery of unknown knowledge and the transfer of known knowledge. To this end, the proposed CFS method combines the strengths of continual learning (CL) with granular-ball computing (GBC), which focuses on constructing a granular-ball knowledge base to detect unknown classes and facilitate the transfer of previously learned knowledge for further feature selection. CFS consists of two stages: initial learning and open learning. The former aims to establish an initial knowledge base through multi-granularity representation using granular-balls. The latter utilizes prior granular-ball knowledge to identify unknowns, updates the knowledge base for granular-ball knowledge transfer, reinforces old knowledge, and integrates new knowledge. Subsequently, we devise an optimal feature subset mechanism that incorporates minimal new features into the existing optimal subset, often yielding superior results during each period. Extensive experimental results on public benchmark datasets demonstrate our method's superiority in terms of both effectiveness and efficiency compared to state-of-the-art feature selection methods.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 8 of its 37 references that are in the map. First posted on arXiv 15 Mar 2024.
Builds on
8 of 37 references.
References · 8
- 2018Task-Free Continual Learningcited by 221
- 2020A Wholistic View of Continual Learning with Deep Neural Networks: Forgotten Lessons and the Bridge to Active and Open World Learningcited by 87
- 2022Open-environment Machine Learningcited by 48
- 2022An Efficient and Adaptive Granular-ball Generation Method in Classification Problemcited by 33
- 2016Classification under Streaming Emerging New Classes: A Solution using Completely Random Treescited by 17
- 2020Infinite Feature Selection: A Graph-based Feature Filtering Approachcited by 16
- 2023Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation methodcited by 16
- 2021An Efficient and Accurate Rough Set for Feature Selection, Classification and Knowledge Representationcited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025ErrorEraser: Unlearning Data Bias for Improved Continual Learningcited by 3
- 2024Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundarycited by 2
- 2025Approximate Borderline Sampling using Granular-Ball for Classification Taskscited by 0
- 2026Implicit Non-Causal Factors are Out via Dataset Splitting for Domain Generalization Object Detectioncited by 0
- 2026Implicit Non-Causal Factors are Out via Dataset Splitting for Domain Generalization Object Detection27 Jan 2026
- 2025ErrorEraser: Unlearning Data Bias for Improved Continual Learning11 Jun 2025
- 2025Approximate Borderline Sampling using Granular-Ball for Classification Tasks3 Jun 2025
- 2024Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary18 Dec 2024