A novel rough set attribute reduction based on ant colony optimisation Online publication date: Fri, 22-Jan-2016
by P. Ravi Kiran Varma; V. Valli Kumari; S. Srinivas Kumar
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 14, No. 3/4, 2015
Abstract: Rough Sets (RS), the most promising and proven approach for data reduction, has the ability to retain the essence of the data and it does not expect any domain inputs from an expert. RS based reduction however can attain only local minima, so to elaborate the search space it is wise to employ well known and proven artificial intelligence techniques like the ant colony optimisation (ACO). In this work a novel rough set attribute reduction based on ACO, called as NRSACO is proposed, which can identify global optimal attribute set with the help of rough set based mutual information as a heuristic aid for the ants. Few improvements were suggested through which minimum reducts were attained faster and with fewer ants and iterations. Experiments were conducted on 22 UCI datasets, and the results shows that our approach has outperformed in convergence time with comparable or improved classification accuracies.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook