Abstract
In this paper, least squares and spectral methods for attributed graph matching are compared. For the least squares method, complete graphs and decomposed graph models are considered in conjunction with the least squares approximations to optimal permutation matrices. We have used a version of Umeyama's spectral method for comparison purposes. Results clearly demonstrate how both these methods are affected by additive noise but that, in general, least squares methods are superior. © Springer-Verlag 2004.
Cite
CITATION STYLE
Lu, J., Caelli, T., & Yang, J. (2004). A comparison of least squares and spectral methods for attributed graph matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 325–333. https://doi.org/10.1007/978-3-540-27868-9_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
