A parallel ADMM-based convex clustering method
Abstract Convex clustering has received recently an increased interest as a valuable method for unsupervised learning. Unlike conventional clustering methods such as k-means, its formulation corresponds to solving a convex optimization problem and hence, alleviates initialization and local minima pr...
Main Authors: | Lidija Fodor, Dušan Jakovetić, Danijela Boberić Krstićev, Srđan Škrbić |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2022-11-01
|
Series: | EURASIP Journal on Advances in Signal Processing |
Subjects: | |
Online Access: | https://doi.org/10.1186/s13634-022-00942-8 |
Similar Items
-
ADMM/ ADMM Plus As Cbm Through Non-Traditional Issues (ASEAN)
by: Alma Evelinda Silalahi
Published: (2023-06-01) -
An ADMM Based Parallel Approach for Fund of Fund Construction
by: Yidong Chen, et al.
Published: (2022-01-01) -
Robust and Simple ADMM Penalty Parameter Selection
by: MICHAEL T. MCCANN, et al.
Published: (2024-01-01) -
Optimal querying for communication-efficient ADMM using Gaussian process regression
by: Aldo Duarte, et al.
Published: (2024-03-01) -
A fully distributed optimal power flow algorithm for multi-regional DC systems based on ADMM
by: YE Qingquan, et al.
Published: (2024-02-01)