IP algorithms in compact rough classification modeling

Azuraliza Abu Bakar, Md Nasir Sulaiman, Mohamed Othman, Mohd Hasan Selamat

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)419-429
Number of pages11
JournalIntelligent Data Analysis
Volume5
Issue number5
Publication statusPublished - 2001
Externally publishedYes

Fingerprint

Integer programming
Integer Programming
Rough
Reduct
Search Strategy
Branch-and-bound
Modeling
0-1 Integer Programming
Decision System
Rough set theory
Backtracking
Rough Set Theory
Programming Model
Percentage
Mining
Attribute
Experimental Results
Model

Keywords

  • decision system (DS)
  • integer programming (IP)
  • reduct
  • rough set

ASJC Scopus subject areas

  • Artificial Intelligence
  • Theoretical Computer Science
  • Computer Vision and Pattern Recognition

Cite this

Abu Bakar, A., Sulaiman, M. N., Othman, M., & Selamat, M. H. (2001). IP algorithms in compact rough classification modeling. Intelligent Data Analysis, 5(5), 419-429.

IP algorithms in compact rough classification modeling. / Abu Bakar, Azuraliza; Sulaiman, Md Nasir; Othman, Mohamed; Selamat, Mohd Hasan.

In: Intelligent Data Analysis, Vol. 5, No. 5, 2001, p. 419-429.

Research output: Contribution to journalArticle

Abu Bakar, A, Sulaiman, MN, Othman, M & Selamat, MH 2001, 'IP algorithms in compact rough classification modeling', Intelligent Data Analysis, vol. 5, no. 5, pp. 419-429.
Abu Bakar, Azuraliza ; Sulaiman, Md Nasir ; Othman, Mohamed ; Selamat, Mohd Hasan. / IP algorithms in compact rough classification modeling. In: Intelligent Data Analysis. 2001 ; Vol. 5, No. 5. pp. 419-429.
@article{ed97884d8dd945939db3e64020724d06,
title = "IP algorithms in compact rough classification modeling",
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 = "decision system (DS), integer programming (IP), reduct, rough set",
author = "{Abu Bakar}, Azuraliza and Sulaiman, {Md Nasir} and Mohamed Othman and Selamat, {Mohd Hasan}",
year = "2001",
language = "English",
volume = "5",
pages = "419--429",
journal = "Intelligent Data Analysis",
issn = "1088-467X",
publisher = "IOS Press",
number = "5",

}

TY - JOUR

T1 - IP algorithms in compact rough classification modeling

AU - Abu Bakar, Azuraliza

AU - Sulaiman, Md Nasir

AU - Othman, Mohamed

AU - Selamat, Mohd Hasan

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - decision system (DS)

KW - integer programming (IP)

KW - reduct

KW - rough set

UR - http://www.scopus.com/inward/record.url?scp=33645989000&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645989000&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33645989000

VL - 5

SP - 419

EP - 429

JO - Intelligent Data Analysis

JF - Intelligent Data Analysis

SN - 1088-467X

IS - 5

ER -