Improved clustering using robust and classical principal component
k-means algorithm is a popular data clustering algorithm. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. Finding the appropriate number of clusters for a given data set...
Saved in:
Main Author: | Hassn, Ahmed Kadom |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/70922/1/FS%202017%2047%20UPM.pdf http://psasir.upm.edu.my/id/eprint/70922/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The performance of k-means clustering method based on robust principal components
by: Kadom, Ahmed, et al.
Published: (2018) -
Improved cluster partition in principal component analysis guided clustering
by: Shaharudin, S. M., et al.
Published: (2013) -
Customer profiling using K-means clustering method / Nik Asyraniasna Nik Mohd Asri
by: Nik Mohd Asri, Nik Asyraniasna
Published: (2024) -
An efficient method to improve the clustering performance using hybrid robust principal component analysis-spectral biclustering in rainfall patterns identification
by: Shazlyn Milleana Shaharudin
Published: (2019) -
An efficient method to improve the clustering performance using hybrid robust principal component analysis-spectral biclustering in rainfall patterns identification
by: Shaharudin, S. M., et al.
Published: (2019)