Clustering in Partially Labeled Stochastic Block Models via Total Variation Minimization
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.
Code (1)
Tasks
ClusteringStochastic Block ModelSimilar Papers 제목 키워드 기반
Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model
In this paper, we investigate the problem of recovering hidden communities in the Labeled Stochastic Block Model (LSBM) with a finite number of clusters whose sizes grow linearly with the total number of nodes. We derive…
ClusteringStochastic Block ModelRobust Clustering on High-Dimensional Data with Stochastic Quantization
This paper addresses the limitations of conventional vector quantization algorithms, particularly K-Means and its variant K-Means++, and investigates the Stochastic Quantization (SQ) algorithm as a scalable alternative f…
ClusteringComputational Efficiencyimage-classificationImage Classification+2Inference via Message Passing on Partially Labeled Stochastic Block Models
We study the community detection and recovery problem in partially-labeled stochastic block models (SBM). We develop a fast linearized message-passing algorithm to reconstruct labels for SBM (with $n$ nodes, $k$ blocks, …
Community DetectionMultiplex Dirichlet stochastic block model for clustering multidimensional compositional networks
Network data often represent multiple types of relations, which can also denote exchanged quantities, and are typically encompassed in a weighted multiplex. Such data frequently exhibit clustering structures, however, tr…
ClusteringStochastic Block ModelContrastive Mean-Shift Learning for Generalized Category Discovery
We address the problem of generalized category discovery (GCD) that aims to partition a partially labeled collection of images; only a small part of the collection is labeled and the total number of target classes is unk…
ClusteringContrastive LearningImage Clustering