By Topic

An intelligent Weighted Kernel K-Means algorithm for high dimension data

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)
Kenari, A.R. ; Univ. Teknol. Malaysia, Malaysia ; Bin Maarof, M.A. ; Bin Md Sap, M.N. ; Shamsi, M.

Clustering is a kind of unsupervised classification of objects into groups so that objects from the same cluster are more similar to each other than objects from different clusters. In this paper, we focus on Weighted Kernel K-Means method for its capability to handle nonlinear separability, noise, outliers and high dimensionality in the data. A new WKM algorithm has been proposed and tested on real Rice data. the results exposed by algorithm encourage the use of WKM for the solution of real world problems.

Published in:

Applications of Digital Information and Web Technologies, 2009. ICADIWT '09. Second International Conference on the

Date of Conference:

4-6 Aug. 2009