Citation
Bakar, Azuraliza Abu and Sulaiman, Md Nasir and Othman, Mohamed and Selamat, Mohd Hasan
(2001)
IP algorithms in compact rough classification modeling.
Intelligent Data Analysis, 5 (5).
pp. 419-429.
ISSN 1571-4128; eISSN: 1088-467X
Abstract
The paper presents the Integer Programming (IP) algorithms in mining a compact rough classification model. The algorithm is based on creating a 0-1 integer programming model from a rough discernibility relations of a decision system (DS) to find minimum selection of important attributes which is called reduct in rough set theory. A branch and bound search strategy that performs a non-chronological backtracking is proposed to solve the problem. The experimental result shows that the proposed IP algorithm has significantly reduced the number of rules generated from the obtained reducts with high percentage of classification accuracy. The branch and bound search strategy has shown reduction in certain amount of search.
Download File
Official URL or Download Paper: https://journals.sagepub.com/doi/full/10.3233/IDA-...
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Computer Science and Information Technology |
DOI Number: | https://doi.org/10.3233/ida-2001-5505 |
Publisher: | SAGE Publications |
Keywords: | Decision System (DS); Integer Programming (IP); Reduct; Rough set |
Depositing User: | Ms. Nuraida Ibrahim |
Date Deposited: | 19 Mar 2025 03:44 |
Last Modified: | 19 Mar 2025 03:44 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3233/ida-2001-5505 |
URI: | http://psasir.upm.edu.my/id/eprint/116064 |
Statistic Details: | View Download Statistic |
Actions (login required)
![]() |
View Item |