Attribute reduction based on consistent covering rough set and its application
From MaRDI portal
rough set theoryattribute reductiondata redundancyLeast Squares Support Vector Machine (LS-SVM)Relevance Vector Machine (RVM)
Recommendations
- A novel method for attribute reduction of covering decision systems
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A novel method for attribute reduction based on covering rough sets
- Attribute reduction based on conditional information entropy over consistent covering decision system
- Reduction about approximation spaces of covering generalized rough sets
Cites work
- scientific article; zbMATH DE number 4046636 (Why is no real title available?)
- scientific article; zbMATH DE number 4110174 (Why is no real title available?)
- scientific article; zbMATH DE number 1754538 (Why is no real title available?)
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A novel method for attribute reduction of covering decision systems
- Covering based rough set approximations
- Extensions and intensions in the rough set theory
- Generalized approximations defined by non-equivalence relations
- Model selection for the LS-SVM. Application to handwriting recognition
- Rough sets
- Topological approaches to covering rough sets
Cited in
(4)- A Pythagorean fuzzy multigranulation probabilistic model for mine ventilator fault diagnosis
- Innovative rough set approaches using novel initial-neighborhood systems: applications in medical diagnosis of COVID-19 variants
- Some NP-complete problems for attribute reduction in consistent decision tables
- Ensemble-based neighborhood attribute reduction: a multigranularity view
This page was built for publication: Attribute reduction based on consistent covering rough set and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688128)
