Attribute reduction based on consistent covering rough set and its application
From MaRDI portal
Publication:1688128
DOI10.1155/2017/8986917zbMath1377.93027OpenAlexW2764281603MaRDI QIDQ1688128
Yongliang Lin, Jianchuan Bai, Kewen Xia, Pan-Pan Wu
Publication date: 5 January 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/8986917
rough set theoryattribute reductiondata redundancyLeast Squares Support Vector Machine (LS-SVM)Relevance Vector Machine (RVM)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A Pythagorean fuzzy multigranulation probabilistic model for mine ventilator fault diagnosis ⋮ Ensemble-based neighborhood attribute reduction: a multigranularity view ⋮ Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel method for attribute reduction of covering decision systems
- Covering based rough set approximations
- Generalized approximations defined by non-equivalence relations
- Model selection for the LS-SVM. Application to handwriting recognition
- Topological approaches to covering rough sets
- Extensions and intensions in the rough set theory
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Rough sets
This page was built for publication: Attribute reduction based on consistent covering rough set and its application