Attribute reduction: a horizontal data decomposition approach
From MaRDI portal
Publication:2403319
DOI10.1007/s00500-014-1554-8zbMath1370.68273OpenAlexW1974313046WikidataQ59472806 ScholiaQ59472806MaRDI QIDQ2403319
Publication date: 8 September 2017
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-014-1554-8
Related Items (3)
Three-way class-specific attribute reducts from the information viewpoint ⋮ Quantitative three-way class-specific attribute reducts based on region preservations ⋮ Multigranulation vague rough set over two universes and its application to group decision making
Cites Work
- A mathematical foundation for improved reduct generation in information systems
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Approximations and reducts with covering generalized rough sets
- Rough sets in knowledge discovery 2. Applications, case studies and software systems
- Maximal consistent block technique for rule acquisition in incomplete information systems.
- Rough set approach to incomplete information systems
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Approaches to knowledge reductions in inconsistent systems
- A New Discernibility Matrix and Function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Attribute reduction: a horizontal data decomposition approach