Reduction algorithms based on discernibility matrix: The ordered attributes method
From MaRDI portal
Publication:5956840
Recommendations
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- scientific article; zbMATH DE number 6612574
- An algorithm for relative reduction based on simplified binary discernibility matrix
Cites work
Cited in
(39)- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
- EROS: Ensemble rough subspaces
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- scientific article; zbMATH DE number 6612574 (Why is no real title available?)
- An incremental algorithm for attribute reduction based on a labeled discernibility matrix
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Analysis of alternative objective functions for attribute reduction in complete decision tables
- Rudiments of rough sets
- Discernibility matrix simplification for constructing attribute reducts
- Investigation on AQ11, ID3 and the principle of discernibility matrix
- scientific article; zbMATH DE number 2219522 (Why is no real title available?)
- A reduction algorithm meeting users' requirements.
- Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
- An algorithm for relative reduction based on simplified binary discernibility matrix
- The reduction algorithm of discernibility matrix in incomplete and fuzzy objective information systems
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Solving the Attribute Reduction Problem with Ant Colony Optimization
- A heuristic knowledge-reduction method for decision formal contexts
- Improved general attribute reduction algorithms
- scientific article; zbMATH DE number 597801 (Why is no real title available?)
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Second attribute algorithm based on tree expression
- scientific article; zbMATH DE number 5733719 (Why is no real title available?)
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
- A rule induction algorithm in incomplete decision table based on attribute order
- Data analysis based on discernibility and indiscernibility
- Control approach to rough set reduction
- Knowledge reduction based on divide and conquer method in rough set theory
- Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning
- Finding rough and fuzzy-rough set reducts with SAT
- Discovering natural laws by reduction
- Reduction tree algorithm based on discernibility matrix
- A rough set method for the vertex cover problem in graph theory
- Parallel attribute reduction algorithms using MapReduce
- Cost-sensitive approximate attribute reduction with three-way decisions
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Bidirectional heuristic attribute reduction based on conflict region
- A Model of User-Oriented Reduct Construction for Machine Learning
- Dynamic reducts generation using cascading hashes
This page was built for publication: Reduction algorithms based on discernibility matrix: The ordered attributes method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956840)
