A reduction algorithm meeting users' requirements.
From MaRDI portal
Publication:1850684
DOI10.1007/BF02948826zbMATH Open1057.68026MaRDI QIDQ1850684FDOQ1850684
Publication date: 2002
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Recommendations
- Algorithm of finding the best reduction based on reduction significance
- scientific article; zbMATH DE number 1047677
- A polynomial reduction algorithm
- Reducing the complexity of reductions
- scientific article; zbMATH DE number 1559593
- On Reduct Construction Algorithms
- On Reduct Construction Algorithms
- scientific article; zbMATH DE number 989224
- scientific article
- Publication:3032302
Cites Work
- Rough sets
- Rough sets theory for multicriteria decision analysis
- Data mining. Concepts and techniques
- Rough sets in knowledge discovery 1. Methodology and applications
- Rough approximation of a preference relation by dominance relations
- Title not available (Why is that?)
- Reduction algorithms based on discernibility matrix: The ordered attributes method
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Investigation on AQ11, ID3 and the principle of discernibility matrix
Cited In (6)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Discernibility matrix simplification for constructing attribute reducts
- DYNAMIC REDUCTS GENERATION USING CASCADING HASHES
- Data analysis based on discernibility and indiscernibility
- A Model of User-Oriented Reduct Construction for Machine Learning
Uses Software
This page was built for publication: A reduction algorithm meeting users' requirements.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850684)
