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...
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 |
Similar Items
-
The performance of k-means clustering method based on robust principal components
by: Kadom, Ahmed, et al.
Published: (2018) -
Improving cluster detection of functional microarray data using principal component analysis and clustering approach /
by: Nies, Hui Wen, author, et al.
Published: (2014) -
Improving cluster detection of functional microarray data using principal component analysis and clustering approach [electronic resource] /
by: Nies, Hui Wen, author
Published: (2014) -
On Robustness of Principal Component Regression
by: Agarwal, Anish, et al.
Published: (2022) -
An efficient robust hyperheuristic clustering algorithm /
by: Mohammad Babrdel Bonab, 1982-, author, et al.
Published: (2016)