A reduction algorithm meeting users' requirements.
From MaRDI portal
Publication:1850684
DOI10.1007/BF02948826zbMath1057.68026MaRDI QIDQ1850684
Publication date: 2002
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Related Items (5)
Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model ⋮ Data analysis based on discernibility and indiscernibility ⋮ A Model of User-Oriented Reduct Construction for Machine Learning ⋮ Discernibility matrix simplification for constructing attribute reducts ⋮ DYNAMIC REDUCTS GENERATION USING CASCADING HASHES
Uses Software
Cites Work
- Unnamed Item
- Data mining. Concepts and techniques
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Rough sets in knowledge discovery 1. Methodology and applications
- Rough approximation of a preference relation by dominance relations
- Rough sets
- Rough sets theory for multicriteria decision analysis
- Investigation on AQ11, ID3 and the principle of discernibility matrix
- Reduction algorithms based on discernibility matrix: The ordered attributes method
This page was built for publication: A reduction algorithm meeting users' requirements.
