Semi-supervised k-means clustering via DC programming approach

DOI10.1007/978-3-031-35305-5_4MaRDI QIDQ6134046zbMATH OpenOpenAlexFDO

Authors Tatiana V. Gruzdeva, Anton Vladimirovich Ushakov

Publication date 21 August 2023

Published in Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-35305-5_4

zbMATH Keywords

local searchDC programmingconstrained clusteringsemi-supervised clusteringk-meansminimum-sum-of-squares clusteringcannot-linkmust-link

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Recommendations

• A \(k\)-means clustering framework based on semi-supervised learning
• Semi-supervised k-means++
• Semi-supervised algorithms for approximately optimal and accurate clustering
• Semi-supervised clustering
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Semi-supervised clustering based on affinity propagation algorithm
• A class of semi-supervised support vector machines by DC programming

Cites work

• scientific article; zbMATH DE number 2210595 (Why is no real title available?)
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A matheuristic for large-scale capacitated clustering
• An effective heuristic for large-scale capacitated facility location problems
• An exact algorithm for semi-supervised minimum sum-of-squares clustering
• An improved column generation algorithm for minimum sum-of-squares clustering
• Constrained Clustering
• Constrained Clustering Using Column Generation
• DILS: constrained clustering through dual iterative local search
• Introduction to global optimization.
• K-means clustering via a nonconvex optimization approach
• NP-hardness of Euclidean sum-of-squares clustering
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• On local search in d.c. optimization problems
• On solving optimization problems with hidden nonconvex structures
• Optimization problems for machine learning: a survey
• Solving capacitated clustering problems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The capacitated centred clustering problem
• The planar \(k\)-means problem is NP-hard

Cited in

(1)

• Semi-supervised k-means++

This page was built for publication: Semi-supervised \(k\)-means clustering via DC programming approach

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