Cart (Loading....) | Create Account
Close category search window

A framework of rough reducts optimization based on PSO/ACO hybridized algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pratiwi, L. ; Fac. of Inf. & Commun. Technol., Univ. Teknikal Malaysia Melaka (UTeM), Durian Tunggal, Malaysia ; Yun-Huoy Choo ; Muda, A.K.

Rough reducts has contributed significantly in numerous researches of feature selection analysis. It has been proven as a reliable reduction technique in identifying the importance of attributes set in an information system. The key factor for the success of reducts calculation in finding minimal reduct with minimal cardinality of attributes is an NP-Hard problem. This paper has proposed an improved PSO/ACO optimization framework to enhance rough reduct performance by reducing the computational complexities. The proposed framework consists of a three-stage optimization process, i.e. global optimization with PSO, local optimization with ACO and vaccination process on discernibility matrix.

Published in:

Data Mining and Optimization (DMO), 2011 3rd Conference on

Date of Conference:

28-29 June 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.