Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Computer Engineering
K-Means Clustering Using Gravity Distance, Ajinkya Vishwas Indulkar
K-Means Clustering Using Gravity Distance, Ajinkya Vishwas Indulkar
Masters Theses & Specialist Projects
Clustering is an important topic in data modeling. K-means Clustering is a well-known partitional clustering algorithm, where a dataset is separated into groups sharing similar properties. Clustering an unbalanced dataset is a challenging problem in data modeling, where some group has a much larger number of data points than others. When a K-means clustering algorithm with Euclidean distance is applied to such data, the algorithm fails to form good clusters. The standard K-means tends to split data into smaller clusters during a clustering process evenly.
We propose a new K-means clustering algorithm to overcome the disadvantage by introducing a different …