K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets
Data clustering is an unsupervised classification method aimed at creating groups of objects, or clusters that are distinct. Among the clustering techniques, Kmeans is the most widely used technique. Two issues are prominent in creating a Kmeans clustering algorithm; the optimal number of clusters a...
Saved in:
Main Author: | Usman, Dauda |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/77643/1/DaudaUsmanPFS2014.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm
by: Dalatu, Paul Inuwa
Published: (2018) -
RTL implementation of one-sided jacobi algorithm for singular value decomposition
by: Wan Mohamad, Wan Ahmad Zainie
Published: (2016) -
Enhancement of parallel K-means algorithm for clustering big datasets
by: Ashabi, Ardavan
Published: (2022) -
Location and tracking of sources through preprocessing and eigen-decomposition /
by: Ho, Hock Beng
Published: (1996) -
Imputation of incomplete software metric database using hybrid of nearest neighbour and modified singular value decomposition (NN-MSVD) algorithm /
by: Olanrewaju, Rashidah Funke
Published: (2006)