Finding minimal reduct with binary integer programming in data mining

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

The search for the minimum size of reduct is based on the assumption that within the dataset, there are attributes that are more important than the rest. In this paper we present an algorithm in finding minimum size reducts which is based on rough set approach and a dedicated decision related binary integer programming (BIP) algorithm. The algorithm transforms an equivalence class obtained from a decision system into a BIP model. An algorithm for solving the BIP is given. The presented work has link to rough set theory, data mining and non-monotonic reasoning.

Original languageEnglish
Title of host publicationIEEE Region 10 Annual International Conference, Proceedings/TENCON
Volume3
Publication statusPublished - 2000
Externally publishedYes
Event2000 TENCON Proceedings - Kuala Lumpur, Malaysia
Duration: 24 Sep 200027 Sep 2000

Other

Other2000 TENCON Proceedings
CityKuala Lumpur, Malaysia
Period24/9/0027/9/00

Fingerprint

Integer programming
Data mining
Equivalence classes
Rough set theory

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Abu Bakar, A., Sulaiman, M. N., Othman, M., & Selamat, M. H. (2000). Finding minimal reduct with binary integer programming in data mining. In IEEE Region 10 Annual International Conference, Proceedings/TENCON (Vol. 3)

Finding minimal reduct with binary integer programming in data mining. / Abu Bakar, Azuraliza; Sulaiman, Md Nasir; Othman, Mohamed; Selamat, Mohd Hasan.

IEEE Region 10 Annual International Conference, Proceedings/TENCON. Vol. 3 2000.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abu Bakar, A, Sulaiman, MN, Othman, M & Selamat, MH 2000, Finding minimal reduct with binary integer programming in data mining. in IEEE Region 10 Annual International Conference, Proceedings/TENCON. vol. 3, 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, 24/9/00.
Abu Bakar A, Sulaiman MN, Othman M, Selamat MH. Finding minimal reduct with binary integer programming in data mining. In IEEE Region 10 Annual International Conference, Proceedings/TENCON. Vol. 3. 2000
Abu Bakar, Azuraliza ; Sulaiman, Md Nasir ; Othman, Mohamed ; Selamat, Mohd Hasan. / Finding minimal reduct with binary integer programming in data mining. IEEE Region 10 Annual International Conference, Proceedings/TENCON. Vol. 3 2000.
@inproceedings{d841e6b73dd84f8a8571e985e3f3cae7,
title = "Finding minimal reduct with binary integer programming in data mining",
abstract = "The search for the minimum size of reduct is based on the assumption that within the dataset, there are attributes that are more important than the rest. In this paper we present an algorithm in finding minimum size reducts which is based on rough set approach and a dedicated decision related binary integer programming (BIP) algorithm. The algorithm transforms an equivalence class obtained from a decision system into a BIP model. An algorithm for solving the BIP is given. The presented work has link to rough set theory, data mining and non-monotonic reasoning.",
author = "{Abu Bakar}, Azuraliza and Sulaiman, {Md Nasir} and Mohamed Othman and Selamat, {Mohd Hasan}",
year = "2000",
language = "English",
volume = "3",
booktitle = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

}

TY - GEN

T1 - Finding minimal reduct with binary integer programming in data mining

AU - Abu Bakar, Azuraliza

AU - Sulaiman, Md Nasir

AU - Othman, Mohamed

AU - Selamat, Mohd Hasan

PY - 2000

Y1 - 2000

N2 - The search for the minimum size of reduct is based on the assumption that within the dataset, there are attributes that are more important than the rest. In this paper we present an algorithm in finding minimum size reducts which is based on rough set approach and a dedicated decision related binary integer programming (BIP) algorithm. The algorithm transforms an equivalence class obtained from a decision system into a BIP model. An algorithm for solving the BIP is given. The presented work has link to rough set theory, data mining and non-monotonic reasoning.

AB - The search for the minimum size of reduct is based on the assumption that within the dataset, there are attributes that are more important than the rest. In this paper we present an algorithm in finding minimum size reducts which is based on rough set approach and a dedicated decision related binary integer programming (BIP) algorithm. The algorithm transforms an equivalence class obtained from a decision system into a BIP model. An algorithm for solving the BIP is given. The presented work has link to rough set theory, data mining and non-monotonic reasoning.

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

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

M3 - Conference contribution

AN - SCOPUS:0034430724

VL - 3

BT - IEEE Region 10 Annual International Conference, Proceedings/TENCON

ER -