Internal-Cluster-Validation-Based Model Selection For k-Means Clustering

Clustering is an important data mining process that partitions the data points of an unlabeled dataset based on the similarities of the data points. The k-Means algorithm is a widely used clustering method. We propose a model selection method for k-Means clustering algorithm that identifies the number of optimal clusters and selects the suitable feature subset for better clustering of a dataset. For this purpose, we use internal cluster validation index called Sum of Euclidean Distances (SED). To make the SED Index produced by different feature subsets comparable, we preprocess the dataset and define a per feature SED Index. We generate the candidate feature subsets using a Genetic Algorithm and choose the feature subset that produces the minimum per feature SED Index. We use the per feature SED Index for determining the optimal number of clusters. We also propose a method for selecting initial centroids of the clusters for better clustering performance. We validate our proposed model selection method using Iris, Wine, and Seeds datasets from UCI Machine Learning Repository.

Authors

Institutions

Publication Details

Published
2024-11-06
DOI
https://doi.org/10.1109/icsec62781.2024.10770636
Citations
1
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Internal-Cluster-Validation-Based Model Selection For k-Means Clustering

Mozammel H. A. Khan
1 citations
Advanced Clustering Algorithms Research
0.35
article

Internal-Cluster-Validation-Based Model Selection For k-Means Clustering

Mozammel H. A. Khan
article en
1 citations

Abstract

Clustering is an important data mining process that partitions the data points of an unlabeled dataset based on the similarities of the data points. The k-Means algorithm is a widely used clustering method. We propose a model selection method for k-Means clustering algorithm that identifies the number of optimal clusters and selects the suitable feature subset for better clustering of a dataset. For this purpose, we use internal cluster validation index called Sum of Euclidean Distances (SED). To make the SED Index produced by different feature subsets comparable, we preprocess the dataset and define a per feature SED Index. We generate the candidate feature subsets using a Genetic Algorithm and choose the feature subset that produces the minimum per feature SED Index. We use the per feature SED Index for determining the optimal number of clusters. We also propose a method for selecting initial centroids of the clusters for better clustering performance. We validate our proposed model selection method using Iris, Wine, and Seeds datasets from UCI Machine Learning Repository.

East West University (BD)
Openalex Percentile: Top 31%
Advanced Clustering Algorithms Research
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Internal-Cluster-Validation-Based Model Selection For k-Means Clustering — Mozammel H. A. Khan · (2024) | TGRS Research Map | TGRS