A Novel Convex Clustering Method for High-Dimensional Data Using Semiproximal ADMM
Clustering is an important ingredient of unsupervised learning; classical clustering methods include K-means clustering and hierarchical clustering. These methods may suffer from instability because of their tendency prone to sink into the local optimal solutions of the nonconvex optimization model....
Main Authors: | Huangyue Chen, Lingchen Kong, Yan Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/9216351 |
Similar Items
-
Spatial Data Reconstruction via ADMM and Spatial Spline Regression
by: Bang Liu, et al.
Published: (2019-04-01) -
A Novel Speckle Noise Removal Algorithm Based on ADMM and Energy Minimization Method
by: Bo Chen, et al.
Published: (2020-01-01) -
On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
by: Huijie Sun, et al.
Published: (2016-09-01) -
The Recent Study on ADMM
by: Huang, Huan-Kai, et al.
Published: (2018) -
Co-Robust-ADMM-Net: Joint ADMM Framework and DNN for Robust Sparse Composite Regularization
by: Yunyi Li, et al.
Published: (2018-01-01)