Using proximity to compute semantic relatedness in RDF graphs

• Type: Article in International Scientific Journal
• Date: 2013

Authors

Jose Paulo Leal (Author) FCUP

Journal

Title: Computer Science and Information Systems

Vol. 10

Pages: 1727-1746

ISSN: 1820-0214

Publisher: ComSIS Consortium

Indexing

ISI Web of Knowledge - 10 Citations

Scopus - 16 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-006-JVA

DOI: 10.2298/csis121130060l

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 20