109 citations · 565 across the 64 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2023
Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees
Ziwen Wang, Yancheng Yuan, Jiaming Ma +2
In this paper, we propose a randomly projected convex clustering model for clustering a collection of high dimensional data points in with hidden clusters. C…
cs.LG2020★ 2 cited
Learning Graph Laplacian with MCP
Yangjing Zhang, Kim-Chuan Toh, Defeng Sun
We consider the problem of learning a graph under the Laplacian constraint with a non-convex penalty: minimax concave penalty (MCP). For solving the MCP penalized graphical model,…
cs.LG2018★ 9 cited
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm
Defeng Sun, Kim-Chuan Toh, Yancheng Yuan
Clustering is a fundamental problem in unsupervised learning. Popular methods like K-means, may suffer from poor performance as they are prone to get stuck in its local minima. Rec…