By Topic

Research on Feature Selection Algorithm Based on Mixed Model

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

1 Author(s)
Ming He ; Coll. of Comput. Sci., Beijing Univ. of Technol., Beijing

Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining. In this paper, we have studied the basic concepts of rough set theory, and discussed several special cases of the ant colony optimization metaheuristic algorithms. Based on the above study, we propose a feature selection algorithm within a mixed framework based on rough set theory and ant colony optimization. experimental results show that the algorithm of this paper is flexible for feature selection.

Published in:

Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on

Date of Conference:

20-22 Dec. 2008