A fast clustering algorithm for large-scale and high dimensional data

DOI10.3724/SP.J.1004.2009.00859MaRDI QIDQ3572244zbMATH OpenFDO

Authors

Publication date 8 July 2010

Published in Acta Automatica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1004.2009.00859

zbMATH Keywords

inter-cluster distinctnessintra-cluster similarityneuron combinationvector compression

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Clustering high dimensional massive scientific datasets
• The fast clustering algorithm for the big data based on K-means
• scientific article; zbMATH DE number 1977832
• Improvement of the fast clustering algorithm improved by K-means in the big data
• Advances in Artificial Intelligence – SBIA 2004

Cited in

(12)

• A dynamic density-based clustering algorithm appropriate to large-scale text processing
• Density-based statistical merging algorithm for large data sets
• scientific article; zbMATH DE number 5006749 (Why is no real title available?)
• scientific article; zbMATH DE number 5280158 (Why is no real title available?)
• A fast and recursive algorithm for clustering large datasets with \(k\)-medians
• scientific article; zbMATH DE number 1977832 (Why is no real title available?)
• The fast clustering algorithm for the big data based on K-means
• A review on clustering algorithms for large-scale data sets
• Advances in Artificial Intelligence – SBIA 2004
• An adaptive clustering algorithm by neighbourhood search for large-scale data
• Clustering high dimensional massive scientific datasets
• Randomized self-updating process for clustering large-scale data

This page was built for publication: A fast clustering algorithm for large-scale and high dimensional data

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