Incremental feature selection based on rough set in dynamic incomplete data

Wenhao Shu, Hong Shen

Research output: Contribution to journalArticlepeer-review

104 Citations (Scopus)


Feature selection plays a vital role in many areas of pattern recognition and data mining. The effective computation of feature selection is important for improving the classification performance. In rough set theory, many feature selection algorithms have been proposed to process static incomplete data. However, feature values in an incomplete data set may vary dynamically in real-world applications. For such dynamic incomplete data, a classic (non-incremental) approach of feature selection is usually computationally time-consuming. To overcome this disadvantage, we propose an incremental approach for feature selection, which can accelerate the feature selection process in dynamic incomplete data. We firstly employ an incremental manner to compute the new positive region when feature values with respect to an object set vary dynamically. Based on the calculated positive region, two efficient incremental feature selection algorithms are developed respectively for single object and multiple objects with varying feature values. Then we conduct a series of experiments with 12 UCI real data sets to evaluate the efficiency and effectiveness of our proposed algorithms. The experimental results show that the proposed algorithms compare favorably with that of applying the existing non-incremental methods.

Original languageEnglish
Pages (from-to)3890-3906
Number of pages17
JournalPattern Recognition
Issue number12
Publication statusPublished - 1 Dec 2014
Externally publishedYes


  • Dynamic incomplete data
  • Feature selection
  • Positive region
  • Rough set theory


Dive into the research topics of 'Incremental feature selection based on rough set in dynamic incomplete data'. Together they form a unique fingerprint.

Cite this