Fast indefinite multi-point (IMP) clustering

DOI10.1007/S10092-016-0191-2MaRDI QIDQ2363687zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 25 July 2017

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10092-016-0191-2

zbMATH Keywords

clusteringcombinatorial searchmonotonic descentVoronoi cells

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Recommendations

• \(k\)-means algorithm
• An algorithm for minimizing clustering functions
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• An efficient enhanced \(k\)-means clustering algorithm

Cites work

• k-means requires exponentially many iterations even in the plane
• A deterministic annealing approach to clustering
• Algorithm AS 136: A K-Means Clustering Algorithm
• Fast hierarchical clustering and other applications of dynamic closest pairs
• Fuzzy clustering using scatter matrices
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• Least squares quantization in PCM
• Self-organization and associative memory.
• The effectiveness of Lloyd-type methods for the \(k\)-means problem

Cited in

(5)

• Preclustering algorithms for imprecise points
• Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data
• Fast multiscale clustering and manifold identification
• PCT – a technique to probe cluster terrain
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance

Describes a project that uses

Uses Software

• k-means++
• AS 136

This page was built for publication: Fast indefinite multi-point (IMP) clustering

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