Similarity-Aware Spectral Sparsification by Edge Filtering

11/14/2017
by   Zhuo Feng, et al.
0

In recent years, spectral graph sparsification techniques that can compute ultra-sparse graph proxies have been extensively studied for accelerating various numerical and graph-related applications. Prior nearly-linear-time spectral sparsification methods first extract low-stretch spanning tree of the original graph to form the backbone of the sparsifier, and then recover small portions of spectrally-critical off-tree edges to the spanning to significantly improve the approximation quality. However, it is not clear how many off-tree edges should be recovered for achieving a desired spectral similarity level within the sparsifier. Motivated by recent graph signal processing techniques, this paper proposes a similarity-aware spectral graph sparsification framework that leverages an efficient off-tree edge filtering scheme to construct spectral sparsifiers with guaranteed spectral similarity (relative condition number) level. An iterative graph densification framework and a generalized eigenvalue stability checking scheme are introduced to facilitate efficient and effective filtering of off-tree edges even for highly ill-conditioned problems. The proposed method has been validated using various kinds of graphs obtained from public domain sparse matrix collections relevant to VLSI CAD, finite element analysis, as well as social and data networks frequently studied in many machine learning and data mining applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2019

GRASS: Spectral Sparsification Leveraging Scalable Spectral Perturbation Analysis

Spectral graph sparsification aims to find ultra-sparse subgraphs whose ...
research
12/14/2022

LGRASS: Linear Graph Spectral Sparsification for Final Task of the 3rd ACM-China International Parallel Computing Challenge

This paper presents our solution for optimization task of the 3rd ACM-Ch...
research
10/12/2017

Towards Scalable Spectral Clustering via Spectrum-Preserving Sparsification

The eigendeomposition of nearest-neighbor (NN) graph Laplacian matrices ...
research
11/23/2019

GRASPEL: Graph Spectral Learning at Scale

Learning meaningful graphs from data plays important roles in many data ...
research
06/13/2022

Pursuing More Effective Graph Spectral Sparsifiers via Approximate Trace Reduction

Spectral graph sparsification aims to find ultra-sparse subgraphs which ...
research
07/14/2020

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse gr...
research
07/23/2018

Hybrid Diffusion: Spectral-Temporal Graph Filtering for Manifold Ranking

State of the art image retrieval performance is achieved with CNN featur...

Please sign up or login with your details

Forgot password? Click here to reset