An optimal and stable algorithm for clustering numerical data
In the conventional k-means framework, seeding is the first step toward optimization before the objects are clustered. In random seeding, two main issues arise: the clustering results may be less than optimal and different clustering results may be obtained for every run. In real-world applications,...
Published in: | Algorithms |
---|---|
Main Author: | Seman A.; Sapawi A.M. |
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85109399419&doi=10.3390%2fa14070197&partnerID=40&md5=28e9e298aa7e11e0021cdaf07826ebad |
Similar Items
-
Towards development of clustering applications for large-scale comparative genotyping and kinship analysis using Y-short tandem repeats
by: Seman A.; Sapawi A.M.; Salleh M.Z.
Published: (2015) -
An efficient clustering algorithm for partitioning Y-short tandem repeats data
by: Seman A.; Bakar Z.A.; Isa M.N.
Published: (2012) -
Evaluation of k-modes-type algorithms for clustering Y-short tandem repeats data
by: Seman A.; Bakar Z.A.; Isa M.N.
Published: (2012) -
A comparison study of clustering algorithms in grouping microarray data
by: Zin S.H.H.M.; Moktar B.
Published: (2024) -
Clustering the unlabeled data using a modified cat swarm optimization
by: Dewi D.A.; Kurniawan T.B.; Mohd Zakizakaria; Armoogum S.
Published: (2024)