Optimal Laplacian regularization for sparse spectral community detection

2019-12-03 · Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay

Regularization of the classical Laplacian matrices was empirically shown to improve spectral clustering in sparse networks. It was observed that small regularizations are preferable, but this point was left as a heuristic argument. In this paper we formally determine a proper regularization which is intimately related to alternative state-of-the-art spectral techniques for sparse graphs.

📄 PDF Abstract BibTeX arXiv:1912.01419

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringCommunity Detection

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…

Analysis of spectral clustering algorithms for community detection: the general bipartite setting

2018-03-12 · Zhixin Zhou, Arash A. Amini

We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM). A modern spectral clustering algorithm consists of three steps: (1) regularization of an appropri…

Clustering Community Detection Stochastic Block Model

Consistency of regularized spectral clustering in degree-corrected mixed membership model

2020-11-23 · Huan Qing, Jingli Wang

Community detection in network analysis is an attractive research area recently. Here, under the degree-corrected mixed membership (DCMM) model, we propose an efficient approach called mixed regularized spectral clusteri…

Clustering Community Detection

Superpixel Based Graph Laplacian Regularization for Sparse Hyperspectral Unmixing

2020-07-28 · Taner Ince

An efficient spatial regularization method using superpixel segmentation and graph Laplacian regularization is proposed for sparse hyperspectral unmixing method. Since it is likely to find spectrally similar pixels in a …

Hyperspectral Unmixing Segmentation Superpixels

Robust Spectral Detection of Global Structures in the Data by Learning a Regularization

2016-09-09 · NeurIPS 2016 12 · Pan Zhang

Spectral methods are popular in detecting global structures in the given data that can be represented as a matrix. However when the data matrix is sparse or noisy, classic spectral methods usually fail to work, due to lo…

Clustering Community Detection Matrix Completion

A unified framework for spectral clustering in sparse graphs

2020-03-20 · Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay

This article considers spectral community detection in the regime of sparse networks with heterogeneous degree distributions, for which we devise an algorithm to efficiently retrieve communities. Specifically, we demonst…

Clustering Community Detection Form