# Haut PDF Spectral redemption in clustering sparse networks

### Spectral redemption in clustering sparse networks

**networks**to illustrate the advantages of

**spectral**

**clustering**based on the non- backtracking matrix

**in**practical ...applications.

**In**Fig. 6 we show B’s spectrum for several ...

12

### A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks

**networks**built from DBLP

**in**the following ...paper

**in**the corresponding ...together

**in**one of the considered ...learning

**in**their scopes : ICML, NIPS, and two ...

33

### Clustering from sparse pairwise measurements

**in**the graph G, and w is defined

**in**(8). A simple computation, analogous to [9], allows to show that (λ ≥ 1, v) is an eigenpair of B, if and only H(λ)v = 0. ...

6

### Spectral Detection on Sparse Hypergraphs

**in**the case of graphs with simple edges between couples of ...many

**networks**have a different structure, and the relationships between vertex-variables are not established

**in**couples but ...

9

### Robust spectral clustering using LASSO regularization

**Spectral**

**clustering**, community detec- tion, eigenvectors basis, ` 1 ...role

**in**complex systems as they can conveniently model interactions be- tween the variables of a ...used

**in**a ...

16

### Accelerating consensus by spectral clustering and polynomial filters

**in**[1], (discrete-time) consensus algorithms have attracted almost as much attention as their dual, fast mixing Markov chains [2], ...fixed

**networks**, some particular acceleration methods ...

11

### l1-spectral clustering algorithm: a robust spectral clustering using Lasso regularization

**in**complex systems as they can model interactions between variables of the ...used

**in**a wide range of applications, from social sciences ...social

**networks**(Handcock and Gile, 2010)) to ...

24

### Efficient Eigen-updating for Spectral Graph Clustering

**clustering**, is often used to gain insight into the or- ganisation of large scale

**networks**and for visualisation ...graph

**clustering**methods tailored for evolving

**networks**is a ...

28

### Incremental Spectral Clustering with the Normalised Laplacian

**clustering**, is often used to gain insight into the organization of large scale

**networks**and for visualization ...graph

**clustering**methods tailored for evolving

**networks**is a challenging ...

7

### Overlapping clustering methods for networks

**in**the general category of agglomerative hi- erarchical

**clustering**methods [24, ...configuration

**in**which each vertex is the sole member of one of N communities, the communities are iteratively ...

26

### Community detection in sparse networks via Grothendieck's inequality

**spectral**

**clustering**, where the communities are recovered based on the signs of an eigenvector of the adjacency matrix (going back to [ 39 , 14 , 50 ], see [ 64 ...of

**sparse**matrices tend to be ...

24

### Modularity-based Sparse Soft Graph Clustering

**In**[27], Nicosia et ...problem.

**In**[12], Griechisch et ...Finally,

**in**[14], Havens et al. use a

**spectral**approach that does not directly solve the relaxation of the modularity ...

11

### Power Spectral Clustering

**Spectral**

**clustering**has been widely popular due to its usage

**in**image segmentation ...role

**in**globalizing local information

**in**the recent state-of-the-art method for ...

20

### Spectral inference methods on sparse graphs : theory and applications

**in**a compact way, and provide a unified view of inference and learning problems

**in**areas as diverse as statistical physics, computer vision, coding theory or machine learning (see ...

256

### Word sense discrimination in information retrieval: a spectral clustering-based approach

**in**information retrieval (IR) ...retrieved

**in**relation to an ambiguous ...disambiguation

**in**IR are generally supervised ones.

**In**this paper we propose a new unsupervised method that ...

18

### Clustering behaviors in networks of integrate-and-fire oscillators

**clustering**

**in**the population, we computed the fraction of “traveling ...oscillators.”

**In**a popula- tion of identical oscillators, each oscillator is trapped

**in**one of the N g clusters and ...

8

### Optimal Laplacian Regularization for Sparse Spectral Community Detection

**in**

**sparse**net- works, provided for one by the statistics community and for the other by the physics community; these approaches have so far have been treated ...algorithms

**in**

**sparse**...

6

### 3D+t segmentation of PET images using spectral clustering

**in**3D, a preprocessing step reducing the size of the data clustered is applied to PET ...a

**clustering**slice by slice with a hierarchical

**clustering**...technique.

**In**this paper, we ...

5

### Multiple change points detection and clustering in dynamic networks

**In**practice, considering dynamic interactions over a continuous time interval, we assume the intensity functions of the NHPPP to depend on the hidden node clusters and to be piecewise ...observed. ...

30

### Networks clustering with bee colony

1