Spectral clustering for divide-and-conquer graph matching

•We present a novel divide-and-conquer bijective graph matching algorithm.•The algorithm is fully parallelizable, and scales to match “big data” graphs.•We demonstrate the effectiveness of the algorithm by matching DTMRI human connectomes. We present a parallelized bijective graph matching algorithm...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel computing Ročník 47; s. 70 - 87
Hlavní autori:	Lyzinski, Vince, Sussman, Daniel L., Fishkind, Donniell E., Pao, Henry, Chen, Li, Vogelstein, Joshua T., Park, Youngser, Priebe, Carey E.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.08.2015
Predmet:	Adjacency spectral embedding Clustering Graph matching Stochastic block model Adjacency spectral embedding Clustering Stochastic block model Graph matching
ISSN:	0167-8191, 1872-7336
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!