REVIEW
Ranking RDF Instances in Degree-decoupled RDF Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Ranking RDF Instances in Degree-decoupled RDF Graphs
read the original abstract
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.