By Topic

A Global Discretization and Attribute Reduction Algorithm Based on K-Means Clustering and Rough Sets Theory

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)
Hu Min ; Sch. of Manage. & Econ., Beijing Inst. of Technol., Beijing, China

The knowledge reduction function of rough sets theory is specific on discrete data, while most attributes of decision tables are continuous. Therefore a global discretization and attribute reduction algorithm is proposed based on clustering and rough sets theory. After comparing different discretization methods, the k-means clustering algorithm is used. In order to avoid the shortcomings of k-means clustering algorithm, the F-analysis of variance statistics and support strength of condition attributes are introduced to control the discretization effectiveness. A rational clustering number is derived according to the dependency index to meet the prerequisite of the rough set theory. After that, the attributes are reduced by using rough set theory, and decision rules are induced. Lastly an example is proposed to illustrate the feasibility and effectiveness of the algorithm.

Published in:

Knowledge Acquisition and Modeling, 2009. KAM '09. Second International Symposium on  (Volume:2 )

Date of Conference:

Nov. 30 2009-Dec. 1 2009