Exact and approximate graph matching using random walks
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always" covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539 · cited 1×
“Furthermore, the relative performance increaseswith the size of the graphs.”
BackgroundSelf-citation
Cited by
Virtual network embedding through topology-aware node ranking
Cheng, X., Su, S., Zhang, Z., Wang, H., Yang, F., Luo, Y., & Wang, J. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1971162.1971168 · Cited by 544
Reweighted Random Walks for Graph Matching
Cho, M., Lee, J., & Lee, K. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_36 · Cited by 455
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
FOGGIA, P., PERCANNELLA, G., & VENTO, M. (2014) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001414500013 · Cited by 337
Data Fusion and Multicue Data Matching by Diffusion Maps
Lafon, S., Keller, Y., & Coifman, R. R. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.223 · Cited by 312
“[24] align weighted and unweighted graphs by computing a “signature” for each node that is based on repeated use of the invariant measure of different Markov chains defined on the data.”
BackgroundSub-Markov Random Walk for Image Segmentation
Dong, X., Shen, J., Shao, L., & Van Gool, L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2505184 · Cited by 208
“RANDOM walk (RW) has been widely used for many different tasks in computer vision and machine learning, such as segmentation [20], [23], [28], [35], clustering [19], [25], ranking [13], [31], classification [10], [41] and the other applications [1], [13], [18], [22], [26], [33].”
Method
Metadata
- Authors
- Gori, M., Maggini, M., & Sarti, L.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-07
- Volume
- 27
- Issue
- 7
- Pages
- 1100-1111
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2097746044
- Cited by
- 160
- References
- 2
- FWCI
- 10.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exact and approximate graph matching using random walks. https://app.cochat.ai/papers/10.1109/tpami.2005.138
- The paper
- Gori, M., Maggini, M., & Sarti, L. (2005). Exact and approximate graph matching using random walks. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2005.138
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.