Non-convex clustering via proximal alternating linearized minimization method

DOI10.1142/S0219691318400131zbMath1390.68559OpenAlexW2782001499MaRDI QIDQ4634919

Feiyu Chen, Ting Xie

Publication date: 12 April 2018

Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219691318400131

zbMATH Keywords

clusteringproximal alternating linearized minimization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Improvement of the fast clustering algorithm improved by \(K\)-means in the big data ⋮ A brief introduction to manifold optimization ⋮ The fast clustering algorithm for the big data based on K-means

Uses Software

• CVX
• FERET
• AS 136
• k-means++
• clusterpath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Algorithm AS 136: A K-Means Clustering Algorithm
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Multiscale facial structure representation for face recognition under varying illumination
• NP-hardness of Euclidean sum-of-squares clustering
• New method for feature extraction based on fractal behavior
• Probably certifiably correct \(k\)-means clustering
• Relax, No Need to Round
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• The Geometry of Algorithms with Orthogonality Constraints
• Variational Analysis
• Least squares quantization in PCM
• Face Recognition Under Varying Illumination Using Gradientfaces
• Alternating Projections on Manifolds
• Approximating K‐means‐type Clustering via Semidefinite Programming

This page was built for publication: Non-convex clustering via proximal alternating linearized minimization method