Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1605.02315
Cited By
Information Recovery in Shuffled Graphs via Graph Matching
8 May 2016
V. Lyzinski
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Information Recovery in Shuffled Graphs via Graph Matching"
24 / 24 papers shown
Title
Fast Embedding for JOFC Using the Raw Stress Criterion
V. Lyzinski
Youngser Park
Carey E. Priebe
M. Trosset
47
12
0
11 Feb 2015
Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
Cencheng Shen
Joshua T. Vogelstein
Carey E. Priebe
46
20
0
12 Dec 2014
Geometric Network Comparison
D. Asta
C. Shalizi
56
57
0
05 Nov 2014
A nonparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang
A. Athreya
D. Sussman
V. Lyzinski
Carey E. Priebe
78
37
0
08 Sep 2014
Graph Matching: Relax at Your Own Risk
V. Lyzinski
D. E. Fishkind
Marcelo Fiori
Joshua T. Vogelstein
Carey E. Priebe
Guillermo Sapiro
51
150
0
13 May 2014
Lexicon Infused Phrase Embeddings for Named Entity Resolution
Alexandre Passos
Vineet Kumar
Andrew McCallum
NAI
61
313
0
22 Apr 2014
SMERED: A Bayesian Approach to Graphical Record Linkage and De-duplication
R. Steorts
Rob Hall
S. Fienberg
CML
74
148
0
02 Mar 2014
Principled Graph Matching Algorithms for Integrating Multiple Data Sources
Duo Zhang
Benjamin I. P. Rubinstein
J. Gemmell
71
20
0
03 Feb 2014
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
Heather G. Patsolic
Sancar Adali
Joshua T. Vogelstein
Youngser Park
Carey E. Friebe
Gongkai Li
V. Lyzinski
FedML
57
28
0
16 Jan 2014
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching
Marcelo Fiori
Pablo Sprechmann
Joshua T. Vogelstein
Pablo Musé
Guillermo Sapiro
63
38
0
25 Nov 2013
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
E. Airoldi
Thiago B. Costa
Stanley H. Chan
161
193
0
07 Nov 2013
Spectral Clustering for Divide-and-Conquer Graph Matching
V. Lyzinski
D. Sussman
D. E. Fishkind
H. Pao
Li-Wei Chen
Joshua T. Vogelstein
Youngser Park
Carey E. Priebe
86
48
0
04 Oct 2013
Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding
V. Lyzinski
D. Sussman
M. Tang
A. Athreya
Carey Priebe
86
118
0
02 Oct 2013
Nonparametric graphon estimation
P. Wolfe
S. Olhede
156
203
0
23 Sep 2013
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
Tai Qin
Karl Rohe
129
303
0
16 Sep 2013
Co-clustering separately exchangeable network data
David S. Choi
P. Wolfe
148
60
0
17 Dec 2012
Matrix estimation by Universal Singular Value Thresholding
S. Chatterjee
419
527
0
06 Dec 2012
Generalized Canonical Correlation Analysis for Disparate Data Fusion
Ming Sun
Carey E. Priebe
M. Tang
52
14
0
17 Sep 2012
Seeded Graph Matching
D. E. Fishkind
Sancar Adali
Heather G. Patsolic
Lingyao Meng
Digvijay Singh
V. Lyzinski
Carey E. Priebe
52
77
0
03 Sep 2012
Shuffled Graph Classification: Theory and Connectome Applications
Joshua T. Vogelstein
Carey E. Priebe
65
18
0
23 Dec 2011
A consistent adjacency spectral embedding for stochastic blockmodel graphs
D. Sussman
M. Tang
D. E. Fishkind
Carey E. Priebe
164
294
0
10 Aug 2011
Spectral clustering and the high-dimensional stochastic blockmodel
Karl Rohe
S. Chatterjee
Bin Yu
252
934
0
09 Jul 2010
A path following algorithm for the graph matching problem
M. Zaslavskiy
Francis R. Bach
Jean-Philippe Vert
138
422
0
23 Jan 2008
A Tutorial on Spectral Clustering
U. V. Luxburg
282
10,536
0
01 Nov 2007
1