{"url":"/method/k-means-clustering","slug":"k-means-clustering","name":"k-Means Clustering","full_name":"k-Means Clustering","full_name_withheld":false,"description_markdown":"**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 {$\\mu\\left(1\\right),\\ldots,\\mu\\left(k\\right)$} to different values, then alternating between two steps until convergence:\r\n\r\n(i) each training example is assigned to cluster $i$ where $i$ is the index of the nearest centroid $\\mu^{(i)}$\r\n\r\n(ii) each centroid $\\mu^{(i)}$ is updated to the mean of all training examples $x^{(j)}$ assigned to cluster $i$.\r\n\r\nText Source: Deep Learning, Goodfellow et al\r\n\r\nImage Source: [scikit-learn](https://scikit-learn.org/stable/auto_examples/cluster/plot_kmeans_digits.html)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"code_snippet_url_withheld":"host listed as spam","categories":[{"area":"General","area_id":"general","collection":"Clustering","url":"/methods/category/clustering","pwc_aliases":[]}],"n_papers_tagged":772,"archive_num_papers":772,"papers_newest_first":[{"paper":null,"title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","date":"2025-06-29","arxiv_id":"2506.23266","n_code_links":0,"syntology":null},{"paper":null,"title":"Improved seeding strategies for k-means and k-GMM","date":"2025-06-26","arxiv_id":"2506.21291","n_code_links":0,"syntology":null},{"paper":"/paper/hercules-hierarchical-embedding-based","title":"HERCULES: Hierarchical Embedding-based Recursive Clustering Using LLMs for Efficient Summarization","date":"2025-06-24","arxiv_id":"2506.19992","n_code_links":1,"syntology":null},{"paper":null,"title":"A Study of Dynamic Stock Relationship Modeling and S&P500 Price Forecasting Based on Differential Graph Transformer","date":"2025-06-23","arxiv_id":"2506.18717","n_code_links":0,"syntology":null},{"paper":null,"title":"Pattern-Based Phase-Separation of Tracer and Dispersed Phase Particles in Two-Phase Defocusing Particle Tracking Velocimetry","date":"2025-06-22","arxiv_id":"2506.18157","n_code_links":0,"syntology":null},{"paper":"/paper/yolov11-rgbt-towards-a-comprehensive-single","title":"YOLOv11-RGBT: Towards a Comprehensive Single-Stage Multispectral Object Detection Framework","date":"2025-06-17","arxiv_id":"2506.14696","n_code_links":1,"syntology":null},{"paper":null,"title":"Advanced fraud detection using machine learning models: enhancing financial transaction security","date":"2025-06-12","arxiv_id":"2506.10842","n_code_links":0,"syntology":null},{"paper":null,"title":"Gradient-Based Model Fingerprinting for LLM Similarity Detection and Family Classification","date":"2025-06-02","arxiv_id":"2506.01631","n_code_links":0,"syntology":null},{"paper":null,"title":"A Computational Approach to Improving Fairness in K-means Clustering","date":"2025-05-29","arxiv_id":"2505.22984","n_code_links":0,"syntology":null},{"paper":null,"title":"M-learner:A Flexible And Powerful Framework To Study Heterogeneous Treatment Effect In Mediation Model","date":"2025-05-23","arxiv_id":"2505.17917","n_code_links":0,"syntology":null},{"paper":null,"title":"Mitigating Subgroup Disparities in Multi-Label Speech Emotion Recognition: A Pseudo-Labeling and Unsupervised Learning Approach","date":"2025-05-20","arxiv_id":"2505.14449","n_code_links":0,"syntology":null},{"paper":null,"title":"Multi-Robot Task Allocation for Homogeneous Tasks with Collision Avoidance via Spatial Clustering","date":"2025-05-15","arxiv_id":"2505.10073","n_code_links":0,"syntology":null},{"paper":null,"title":"Contextual Phenotyping of Pediatric Sepsis Cohort Using Large Language Models","date":"2025-05-14","arxiv_id":"2505.09805","n_code_links":0,"syntology":null},{"paper":null,"title":"Fair Clustering via Alignment","date":"2025-05-14","arxiv_id":"2505.09131","n_code_links":0,"syntology":null},{"paper":null,"title":"A portable diagnosis model for Keratoconus using a smartphone","date":"2025-05-13","arxiv_id":"2505.08616","n_code_links":0,"syntology":null},{"paper":"/paper/few-shot-novel-category-discovery","title":"Few-shot Novel Category Discovery","date":"2025-05-13","arxiv_id":"2505.08260","n_code_links":1,"syntology":null},{"paper":"/paper/high-frequency-prior-driven-adaptive-masking","title":"High-Frequency Prior-Driven Adaptive Masking for Accelerating Image Super-Resolution","date":"2025-05-11","arxiv_id":"2505.06975","n_code_links":1,"syntology":null},{"paper":null,"title":"PaniCar: Securing the Perception of Advanced Driving Assistance Systems Against Emergency Vehicle Lighting","date":"2025-05-08","arxiv_id":"2505.05183","n_code_links":0,"syntology":null},{"paper":null,"title":"Lightweight Trustworthy Distributed Clustering","date":"2025-04-14","arxiv_id":"2504.10109","n_code_links":0,"syntology":null},{"paper":null,"title":"Polyspectral Mean based Time Series Clustering of Indian Stock Market","date":"2025-04-09","arxiv_id":"2504.07021","n_code_links":0,"syntology":null},{"paper":null,"title":"Comparative analysis of unsupervised clustering techniques using validation metrics: Study on cognitive features from the Canadian Longitudinal Study on Aging (CLSA)","date":"2025-04-07","arxiv_id":"2504.12270","n_code_links":0,"syntology":null},{"paper":null,"title":"A Proposed Hybrid Recommender System for Tourism Industry in Iraq Using Evolutionary Apriori and K-means Algorithms","date":"2025-04-01","arxiv_id":"2504.08767","n_code_links":0,"syntology":null},{"paper":null,"title":"Comparison between neural network clustering, hierarchical clustering and k-means clustering: Applications using fluidic lenses","date":"2025-03-28","arxiv_id":"2503.22448","n_code_links":0,"syntology":null},{"paper":null,"title":"Comparative analysis of clustering methods for power delay profile in MMW bands and in-vehicle scenarios","date":"2025-03-26","arxiv_id":"2503.20358","n_code_links":0,"syntology":null},{"paper":null,"title":"Clustering Analysis of Long-term Cardiovascular Complications in COVID-19 Patients","date":"2025-03-23","arxiv_id":"2504.00007","n_code_links":0,"syntology":null},{"paper":"/paper/event-based-crossing-dataset-ebcd","title":"Event-Based Crossing Dataset (EBCD)","date":"2025-03-21","arxiv_id":"2503.17499","n_code_links":1,"syntology":null},{"paper":null,"title":"Stabilization Analysis and Mode Recognition of Kerosene Supersonic Combustion: A Deep Learning Approach Based on Res-CNN-beta-VAE","date":"2025-03-17","arxiv_id":"2503.12765","n_code_links":0,"syntology":null},{"paper":"/paper/deepnuparc-a-novel-deep-clustering-framework","title":"DeepNuParc: A Novel Deep Clustering Framework for Fine-scale Parcellation of Brain Nuclei Using Diffusion MRI Tractography","date":"2025-03-10","arxiv_id":"2503.07263","n_code_links":1,"syntology":null},{"paper":null,"title":"Matrix Factorization for Inferring Associations and Missing Links","date":"2025-03-06","arxiv_id":"2503.04680","n_code_links":0,"syntology":null},{"paper":null,"title":"Bisecting K-Means in RAG for Enhancing Question-Answering Tasks Performance in Telecommunications","date":"2025-02-27","arxiv_id":"2502.20188","n_code_links":0,"syntology":null}],"papers_shown":30,"tasks":[{"task":"/task/clustering","name":"Clustering","papers":353},{"task":"/task/object-detection","name":"Object Detection","papers":162},{"task":"/task/object-detection-1","name":"object-detection","papers":150},{"task":"/task/object","name":"Object","papers":84},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":41},{"task":"/task/segmentation","name":"Segmentation","papers":39},{"task":"/task/classification","name":"General Classification","papers":36},{"task":"/task/classification-1","name":"Classification","papers":34},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":26},{"task":"/task/image-classification","name":"Image Classification","papers":24},{"task":"/task/image-classification","name":"image-classification","papers":23},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":21},{"task":"/task/deep-learning","name":"Deep Learning","papers":21},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":20},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":19},{"task":"/task/quantization","name":"Quantization","papers":19},{"task":"/task/real-time-object-detection","name":"Real-Time Object Detection","papers":18},{"task":null,"name":"GPU","papers":17},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":17},{"task":"/task/time-series-1","name":"Time Series","papers":17}],"tasks_shown":20,"n_tasks":446,"usage_by_year":[{"year":"2006","papers":1},{"year":"2010","papers":1},{"year":"2011","papers":1},{"year":"2013","papers":5},{"year":"2014","papers":6},{"year":"2015","papers":15},{"year":"2016","papers":23},{"year":"2017","papers":20},{"year":"2018","papers":27},{"year":"2019","papers":61},{"year":"2020","papers":102},{"year":"2021","papers":115},{"year":"2022","papers":131},{"year":"2023","papers":110},{"year":"2024","papers":101},{"year":"2025","papers":53}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/k-means-clustering"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}