scientific article; zbMATH DE number 2157024

zbMATH Open1066.68029MaRDI QIDQ4669587FDOQ4669587

Authors Zhi Tao, Baodong Xu, C. Y. Zhao

Publication date 15 April 2005

zbMATH Keywords

rough set theorydiscernibility matrixdecision table

Mathematics Subject Classification ID

Data structures (68P05) Knowledge representation (68T30)

Recommendations

• Efficient attribute reduction from the viewpoint of discernibility
• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
• The Attribute Reductions Based on Indiscernibility and Discernibility Relations
• Analysis on a new discernibility function and proof about attribute reduction based on granular computing
• Attribute reduction in formal contexts based on a new discernibility matrix
• A relational perspective of attribute reduction in rough set-based data analysis
• A core algorithm of attribute sets based on the discernibility matrix
• scientific article; zbMATH DE number 6907507

Cited in

(7)

• Minimal attribute reduction in a decision table based on power set tree
• The Attribute Reductions Based on Indiscernibility and Discernibility Relations
• scientific article; zbMATH DE number 6178413 (Why is no real title available?)
• Analysis of alternative objective functions for attribute reduction in complete decision tables
• scientific article; zbMATH DE number 2222711 (Why is no real title available?)
• The M-Relative Reduct Problem
• On the time complexity of the problem related to reducts of consistent decision tables

This page was built for publication:

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