Randomized self-updating process for clustering large-scale data

DOI10.1007/S11222-023-10355-8MaRDI QIDQ6190669zbMATH OpenFDO

Authors Shang-Ying Shiu, Yen-Shiu Chin, S. H. Lin, Ting-Li Chen

Publication date 6 February 2024

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-023-10355-8

zbMATH Keywords

clustering analysislarge-scale datarandomized algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Scalable density-based clustering with quality guarantees using random projections
• scientific article; zbMATH DE number 5540352
• A distributed framework for trimmed kernel \(k\)-means clustering
• A fast clustering algorithm for large-scale and high dimensional data
• On the strengths of the self-updating process clustering algorithm

Cites work

• \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
• An automatic clustering algorithm for probability density functions
• An improved fuzzy time series forecasting model using variations of data
• On the convergence and consistency of the blurring mean-shift process
• On the strengths of the self-updating process clustering algorithm
• Self-updating clustering algorithm for estimating the parameters in mixtures of von Mises distributions
• Visualizing data using t-SNE

Cited in

(1)

• UP-DPC: ultra-scalable parallel density peak clustering

This page was built for publication: Randomized self-updating process for clustering large-scale data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190669)