Ranking RDF Instances in Degree-decoupled RDF Graphs

09/05/2018 ∙ by Elisa S. Menendez, et al. ∙ 0

In the last decade, RDF emerged as a new kind of standardized data model, and a sizable body of knowledge from fields such as Information Retrieval was adapted to RDF graphs. One common task in graph databases is to define an importance score for nodes based on centrality measures, such as PageRank and HITS. The majority of the strategies highly depend on the degree of the node. However, in some RDF graphs, called degree-decoupled RDF graphs, the notion of importance is not directly related to the node degree. Therefore, this work first proposes three novel node importance measures, named InfoRank I, II and III, for degree-decoupled RDF graphs. It then compares the proposed measures with traditional PageRank and other familiar centrality measures, using with an IMDb dataset.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.