Spectral clustering for divide-and-conquer graph matching (2013-10-04T00:00:00.000000Z)

TL;DR

This work presents a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs, showing up to a factor of 8 improvement in runtime with minimal sacrifice in accuracy.

Authors

J. Vogelstein

5 papers

C. Priebe

3 papers

V. Lyzinski

1 papers

D. Sussman

1 papers

D. E. Fishkind

1 papers

H. Pao

1 papers

Li Chen

1 papers

Youngser Park

2 papers

TL;DR

Authors

References41 items

Factorized Graph Matching

MIGRAINE: MRI Graph Reliability Analysis and Inference for Connectomics

Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching

Efficient geometric graph matching using vertex embedding

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Seeded graph matching for correlated Erdös-Rényi graphs

Matrix estimation by Universal Singular Value Thresholding

A multithreaded algorithm for network alignment via approximate matching

Pattern Classification

Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs

Progressive graph matching: Making a move of graphs via probabilistic voting

Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown

Magnetic Resonance Connectome Automated Pipeline: An Overview

Sparse Subspace Clustering: Algorithm, Theory, and Applications

Scalable K-Means++

Large (Brain) Graph Matching via Fast Approximate Quadratic Programming

A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs

Spectral clustering and the high-dimensional stochastic blockmodel

Feature correspondence and deformable object matching via agglomerative correspondence clustering

Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors

Sparse subspace clustering

Global alignment of protein–protein interaction networks by graph matching methods

A Path Following Algorithm for the Graph Matching Problem

Automatic dimensionality selection from the scree plot via the use of profile likelihood

Fast low-rank modifications of the thin singular value decomposition

Augmented Implicitly Restarted Lanczos Bidiagonalization Methods

Shape matching and object recognition using low distortion correspondences

Thirty Years Of Graph Matching In Pattern Recognition

An eigenspace projection clustering method for inexact graph matching

Model-based morphological segmentation and labeling of coronary angiograms

An Eigendecomposition Approach to Weighted Graph Matching Problems

Stochastic Blockmodels for Directed Graphs

Stochastic blockmodels: First steps

A k-means clustering algorithm

A Cluster Separation Measure

P-Complete Approximation Problems

An algorithm for quadratic programming

Pattern Classification

Parallel Algorithms for the Singular Value Decomposition

The NP-Completeness Column: An Ongoing Guide

Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

Field of Study

Journal Information

Name

Page

Volume

Venue Information

Name

Type

URL

Alternate Names