Tagged articles
K-Means
14 articles · Page 1 of 1
Meta FAIR's e-means algorithm redesigns K-Means using exponential moving averages, dead cluster revival, cosine annealing, and scaling laws to achieve up to 45.5x GPU speedup over traditional Lloyd's algorithm, matching or exceeding clustering quality in just 2-3 epochs on billion-scale vector datasets, with code integrated into Faiss.
FaissK-MeansMeta FAIR
0 likes · 13 min read

Flash‑KMeans is a newly proposed framework that re‑designs exact K‑Means for GPUs by eliminating distance‑matrix materialization, using FlashAssign’s online argmin and Sort‑Inverse Update to cut memory bandwidth and atomic‑write contention, achieving up to 12.5× speedup and dramatically lower VRAM usage on billion‑point datasets.
FlashAssignGPUK-Means
0 likes · 23 min read

This comprehensive guide explores the K‑Means clustering algorithm, covering its mathematical foundation, step‑by‑step procedure, centroid initialization strategies, practical implementation with Python’s Scikit‑learn on the Iris dataset, evaluation metrics, optimization techniques, and diverse applications ranging from image segmentation to bioinformatics.
AlgorithmK-MeansPython
0 likes · 31 min read

This article introduces unsupervised learning, covering its motivation, Jensen's inequality, key clustering methods such as EM, k‑means, hierarchical clustering, evaluation metrics, and dimensionality‑reduction techniques like PCA and ICA, providing clear explanations and illustrative diagrams.
EM algorithmICAK-Means
0 likes · 8 min read

The article describes a root‑cause localization algorithm implemented in vivo’s monitoring platform that automatically analyzes latency spikes by splitting service timelines, computing variance, clustering results with K‑means, and recursively tracing downstream services, achieving over 85 % accuracy for dependency failures while still requiring human verification and outlining future AI‑driven enhancements.
AIOpsK-MeansRoot Cause Analysis
0 likes · 13 min read

This guide introduces SciPy's clustering modules, explaining the vector quantization and k‑means algorithm in scipy.cluster.vq, and demonstrates hierarchical clustering with scipy.cluster.hierarchy, accompanied by complete Python code examples and visualizations to help you apply these techniques to real data.
K-Meansclusteringhierarchical clustering
0 likes · 4 min read

K-means is a classic distance‑based clustering algorithm that iteratively partitions data into k compact, well‑separated groups by minimizing the sum of squared errors, using random centroid initialization and heuristic updates until convergence, making it a fundamental tool in AI and data analysis.
AlgorithmK-MeansUnsupervised Learning
0 likes · 3 min read

This article introduces the k‑means clustering algorithm and its major variants—k‑means++, k‑medoids, k‑medians, k‑modes, and k‑prototype—explaining their characteristics, step‑by‑step procedures, and provides a practical R implementation with code examples for data analysis.
K-MeansRclustering
0 likes · 11 min read

This article introduces a concise Python implementation of the k‑means clustering algorithm, compares its speed with a typical implementation, provides full source code, a data‑generation helper, and demonstrates the results on a synthetic dataset of 10,000 points.
K-Meansmachine learningperformance
0 likes · 8 min read

This article explains how WeBank’s intelligent operations team combines LSTM‑based forecasting with Gaussian analysis, k‑means feature clustering, and probability‑density modeling to automatically detect and warn about anomalies in key business metrics, moving beyond traditional threshold‑based monitoring.
AIOpsK-MeansLSTM
0 likes · 9 min read

This article explains how to apply TF‑IDF weighting and the K‑means clustering algorithm in Python to identify a small set of representative regression cases from hundreds of thousands of production request records, including guidance on selecting the optimal number of clusters.
K-MeansTF-IDFclustering
0 likes · 5 min read

This tutorial walks you through installing Anaconda, introduces essential Python data‑science packages, explains clustering versus classification, details the K‑means algorithm, and demonstrates a complete K‑means analysis on a basketball player dataset using Python code and visualizations.
BasketballK-MeansPython
0 likes · 12 min read

This guide explains how to use Transwarp Discover's rJava one‑stop feature to develop, package, and share custom Java/Scala machine‑learning algorithms—such as an improved K‑Means clustering—alongside built‑in libraries, enabling seamless integration and scalable data mining within the platform.
JavaK-MeansScala
0 likes · 6 min read

This article details how telecom operators can identify fraudulent ModemPOOL (cat‑pool) terminals and predict churn using data‑driven clustering and day‑interval warning models, covering metric selection, data exploration, k‑means clustering, model deployment, and performance evaluation.
K-MeansRFMchurn prediction
0 likes · 18 min read
