Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
From MaRDI portal
Publication:541820
DOI10.1016/j.ijar.2010.07.011zbMath1214.68297OpenAlexW2078376232MaRDI QIDQ541820
Publication date: 8 June 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.07.011
discernibility matrixinformation entropyattribute reductionpositive regionboundary regionhybrid attribute measure
Related Items (20)
Positive macroscopic approximation for fast attribute reduction ⋮ Attribute reduction for sequential three-way decisions under dynamic granulation ⋮ Improved general attribute reduction algorithms ⋮ Semi-supervised feature selection for partially labeled mixed-type data based on multi-criteria measure approach ⋮ Fast attribute reduction via inconsistent equivalence classes for large-scale data ⋮ Entropy and co-entropy of a covering approximation space ⋮ Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems ⋮ Information-theoretic measures associated with rough set approximations ⋮ Covering-based multi-granulation fuzzy rough sets ⋮ Attribute Reduction of Incomplete Information Systems: An Intuitionistic Fuzzy Rough Set Approach ⋮ Test cost sensitive multigranulation rough set: model and minimal cost selection ⋮ Composite rough sets for dynamic data mining ⋮ Parallel attribute reduction algorithms using MapReduce ⋮ Quick general reduction algorithms for inconsistent decision tables ⋮ Efficient attribute reduction from the viewpoint of discernibility ⋮ Bidirectional heuristic attribute reduction based on conflict region ⋮ Quick attribute reduct algorithm for neighborhood rough set model ⋮ DYNAMIC REDUCTS GENERATION USING CASCADING HASHES ⋮ A fuzzy similarity-based rough set approach for attribute selection in set-valued information systems ⋮ Updating attribute reduction in incomplete decision systems with the variation of attribute set
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency-based search in feature selection
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Probabilistic rough set approximations
- Knowledge structure, knowledge granulation and knowledge distance in a knowledge base
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
- Discernibility matrix simplification for constructing attribute reducts
- Exploring the boundary region of tolerance rough sets for feature selection
- Analysis on attribute reduction strategies of rough set
- Data analysis based on discernibility and indiscernibility
- Rough sets
- MEASURING UNCERTAINTY IN ROUGH SET THEORY
- Reduction algorithms based on discernibility matrix: The ordered attributes method
- Using rough sets with heuristics for feature selection
This page was built for publication: Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation