Citation
Abstract
A fundamental problem in data mining is whether the whole information available is always necessary to represent the information system(TS). Reduct is a rough set approach in data mining that determines the set of important attributes to represent the IS. The search for minimal reduct is based on the assumption that within the dataset in an IS, there are attributes that are more important than the rest. An algorithm in finding minimal reducts based on Prepositional Satisfiability (SAT) algorithm is proposed. A branch and bound algorithm is presented to solve the proposed SAT problem. The experimental result shows that the proposed algorithm has significantly reduced the number of rules generated from the obtained reducts with high percentage of classification accuracy. © 2002 Taylor and Francis Ltd.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://www.tandfonline.com/doi/abs/10.1080/002071...
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Computer Science and Information Technology |
DOI Number: | https://doi.org/10.1080/00207160210938 |
Keywords: | Binary Integer Programming(BIP); Conjunctive Normal Forms (CNF); Data Mining; Prepositional Satisfiability (SAT); Reduct; Rough Set |
Depositing User: | Ms. Azian Edawati Zakaria |
Date Deposited: | 24 Mar 2025 04:50 |
Last Modified: | 24 Mar 2025 04:50 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1080/00207160210938 |
URI: | http://psasir.upm.edu.my/id/eprint/116270 |
Statistic Details: | View Download Statistic |
Actions (login required)
![]() |
View Item |