0 views collected around this technical thread.
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.
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.
This article explains the fundamentals of the K-means clustering algorithm, describing its distance‑based similarity principle, the objective of minimizing squared error, and a step‑by‑step iterative procedure—including random centroid initialization, assignment, centroid recomputation, and convergence criteria.
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.
This article explains essential machine‑learning evaluation concepts—including the bias‑variance trade‑off, Gini impurity versus entropy, precision‑recall curves, ROC and AUC, the elbow method for K‑means, PCA scree plots, linear and logistic regression, SVM geometry, normal‑distribution rules, and Student’s t‑distribution—providing clear visual illustrations for each.
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.
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.
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.
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.
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.