Methods › General › Clustering › k-Means Clustering

k-Means Clustering

772 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

k-Means Clustering is a clustering algorithm that divides a training set into k different clusters of examples that are near each other. It works by initializing k different centroids {μ(1),…,μ(k)} to different values, then alternating between two steps until convergence:

(i) each training example is assigned to cluster i where i is the index of the nearest centroid μ⁽ⁱ⁾

(ii) each centroid μ⁽ⁱ⁾ is updated to the mean of all training examples x⁽ʲ⁾ assigned to cluster i.

Text Source: Deep Learning, Goodfellow et al

Image Source: scikit-learn

The archive's code-snippet link for this entry is not shown: it points outside the code hosts this site links to, at a host listed as spam. It is counted among the archive links this site does not show.

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Learning-Augmented k-means Clustering; K-means clustering selection strategy; Uncertainty-aware K-means Clustering (UKC); Distributionally Robust K-Means Clustering; Shallow decision trees for explainable k-means clustering; latent-space selection scheme based on k-means clustering; nonnegative low-rank semidefinite programming-based K-means clustering algorithm; PE-means.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 772 · with a code link: 228 · where Syntology ran a sample: 34 (26 with a run with no instrument failure, 8 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (34 of 772 tagged: 26 with a run with no instrument failure, 8 where every run was a failure of Syntology's instrument)

Page 1 of 8: papers 1 to 100 of 772, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 446 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Clustering353
Object Detection162
object-detection150
Object84
Semantic Segmentation41
Segmentation39
General Classification36
Classification34
Autonomous Driving26
Image Classification24
image-classification23
BIG-bench Machine Learning21
Deep Learning21
Image Segmentation20
Data Augmentation19
Quantization19
Real-Time Object Detection18
GPU17
Self-Supervised Learning17
Time Series17

Usage over time archive 2025-07-28

Papers per year tagged with k-Means Clustering: 2006 to 2025, peak 131 131 0 2006: 1 paper 2006 2007: 0 papers 2008: 0 papers 2008 2009: 0 papers 2010: 1 paper 2010 2011: 1 paper 2012: 0 papers 2012 2013: 5 papers 2014: 6 papers 2014 2015: 15 papers 2016: 23 papers 2016 2017: 20 papers 2018: 27 papers 2018 2019: 61 papers 2020: 102 papers 2020 2021: 115 papers 2022: 131 papers 2022 2023: 110 papers 2024: 101 papers 2024 2025: 53 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (772 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Clustering

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections