CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThe RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between the matching nodes. In this paper we propose an improved version of the original algorithm, the RW2 algorithm, which progressively expands the node signatures by a recursive visit of the node descendants and ancestors to disambiguate the colliding signatures. The experimental results, performed on a benchmark dataset, show that the new algorithm attains a better matching rate with almost the same computational cost as the original one.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
| Titolo: | The RW2 Algorithm for Exact Graph Matching |
| Autori: | |
| Anno: | 2005 |
| Citazione: | Gori, M., Maggini, M., & Sarti, L. (2005). The RW2 Algorithm for Exact Graph Matching. In Proceedings of the 3rd International Conference on Advances in Pattern Recognition (ICAPR 2005) (pp.81-88). |
| Abstract: | The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between the matching nodes. In this paper we propose an improved version of the original algorithm, the RW2 algorithm, which progressively expands the node signatures by a recursive visit of the node descendants and ancestors to disambiguate the colliding signatures. The experimental results, performed on a benchmark dataset, show that the new algorithm attains a better matching rate with almost the same computational cost as the original one. |
| Handle: | http://hdl.handle.net/11365/36056 |
| ISBN: | 9783540287575 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| ICAPR05.pdf | Post-print | NON PUBBLICO - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11365/36056
Copyright © 2019