Review article · Jun 2012
Conference abstractPublished 7 Sep 2017
A Complementary Square-Error Clustering Criterion and Initialization of K-Means
Higher School of Economics, Russia
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Clustering is a set of major data analysis techniques. The square-error clustering criterion underlies most popular clustering methods including k-means partitioning and Ward agglomeration. For the k-means, the square-error criterion to be minimized is the sum of squared Euclidean distances from all the objects to their respective cluster centers/means, W(S,c), where S is the sought partition of the set of objects and c is the set of within-cluster means. The method’s popularity stems from the simplicity of computation and interpretation. Yet there is a catch: the user is to specify both the number of clusters and the initial locations of cluster centers, which can be of an issue sometimes. To tackle the problem, the current author proposes using the complementary criterion. It is not difficult to prove that there is a complementary criterion, B(S,c), to be maximized, such that W(S,c)+B(S,c)=T where T is the data scatter. The complementary criterion B(S,c) is the sum of individual cluster contributions, equal each to the product of the cluster’s cardinality and the squared Euclidean distance from the cluster’s center to 0. Therefore, the complementary criterion leads to a set of anomalous clusters, which can be found either one-by-one or in parallel. Our experiments show that methods emerging in this perspective are competitive, and frequently superior, to other initialization methods.
Subjects
Alternative & Palliative CareAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Mini review · 26 Nov 2022
CT Images of Pyogenic and Amoebic Liver Abscess with K-Means Clustering: An Application of Image Processing In Medical Emergency
Short communication · 24 Jan 2022
Overcoming the heuristic nature of K-means clustering: Identification and characterization of binding modes from simulations of molecular recognition complexes
Editorial · 2021
Early-Stage Multiple Brain Tumor Detection and Localization Using A Hybrid Technique of Patch-Based Processing, K-Means Clustering, and Object Counting
Research article · 12 Dec 2018
A review on optimized K-means and FCM clustering techniques for biomedical image segmentation using level set formulation
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- SubjectAlternative & Palliative Care
- BylineArticles whose byline prints “Boris Mirkin”
