Node relevance scoring in linked data graphs
Abstract:
Technique to determine relative relevance of pairs of nodes in a linked data graph, such as an RDF graph, including calculation of raw relevance scores (which are based upon adjacency relations between nodes after edge filtering, the incoming and outgoing degrees of nodes in the graph after the edge filtering, and the distance (or weight) values of the edge(s)) and/or “refined relevance scores,” which take into account “complementary nodes.”
Public/Granted literature
Information query
Patent Agency Ranking
0/0