Centrality-based ranking for RDF nodes

Printer-friendly version


This work focuses on finding ways to sort nodes of an RDF graph in a "relevant" order. By relevant we mean some reasonable order, generally accepted by people with expertise in the information represented in the graph. We base our method on what is called the closeness centrality.

Finding the centrality for every node in a graph is equivalent to solving the All-Pairs Shortest Path problem. Our current solution is based on Dijkstra's algorithm and has complexity O(nm log(n)) where n is the number of nodes and m is the number of edges. This approach allows us to solve the problem in a parallelized platform improving the speed.


DateCreated ByLink
March 14, 2013
Patrick WestDownload