579 citations · 698 across the 20 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…
math.OC2018★ 2 cited
An Efficient Semismooth Newton Based Algorithm for Convex Clustering
Yancheng Yuan, Defeng Sun, Kim-Chuan Toh
Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular meth…