Improved Clustering with Augmented k-means
Identifying a set of homogeneous clusters in a heterogeneous dataset is one of the most important classes of problems in statistical modeling. In the realm of unsupervised partitional clustering, k-means is a very important algorithm for this. In this technical report, we develop a new k-means variant called Augmented k-means, which is a hybrid of k-means and logistic regression. During each iteration, logistic regression is used to predict the current cluster labels, and the cluster belonging probabilities are used to control the subsequent re-estimation of cluster means. Observations which can't be firmly identified into clusters are excluded from the re-estimation step. This can be valuable when the data exhibit many characteristics of real datasets such as heterogeneity, non-sphericity, substantial overlap, and high scatter. Augmented k-means frequently outperforms k-means by more accurately classifying observations into known clusters and / or converging in fewer iterations. We demonstrate this on both simulated and real datasets. Our algorithm is implemented in Python and will be available with this report.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Improved Learning-augmented Algorithms for k-means and k-medians Clustering
We consider the problem of clustering in the learning-augmented setting, where we are given a data set in $d$-dimensional Euclidean space, and a label for each data point given by an oracle indicating what subsets of poi…
ClusteringLearning-Augmented $k$-means Clustering
$k$-means clustering is a well-studied problem due to its wide applicability. Unfortunately, there exist strong theoretical limits on the performance of any algorithm for the $k$-means problem on worst-case inputs. To ov…
ClusteringK-means Algorithm Based on Improved Density Peak Algorithm
Abstract：The initial clustering centers and the number Of clusters need to be selected manually in traditional K—means al— gorithm，SO the result of clustering is unstable and easy to fall into local optimal solution．To …
ClusteringImprovement of K Mean Clustering Algorithm Based on Density
The purpose of this paper is to improve the traditional K-means algorithm. In the traditional K mean clustering algorithm, the initial clustering centers are generated randomly in the data set. It is easy to fall into th…
ClusteringBisecting K-Means in RAG for Enhancing Question-Answering Tasks Performance in Telecommunications
Question-answering tasks in the telecom domain are still reasonably unexplored in the literature, primarily due to the field's rapid changes and evolving standards. This work presents a novel Retrieval-Augmented Generati…
ClusteringInformation RetrievalQuestion AnsweringRAG+2