An intelligent weighted kernel K-means algorithm for high dimension data
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,...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Book Section |
| Published: |
Institute of Electrical and Electronics Engineers
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/12985/ http://dx.doi.org/10.1109/ICADIWT.2009.5273893 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Summary: | 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.
|
|---|