Reduction algorithms based on discernibility matrix: The ordered attributes method
From MaRDI portal
Publication:5956840
DOI10.1007/BF02943234zbMath1014.68160MaRDI QIDQ5956840
Publication date: 28 July 2003
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
68T30: Knowledge representation
Related Items
Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning, DYNAMIC REDUCTS GENERATION USING CASCADING HASHES, Solving the Attribute Reduction Problem with Ant Colony Optimization, Analysis of alternative objective functions for attribute reduction in complete decision tables, Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation, A heuristic knowledge-reduction method for decision formal contexts, Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model, Rudiments of rough sets, EROS: Ensemble rough subspaces, Discernibility matrix simplification for constructing attribute reducts, A reduction algorithm meeting users' requirements., An efficient algorithm for Pawlak reduction based on simplified discernibility matrix, Knowledge reduction based on divide and conquer method in rough set theory, Control approach to rough set reduction, Data analysis based on discernibility and indiscernibility, Second attribute algorithm based on tree expression, A Model of User-Oriented Reduct Construction for Machine Learning
Cites Work
