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...
Main Author: | Usman, Dauda (Author) |
---|---|
Format: | Thesis |
Published: |
2014-12.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
CBIR based on singular value decomposition for non-overlapping blocks
by: M. Alamin, A. Rahman, et al.
Published: (2014) -
Colour image watermarking using discrete cosine transform and two-level singular value decomposition
by: Ali, Bokan Omar
Published: (2013) -
McKay quivers and terminal quotient singularities in dimension 3
by: Jung, Seung-Jo
Published: (2014) -
Improved k-means clustering using principal component analysis and imputation methods for breast cancer dataset
by: Armina, Roslan
Published: (2018) -
Mean-variance optimal portfolios for Lévy processes and a singular stochastic control model for capacity expansion
by: Pasos, Jose E.
Published: (2018)