loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Lorenzo Livi ; Guido Del Vescovo and Antonello Rizzi

Affiliation: SAPIENZA University, Italy

Keyword(s): Inexact graph matching, Graph kernels, Tensor product, Graph classification system.

Related Ontology Subjects/Areas/Topics: Classification ; Clustering ; Graphical and Graph-Based Models ; Kernel Methods ; Pattern Recognition ; Similarity and Distance Learning ; Theory and Methods

Abstract: In this paper we propose a novel inexact graph matching procedure called graph coverage, to be used in supervised and unsupervised data driven modeling systems. It relies on tensor product between graphs, since the resulting product graph is known to be able to encode the similarity of the two input graphs. The graph coverage is defined on the basis of the concept of graph weight, computed on the weighted adjacency matrix of the tensor product graph. We report the experimental results concerning two distinct performance evaluations. Since for practical applications the computing time of any inexact graph matching procedure should be feasible, the first tests have been conceived to measure the average computing time when increasing the average size of a random sample of fully-labeled graphs. The second one aims to evaluating the accuracy of the proposed dissimilarity measure when used as the core of a classification system based on the k-NN rule. Overall the graph coverage shows encou raging results as a dissimilarity measure. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.119.111.9

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Livi, L.; Del Vescovo, G. and Rizzi, A. (2012). INEXACT GRAPH MATCHING THROUGH GRAPH COVERAGE. In Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM; ISBN 978-989-8425-98-0; ISSN 2184-4313, SciTePress, pages 269-272. DOI: 10.5220/0003732802690272

@conference{icpram12,
author={Lorenzo Livi. and Guido {Del Vescovo}. and Antonello Rizzi.},
title={INEXACT GRAPH MATCHING THROUGH GRAPH COVERAGE},
booktitle={Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM},
year={2012},
pages={269-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003732802690272},
isbn={978-989-8425-98-0},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM
TI - INEXACT GRAPH MATCHING THROUGH GRAPH COVERAGE
SN - 978-989-8425-98-0
IS - 2184-4313
AU - Livi, L.
AU - Del Vescovo, G.
AU - Rizzi, A.
PY - 2012
SP - 269
EP - 272
DO - 10.5220/0003732802690272
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic