Multilayer hypergraph clustering using the aggregate similarity matrix
We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-uniform HSBM on N vertices. Given the similarity matrix containing the aggregated number of hyperedges incident to each pair of vertices, the goal is to obtain a partition of the N vertices into disjoint communities. In this work, we investigate a semidefinite programming (SDP) approach and obtain information-theoretic conditions on the model parameters that guarantee exact recovery both in the assortative and the disassortative cases.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringStochastic Block ModelSimilar Papers 제목 키워드 기반
Hypergraph convolutional neural network-based clustering technique
This paper constitutes the novel hypergraph convolutional neural networkbased clustering technique. This technique is employed to solve the clustering problem for the Citeseer dataset and the Cora dataset. Each dataset c…
ClusteringContext-Aware Hypergraph Construction for Robust Spectral Clustering
Spectral clustering is a powerful tool for unsupervised data analysis. In this paper, we propose a context-aware hypergraph similarity measure (CAHSM), which leads to robust spectral clustering in the case of noisy data.…
Clusteringhypergraph partitioningMultilayer Graph Clustering with Optimized Node Embedding
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an opti…
ClusteringGraph ClusteringSimilarity and Dissimilarity Guided Co-association Matrix Construction for Ensemble Clustering
Ensemble clustering aggregates multiple weak clusterings to achieve a more accurate and robust consensus result. The Co-Association matrix (CA matrix) based method is the mainstream ensemble clustering approach that cons…
ClusteringNonbacktracking spectral clustering of nonuniform hypergraphs
Spectral methods offer a tractable, global framework for clustering in graphs via eigenvector computations on graph matrices. Hypergraph data, in which entities interact on edges of arbitrary size, poses challenges for m…
Clustering