On Autonomous k-Means Clustering

DOI10.1007/11425274_24MaRDI QIDQ5450869zbMATH OpenOpenAlexFDO

Authors Tapio Elomaa, Heidi Koivistoinen

Publication date 17 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11425274_24

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• \(k\)-means algorithm
• K-MEANS CLUSTERING USING ENTROPY MINIMIZATION
• Adaptive initialization method based on spatial local information for \(k\)-means algorithm
• Unsupervised learning by cluster quality optimization
• A survey on algorithms for k-means problem and its variants

Cited in

(9)

• Lattice algebra approach to color image segmentation
• Unsupervised learning by cluster quality optimization
• Self-learning \(K\)-means clustering: a global optimization approach
• Intelligent choice of the number of clusters in K-means clustering: an experimental study with different cluster spreads
• A global k-means approach for autonomous cluster initialization of probabilistic neural network
• scientific article; zbMATH DE number 1975247 (Why is no real title available?)
• scientific article; zbMATH DE number 2017858 (Why is no real title available?)
• scientific article; zbMATH DE number 1927172 (Why is no real title available?)
• On the strengths of the self-updating process clustering algorithm

This page was built for publication: On Autonomous k-Means Clustering

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