By Topic

Continuous attribute discretization based on quantum PSO algorithm

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

4 Author(s)
Yue Chi ; Sch. of Inf. Eng., Hebei Univ. of Technol, Tianjin ; Yao Dong ; Kewen Xia ; Jin Shi

The discretization of continuous attributes is one of the main problems in rough sets theory. Because there are no uniform criterion for the selection of the cut-points set, the character of mathematic curve is considered and a new algorithm of continuous attribute discretization based on optimization is presented. In this algorithm, the set of candidate cut-points is obtained according to the property of curve inflection points, moreover, quantum particle swarm optimization (QPSO) algorithm is used to search and optimize the set of candidate cut-points. The continuous attribute discretization is complete and the experiment shows that the algorithm is feasible and effective.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008