scientific article; zbMATH DE number 2222601
From MaRDI portal
Publication:5701392
zbMath1085.68132MaRDI QIDQ5701392
No author found.
Publication date: 3 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (max. 100)
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ The Ratio-Cut Polytope and K-Means Clustering ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Non-convex clustering via proximal alternating linearized minimization method ⋮ Unnamed Item ⋮ Improving spectral bounds for clustering problems by Lagrangian relaxation ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ An empirical comparison of two approaches for CDPCA in high-dimensional data ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
This page was built for publication:
