A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A logic approach for reducing the computational complexity of the attribute reduction problem
2011
2011 5th International Conference on Application of Information and Communication Technologies (AICT)
The goal of attribute reduction is to find a minimal subset (MS) R of the condition attribute set C of a dataset such that R has the same classification power as C. It was proved that the number of MSs for a dataset with n attributes may be as large as ( n n/2 ) and the generation of all of them is an NP-hard problem. The main reason for this is the intractable space complexity of the conversion of the discernibility function (DF) of a dataset to the disjunctive normal form (DNF). Our analysis
doi:10.1109/icaict.2011.6111006
fatcat:qas7uvfaevfh3ibjus7j6g2hme