Fast global k-means clustering based on local geometrical information

DOI10.1016/J.INS.2013.05.023MaRDI QIDQ497555zbMATH OpenOpenAlexFDO

Authors Liang Bai, Chao Sui, Chuangyin Dang, Jiye Liang

Publication date 24 September 2015

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.05.023

zbMATH Keywords

optimizationcluster analysiscomputational complexityglobal \( k\)-means clusteringlocal geometrical information

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Fast global \(k\)-means clustering using cluster membership and inequality
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• An improved global \(K\)-means clustering algorithm
• A fast \(k\)-means clustering algorithm using cluster center displacement

Cites work

• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
• A new measure of uncertainty based on knowledge granulation for rough sets
• Clustering and selecting suppliers based on simulated annealing algorithms
• Fast global \(k\)-means clustering using cluster membership and inequality
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• MGRS: a multi-granulation rough set
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• \(K\)-harmonic means data clustering with simulated annealing heuristic

Cited in

(10)

• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts
• Initialization of \(K\)-modes clustering using outlier detection techniques
• Fast agglomerative clustering using information of \(k\)-nearest neighbors
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
• The \(k\)-means algorithm based on Finsler geometry
• A novel fast heuristic to handle large-scale shape clustering
• Global optimality in k-means clustering
• Fast global \(k\)-means clustering using cluster membership and inequality

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Fast global \(k\)-means clustering based on local geometrical information

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