Improving Indiscernibility Matrix Based Approach for Attribute Reduction

DOI10.1007/978-3-319-25754-9_11MaRDI QIDQ3300357zbMATH OpenOpenAlexFDO

Authors Piotr Hońko

Publication date 28 July 2020

Published in Rough Sets and Knowledge Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-25754-9_11

zbMATH Keywords

attribute reductionindiscernibility matrixrough sets

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• An increment algorithm for attribute reduction based on improvement of a discernibility matrix
• Discernibility matrix simplification for constructing attribute reducts
• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
• An incremental algorithm for attribute reduction based on a labeled discernibility matrix
• Complete algorithm of increment for attribute reduction based on discernibility matrix
• An algorithm for numerical attribute reduction based on discernibility matrix
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Efficient algorithm of attribute reduction based on Skowron's discernibility matrix

Cites work

• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Rough set approach to incomplete information systems

This page was built for publication: Improving Indiscernibility Matrix Based Approach for Attribute Reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300357)