Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

6 Sep 2013 · Weiran Wang, Miguel Á. Carreira-Perpiñán ·

We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.

PDF Abstract

Code

Add Remove Mark official

zitengsun/hadamard_response

jlyx417353617/hadamard_response

mehdisebbar/clustering-models

Tasks

Add Remove

Clustering

Datasets

Add Datasets introduced or used in this paper

Results from the Paper

Add Remove

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods

Add Remove

No methods listed for this paper. Add relevant methods here

Edit Social Preview

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Datasets Edit

Results from the Paper Edit Add Remove

Methods Edit Add Remove

Code

Add Remove Mark official

Tasks

Add Remove

Datasets

Results from the Paper

Add Remove

Methods

Add Remove