Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis

Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper, we propose a new spectral method, graph matching by pairwise eige...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Foundations of computational mathematics Ročník 23; číslo 5; s. 1511 - 1565
Hlavní autoři:	Fan, Zhou, Mao, Cheng, Wu, Yihong, Xu, Jiaming
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2023 Springer Nature B.V
Témata:	Algorithms Apexes Applications of Mathematics Assignment problem Computer Science Correlation coefficients Economics Eigenvalues Eigenvectors Graph matching Graph theory Graphs Linear and Multilinear Algebras Math Applications in Computer Science Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Operations research Polynomials Quadratic programming Similarity Spectral methods Statistical analysis Random matrix theory Convex relaxations Primary 90C25 Quadratic assignment problem Quadratic programming Secondary 68Q87 Spectral methods Graph matching
ISSN:	1615-3375, 1615-3383
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!