Self-learning \(K\)-means clustering: a global optimization approach

DOI10.1007/s10898-012-9854-yzbMath1275.90073OpenAlexW2050797918MaRDI QIDQ2392762

Gerhard-Wilhelm Weber, D. Toledano-Kitai, V. Eh. Vol'kovich

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)

Related Items (1)

Optimal unions of hidden classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Statistical theory in clustering
• A statistical model of cluster stability
• Regularized estimation of large covariance matrices
• A classification EM algorithm for clustering and two stochastic versions
• Resampling Method for Unsupervised Estimation of Cluster Validity
• A Resampling Approach to Cluster Validation
• A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
• Entropy expressions and their estimators for multivariate distributions
• Well-Separated Clusters and Optimal Fuzzy Partitions
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Finding the Number of Clusters in a Dataset
• Stability-Based Validation of Clustering Solutions
• Identifying genuine clusters in a classification
• Concept decompositions for large sparse text data using clustering

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