Abstract
A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for the presence of edges within a cluster and between different clusters. We assume that the cluster assignments are known for at least one data point in each cluster. In such a partially labeled stochastic block model, clustering amounts to estimating the cluster assignments of the remaining data points. We study total variation minimization as a method for this clustering task. We implement the resulting clustering algorithm as a highly scalable message passing protocol. We also provide a condition on the model parameters such that total variation minimization allows for accurate clustering.
| Original language | English |
|---|---|
| Title of host publication | Conference Record of the 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020 |
| Editors | Michael B. Matthews |
| Publisher | IEEE |
| Pages | 731-735 |
| Number of pages | 5 |
| ISBN (Electronic) | 9780738131269 |
| DOIs | |
| Publication status | Published - 1 Nov 2020 |
| MoE publication type | A4 Conference publication |
| Event | Asilomar Conference on Signals, Systems & Computers - Pacific Grove, United States Duration: 1 Nov 2020 → 5 Nov 2020 Conference number: 54 |
Publication series
| Name | Conference Record - Asilomar Conference on Signals, Systems and Computers |
|---|---|
| Publisher | IEEE Computer Society |
| Volume | 2020-November |
| ISSN (Print) | 1058-6393 |
Conference
| Conference | Asilomar Conference on Signals, Systems & Computers |
|---|---|
| Abbreviated title | ACSSC |
| Country/Territory | United States |
| City | Pacific Grove |
| Period | 01/11/2020 → 05/11/2020 |