SRank: Shortest paths as distance between nodes of a graph with application to RDF clustering

Hadi Khosravi Farsani, Mohammad Ali Nematbakhsh, Georg Lausen. SRank: Shortest paths as distance between nodes of a graph with application to RDF clustering. J. Information Science, 39(2):198-210, 2013. [doi]

Abstract

Abstract is missing.