Similarity-based Browsing over Linked Open Data

Details Similarity-based Browsing over Linked Open Data Similarity-based Browsing over Linked Open Data

2011-06-21

arxiv.org/abs/1106.4176v1

Computer Science

Digital Libraries

Scientific paper

An increasing amount of data is published on the Web according to the Linked Open Data (LOD) principles. End users would like to browse these data in a flexible manner. In this paper we focus on similarity-based browsing and we introduce a novel method for computing the similarity between two entities of a given RDF/S graph. The distinctive characteristics of the proposed metric is that it is generic (it can be used to compare nodes of any kind), it takes into account the neighborhoods of the nodes, and it is configurable (with respect to the accuracy vs computational complexity tradeoff). We demonstrate the behavior of the metric using examples from an application over LOD. Finally, we generalize and elaborate on implementation approaches harmonized with the distributed nature of LOD which can be used for computing the most similar entities using neighborhood-based similarity metrics.

Affiliated with

Also associated with

No associations

Rating

Similarity-based Browsing over Linked Open Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Similarity-based Browsing over Linked Open Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-based Browsing over Linked Open Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178478