Exploring Weighted Property Approaches for RDF Graph Similarity Measure

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Le, Ngoc Luyen, Abel, Marie-Hélène, Gouspillou, Philippe
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914777039634432
author Le, Ngoc Luyen
Abel, Marie-Hélène
Gouspillou, Philippe
author_facet Le, Ngoc Luyen
Abel, Marie-Hélène
Gouspillou, Philippe
contents Measuring similarity between RDF graphs is essential for various applications, including knowledge discovery, semantic web analysis, and recommender systems. However, traditional similarity measures often treat all properties equally, potentially overlooking the varying importance of different properties in different contexts. Consequently, exploring weighted property approaches for RDF graph similarity measure presents an intriguing avenue for investigation. Therefore, in this paper, we propose a weighted property approach for RDF graph similarity measure to address this limitation. Our approach incorporates the relative importance of properties into the similarity calculation, enabling a more nuanced and context-aware measures of similarity. We evaluate our approach through a comprehensive experimental study on an RDF graph dataset in the vehicle domain. Our results demonstrate that the proposed approach achieves promising accuracy and effectively reflects the perceived similarity between RDF graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2404_19052
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Exploring Weighted Property Approaches for RDF Graph Similarity Measure
Le, Ngoc Luyen
Abel, Marie-Hélène
Gouspillou, Philippe
Databases
Information Retrieval
Measuring similarity between RDF graphs is essential for various applications, including knowledge discovery, semantic web analysis, and recommender systems. However, traditional similarity measures often treat all properties equally, potentially overlooking the varying importance of different properties in different contexts. Consequently, exploring weighted property approaches for RDF graph similarity measure presents an intriguing avenue for investigation. Therefore, in this paper, we propose a weighted property approach for RDF graph similarity measure to address this limitation. Our approach incorporates the relative importance of properties into the similarity calculation, enabling a more nuanced and context-aware measures of similarity. We evaluate our approach through a comprehensive experimental study on an RDF graph dataset in the vehicle domain. Our results demonstrate that the proposed approach achieves promising accuracy and effectively reflects the perceived similarity between RDF graphs.
title Exploring Weighted Property Approaches for RDF Graph Similarity Measure
topic Databases
Information Retrieval
url https://arxiv.org/abs/2404.19052