mlsanityData to 7 Oct 2026

An Efficient and Accurate Rough Set for Feature Selection, Classification and Knowledge Representation

arXiv 2201.00436 ↗First posted 29 Dec 2021cs.LG cs.AI cs.DBcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper present a strong data mining method based on rough set, which can realize feature selection, classification and knowledge representation at the same time. Rough set has good interpretability, and is a popular method for feature selections. But low efficiency and low accuracy are its main drawbacks that limits its application ability. In this paper,corresponding to the accuracy, we first find the ineffectiveness of rough set because of overfitting, especially in processing noise attribute, and propose a robust measurement for an attribute, called relative importance.we proposed the concept of "rough concept tree" for knowledge representation and classification. Experimental results on public benchmark data sets show that the proposed framework achieves higher accurcy than seven popular or the state-of-the-art feature selection methods.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 56 references that are in the map. First posted on arXiv 29 Dec 2021.

Builds on

3 of 56 references.

References · 3

  1. 2020Infinite Feature Selection: A Graph-based Feature Filtering Approachcited by 16
  2. 2017Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approachcited by 6
  3. 2017Ranking to Learn: Feature Ranking and Selection via Eigenvector Centralitycited by 3

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1.

5 papers.