Investigating memetic algorithm in solving rough set attribute reduction
by Majdi Mafarja; Salwani Abdullah
International Journal of Computer Applications in Technology (IJCAT), Vol. 48, No. 3, 2013

Abstract: Attribute reduction is the problem of selecting a minimal subset from the original set of attributes. Rough set theory has been used for attribute reduction with much success. Since it is well known that finding a minimal subset is a NP-hard problem; therefore, it is necessary to develop efficient algorithms to solve this problem. In this work, we propose a memetic algorithm-based approach inside the rough set theory which is a hybridisation of genetic algorithm and simulated annealing. The proposed method has been tested on UCI data sets. Experimental results demonstrate the effectiveness of this memetic approach when compared with previous available methods. Possible extensions upon this simple approach are also discussed.

Online publication date: Tue, 01-Oct-2013

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 Computer Applications in Technology (IJCAT):
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