Reduction algorithms based on discernibility matrix: The ordered attributes method

DOI10.1007/BF02943234zbMATH Open1014.68160MaRDI QIDQ5956840FDOQ5956840

Authors: Jue Wang, Ju Wang 

Publication date: 28 July 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

reduction algorithmsPawlak reduct

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Rough sets in knowledge discovery 1. Methodology and applications
• Analysis on attribute reduction strategies of rough set

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
• Title not available (Why is that?)
• 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
• Investigation on AQ11, ID3 and the principle of discernibility matrix
• Discernibility matrix simplification for constructing attribute reducts
• Title not available (Why is that?)
• A reduction algorithm meeting users' requirements.
• An algorithm for relative reduction based on simplified binary discernibility matrix
• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
• The reduction algorithm of discernibility matrix in incomplete and fuzzy objective information systems
• Solving the Attribute Reduction Problem with Ant Colony Optimization
• An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
• Improved general attribute reduction algorithms
• Title not available (Why is that?)
• A heuristic knowledge-reduction method for decision formal contexts
• An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
• Second attribute algorithm based on tree expression
• Title not available (Why is that?)
• A rule induction algorithm in incomplete decision table based on attribute order
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
• Data analysis based on discernibility and indiscernibility
• Control approach to rough set reduction
• Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning
• Knowledge reduction based on divide and conquer method in rough set theory
• Discovering natural laws by reduction
• Reduction tree algorithm based on discernibility matrix
• Finding rough and fuzzy-rough set reducts with SAT
• 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
• A Model of User-Oriented Reduct Construction for Machine Learning
• Dynamic reducts generation using cascading hashes
• Bidirectional heuristic attribute reduction based on conflict region

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)