IEEE

Beta k-Means: Accelerating k-Means Using Probabilistic Cluster Filtering

Abstract: Lloyd k-means is a widely used clustering algorithm. The Hamerly and Annulus algorithms are faster versions of the Lloyd k-means, employing the triangle inequality to skip unnecessary ...
GitHub

NodeSentry: Effective Node-Level Anomaly Detection in HPC Systems via Coarse-Grained Clustering and Fine-Grained Model Sharing

The framework encompasses two principal phases: the offline model training phase and the online anomaly detection phase. During the offline model training phase, we first preprocess the raw MTS. We ...
IEEE

Evidential c-Means Clustering with City-Block and Mahalanobis Distances Learning

Abstract: As a representative partitioning clustering algorithm, fuzzy c-means (FCM) has attained great success in data clustering. However, FCM and its variants face challenges in complex scenarios, ...