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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Binary variable extraction using nonlinear principal component analysis in classical location model
by: Long, Mei Mei
Published: (2016) -
Improved k-means clustering using principal component analysis and imputation methods for breast cancer dataset
by: Armina, Roslan
Published: (2018) -
Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares
by: Uraibi, Hassan Sami
Published: (2009) -
Customer segmentation using clustering techniques / Mohamad Amir Salihin Mustafa
by: Mustafa, Mohamad Amir Salihin
Published: (2024) -
The principals and concepts of Thai classical medicine /
by: Somchintana Thongthew-Ratarasarn
Published: (1986)