Self-learning K-means clustering: a global optimization approach

DOI10.1007/S10898-012-9854-YMaRDI QIDQ2392762zbMATH OpenOpenAlexFDO

Authors D. Toledano-Kitai, Gerhard-Wilhelm Weber, Z. Volkovich

Publication date 2 August 2013

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9854-y

zbMATH Keywords

first keywordmoresecond keyword

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Recommendations

• Global optimality in k-means clustering
• On Autonomous k-Means Clustering
• K-means clustering via a nonconvex optimization approach
• Self-Tuning Possibilistic c-Means Clustering Models
• An improved global \(K\)-means clustering algorithm
• KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS

Cites work

• scientific article; zbMATH DE number 5904571 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 1348600 (Why is no real title available?)
• scientific article; zbMATH DE number 3429948 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
• A classification EM algorithm for clustering and two stochastic versions
• A resampling approach to cluster validation
• A statistical model of cluster stability
• Concept decompositions for large sparse text data using clustering
• Entropy expressions and their estimators for multivariate distributions
• Estimating the number of clusters in a data set via the gap statistic
• Finding the Number of Clusters in a Dataset
• High dimensional inverse covariance matrix estimation via linear programming
• Identifying genuine clusters in a classification
• On a minimal spanning tree approach in the cluster validation problem
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Regularized estimation of large covariance matrices
• Resampling method for unsupervised estimation of cluster validity
• Stability-Based Validation of Clustering Solutions
• Statistical theory in clustering
• Well-Separated Clusters and Optimal Fuzzy Partitions

Cited in

(2)

• Optimal unions of hidden classes
• Unsupervised learning by cluster quality optimization

This page was built for publication: Self-learning \(K\)-means clustering: a global optimization approach

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