A MODIFIED K-MEANS APPROACH FOR EFFECTIVE CLUSTERING USING WEIGHTED ADJACENT MATRIX

K-means clustering has several limitations, such as sensitivity to initialization and determining the number of clusters. It is sensitive to outliers, especially when identifying clusters with irregular shapes or varying sizes. Handling categorical data directly in k-means can be challenging. This study aims to present methods to improve the existing k-means clustering algorithms. It proposes designing two distinct proximity matrices for this purpose. The study suggests that the new algorithm performs better than traditional clustering methods based on several evaluation metrics. Randomly chosen centroids lead to unstable outcomes. The unpredictable initialization of centroids makes it difficult to replicate clustering results. Spectral clustering begins by creating a similarity matrix, followed by eigenvalue decomposition applied to the Laplacian matrix. This decomposition results in a spectral representation. However, optimal clustering outcomes cannot be guaranteed in the initial stage of the spectral clustering algorithm. This research proposes a solution to this issue. An Initialization & Similarity approach is recommended, where both the representation and the similarity matrix are determined in a cohesive manner. Additionally, it improves clustering performance by using sum of norms regularization. Based on evaluation metrics, this clustering technique proves to be better than the original k-means algorithm. Using normalized mutual information, purity, and accuracy as measures, the proposed technique demonstrates superiority over traditional algorithms. This study presents a novel approach to K-Means clustering by integrating a weighted adjacent matrix, significantly enhancing clustering accuracy and effectively handling high-dimensional data. The proposed methods, KM-AM and KM-WAM, show improved performance metrics such as normalized mutual information, accuracy, and purity, offering a more efficient and robust solution for various data analysis applications.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-15
DOI
https://doi.org/10.5281/zenodo.16964171
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A MODIFIED K-MEANS APPROACH FOR EFFECTIVE CLUSTERING USING WEIGHTED ADJACENT MATRIX

Zenodo (CERN European Organization for Nuclear Research)
Geochemistry and Geologic Mapping
article

A MODIFIED K-MEANS APPROACH FOR EFFECTIVE CLUSTERING USING WEIGHTED ADJACENT MATRIX

article en

Abstract

K-means clustering has several limitations, such as sensitivity to initialization and determining the number of clusters. It is sensitive to outliers, especially when identifying clusters with irregular shapes or varying sizes. Handling categorical data directly in k-means can be challenging. This study aims to present methods to improve the existing k-means clustering algorithms. It proposes designing two distinct proximity matrices for this purpose. The study suggests that the new algorithm performs better than traditional clustering methods based on several evaluation metrics. Randomly chosen centroids lead to unstable outcomes. The unpredictable initialization of centroids makes it difficult to replicate clustering results. Spectral clustering begins by creating a similarity matrix, followed by eigenvalue decomposition applied to the Laplacian matrix. This decomposition results in a spectral representation. However, optimal clustering outcomes cannot be guaranteed in the initial stage of the spectral clustering algorithm. This research proposes a solution to this issue. An Initialization & Similarity approach is recommended, where both the representation and the similarity matrix are determined in a cohesive manner. Additionally, it improves clustering performance by using sum of norms regularization. Based on evaluation metrics, this clustering technique proves to be better than the original k-means algorithm. Using normalized mutual information, purity, and accuracy as measures, the proposed technique demonstrates superiority over traditional algorithms. This study presents a novel approach to K-Means clustering by integrating a weighted adjacent matrix, significantly enhancing clustering accuracy and effectively handling high-dimensional data. The proposed methods, KM-AM and KM-WAM, show improved performance metrics such as normalized mutual information, accuracy, and purity, offering a more efficient and robust solution for various data analysis applications.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 63%
Geochemistry and Geologic Mapping
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.