paper-with-me

홈 › Papers

Spectral Clustering and Block Models: A Review And A New Algorithm

2015-08-07 · Sharmodeep Bhattacharyya, Peter J. Bickel

We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to perform optimally both theoretically using asymptotic theory and empirically.

📄 PDF Abstract BibTeX arXiv:1508.01819

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringImage Clustering

Methods 이 논문이 사용한 방법론

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

Similar Papers 제목 키워드 기반

Nonbacktracking spectral clustering of nonuniform hypergraphs

2022-04-27 · Philip Chodrow, Nicole Eikmeier, Jamie Haddock

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

Randomized Spectral Clustering in Large-Scale Stochastic Block Models

2020-01-20 · Hai Zhang, Xiao Guo, Xiangyu Chang

Spectral clustering has been one of the widely used methods for community detection in networks. However, large-scale networks bring computational challenges to the eigenvalue decomposition therein. In this paper, we stu…

ClusteringCommunity DetectionStochastic Block Model

A Distributed Block Chebyshev-Davidson Algorithm for Parallel Spectral Clustering

2022-12-08 · Qiyuan Pang, Haizhao Yang

We develop a distributed Block Chebyshev-Davidson algorithm to solve large-scale leading eigenvalue problems for spectral analysis in spectral clustering. First, the efficiency of the Chebyshev-Davidson algorithm relies …

Clustering

Consistency of spectral clustering in stochastic block models

2013-12-07 · Jing Lei, Alessandro Rinaldo

We analyze the performance of spectral clustering for community extraction in stochastic block models. We show that, under mild conditions, spectral clustering applied to the adjacency matrix of the network can consisten…

Clustering

Strong Consistency, Graph Laplacians, and the Stochastic Block Model

2020-04-21 · Shaofeng Deng, Shuyang Ling, Thomas Strohmer

Spectral clustering has become one of the most popular algorithms in data clustering and community detection. We study the performance of classical two-step spectral clustering via the graph Laplacian to learn the stocha…

ClusteringCommunity DetectionStochastic Block Model