Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Bakar, Azuraliza Abu | Sulaiman, Md Nasir | Othman, Mohamed | Selamat, Mohd Hasan
Affiliations: Faculty of Computer Science and Information Technology, University Putra Malaysia, 43400 Serdang, Selangor, Malaysia
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.
Keywords: rough set, reduct, integer programming (IP), decision system (DS)
DOI: 10.3233/IDA-2001-5505
Journal: Intelligent Data Analysis, vol. 5, no. 5, pp. 419-429, 2001
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]