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

DOI10.3724/SP.J.1004.2009.00859zbMATH Open1212.68142MaRDI QIDQ3572244FDOQ3572244

Authors:

Publication date: 8 July 2010

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

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

zbMATH Keywords

intra-cluster similarityinter-cluster distinctnessneuron combinationvector compression

Mathematics Subject Classification ID

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

Cited In (12)

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

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)