Compute Convex (Bi)Clustering Solutions via Algorithmic Regularization
-
Updated
Oct 8, 2020 - R
Compute Convex (Bi)Clustering Solutions via Algorithmic Regularization
Semismooth-newton method for convex clustering
This research proposes the use of unsupervised machine learning methods to partially get rid of the reliance for predetermined labels and instead let the clustering define the genres and like songs.
Add a description, image, and links to the convex-clustering topic page so that developers can more easily learn about it.
To associate your repository with the convex-clustering topic, visit your repo's landing page and select "manage topics."