Research article · 27 Jul 2015
Conference abstractPublished 2017
A complementary square-error clustering criterion and initialization of K-means
Higher School of Economics, Russia Birkbeck University of London, UK
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
Computer Science & ITEngineeringAsk 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
Research article · Sep 2014
Moving Fuzzy K-Means Conventional Clustering Algorithms for Microscopic Images
Research article · Mar 2014
Brain Tumor Segmentation Using K-Means Clustering And Fuzzy C-Means Algorithms And Its Area Calculation
Research article · Oct 2013
An Efficient Numerical Methods for the Prediction of Clusters using K-means Algorithm with Bisection method for Comparing Uniform and Random Distribution Data Points
Research article · Jun 2013
IMAGE COMPRESSION USING K-MEANS CLUSTERING AND NUCLEAR MEDICINE IMAGE PROCESSING
More from this journal
The newest in Journal of Computer Engineering & Information Technology.
Review article · 27 Oct 2025
Dukan Daari Inventory Management System
Research article · 17 Jun 2025
Leveraging Information Flow Tracking for Enhanced Security in Cloud Computing
Editorial · 31 Mar 2025
Low-Code/No-Code Platforms: Democratizing Software Development
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Computer Engineering & Information Technology
- SubjectComputer Science & IT
- SubjectEngineering
- BylineArticles whose byline prints “Boris Mirkin”

