A novel fast heuristic to handle large-scale shape clustering

DOI10.1080/00949655.2014.1000900MaRDI QIDQ5222322zbMATH OpenOpenAlexFDO

Authors Hassan Ismkhan

Publication date 1 April 2020

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949655.2014.1000900

zbMATH Keywords

clusteringheuristicsautomatic cluster numberlarge-scale shape clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• A comparative study of some clustering algorithms on shape data
• Cluster analysis using triangulation
• AI 2005: Advances in Artificial Intelligence
• The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
• scientific article; zbMATH DE number 1927359

Cites work

• A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
• A fast \(k\)-means clustering algorithm using cluster center displacement
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• A multi-prototype clustering algorithm
• Adaptive evolutionary clustering
• Determining the number of clusters using information entropy for mixed data
• Fast global \(k\)-means clustering based on local geometrical information
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Robust path-based spectral clustering
• Shape clustering: common structure discovery

Cited in

(4)

• A shape recognition and clustering algorithm based on a feature model
• scientific article; zbMATH DE number 7235180 (Why is no real title available?)
• A comparative study of some clustering algorithms on shape data
• Cluster analysis using triangulation

This page was built for publication: A novel fast heuristic to handle large-scale shape clustering

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