Pages that link to "Item:Q541820"

The following pages link to Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation (Q541820):

Displayed 17 items.

• Entropy and co-entropy of a covering approximation space (Q448938) ‎ (← links)
• Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems (Q448946) ‎ (← links)
• Information-theoretic measures associated with rough set approximations (Q456453) ‎ (← links)
• Test cost sensitive multigranulation rough set: model and minimal cost selection (Q497637) ‎ (← links)
• Composite rough sets for dynamic data mining (Q498018) ‎ (← links)
• Parallel attribute reduction algorithms using MapReduce (Q506356) ‎ (← links)
• Quick general reduction algorithms for inconsistent decision tables (Q511631) ‎ (← links)
• Bidirectional heuristic attribute reduction based on conflict region (Q521640) ‎ (← links)
• Quick attribute reduct algorithm for neighborhood rough set model (Q726322) ‎ (← links)
• A fuzzy similarity-based rough set approach for attribute selection in set-valued information systems (Q781410) ‎ (← links)
• Efficient attribute reduction from the viewpoint of discernibility (Q1750425) ‎ (← links)
• Updating attribute reduction in incomplete decision systems with the variation of attribute set (Q2353994) ‎ (← links)
• Positive macroscopic approximation for fast attribute reduction (Q2375684) ‎ (← links)
• Attribute reduction for sequential three-way decisions under dynamic granulation (Q2409114) ‎ (← links)
• Covering-based multi-granulation fuzzy rough sets (Q2988441) ‎ (← links)
• Attribute Reduction of Incomplete Information Systems: An Intuitionistic Fuzzy Rough Set Approach (Q3297314) ‎ (← links)
• DYNAMIC REDUCTS GENERATION USING CASCADING HASHES (Q5495433) ‎ (← links)