Towards robust classifiers using optimal rule discovery
by Sahar M. Ghanem; Mona A. Mohamed; Magdy H. Nagi
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 6, No. 3, 2014

Abstract: A classification rule set is usually generated from history data to make predictions on future coming data that is usually not as complete as the training data. In this work, we provide a review of the robust rule-based optimal associate classifier (OAC) and its main building blocks. OAC is robust in the sense that it is able to make an accurate prediction when the future record is incomplete. OAC robustness is achieved by finding a larger classification rule set. We propose to initially transform the database to an item set tree (IST) data structure for efficient support-counting. Then, the optimal rule discovery (ORD) is adopted to mine the rules that are fed to OAC to select the classification rules from. Several experiments have been conducted to compare OAC classification accuracy and number of rules for a wide range of settings, and a classifier measure is introduced.

Online publication date: Thu, 23-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com