Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/4342
Title: Using proximity to compute semantic relatedness in RDF graphs
Authors: José Paulo Leal
Issue Date: 2013
Abstract: Extracting the semantic relatedness of terms is an important topic in several areas, including data mining, information retrieval and web recommendation. This paper presents an approach for computing the semantic relatedness of terns in RDF graphs based on the notion of proximity. It proposes a formal definition of proximity in terms of the set paths connecting two concept nodes, and an algorithm for finding this set and computing proximity with a given error margin. This algorithm was implemented on a tool called Shakti that extracts relevant ontological data for a given domain from DBpedia - a community effort to extract structured data from the Wikipedia. To validate the proposed approach Shakti was used to recommend web pages on a Portuguese social site related to alternative music and the results of that experiment are also reported.
URI: http://repositorio.inesctec.pt/handle/123456789/4342
http://dx.doi.org/10.2298/csis121130060l
metadata.dc.type: article
Publication
Appears in Collections:CRACS - Other Publications

Files in This Item:
File Description SizeFormat 
P-006-JVA.pdf379.12 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.