On distributing the clustering process

DOI10.1016/S0167-8655(02)00031-4MaRDI QIDQ4537345zbMATH OpenFDO

Authors T. Gnardellis, B. Boutsinas

Publication date 27 June 2002

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8655(02)00031-4

zbMATH Keywords

clustering algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• A scalable framework for cluster ensembles
• Parallel Processing and Applied Mathematics
• Parallel clustering algorithms
• Extending fuzzy and probabilistic clustering to very large data sets
• A hybrid approach to clustering in very large databases

Cited in

(11)

• A scalable framework for cluster ensembles
• The new k-windows algorithm for improving the k-means clustering algorithm
• A hybrid approach to clustering in very large databases
• ON MERGING CLASSIFICATION RULES
• Experimenting NT cluster technology for massive CDR processing
• scientific article; zbMATH DE number 1792110 (Why is no real title available?)
• Scaling-up model-based clustering algorithm by working on clustering features
• An efficient successive iteration partial cluster algorithm for large datasets
• Online model-based clustering for crisis identification in distributed computing
• Distributed Computing – IWDC 2005
• Approaches for scaling DBSCAN algorithm to large spatial databases

This page was built for publication: On distributing the clustering process

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