A method to rank nodes in an RDF graph

CEUR Workshop Proceedings

Volumn 401, Issue , 2008, Pages

  Graves, Alvaro ^a   Adali, Sibel ^a   Hendler, James ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REPRESENTATIONS; ERRONEOUS DATUM; GLOBAL PROPERTIES; GRAPH-THEORETIC; INFORMATIVE NESS; KNOWLEDGE DOMAINS; RANKING METHODS; SEMANTIC INFORMATION;

GRAPH THEORY;

EID: 84885572739     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. B. Aleman-Meza. Searching and ranking documents based on semantic relationships. 22nd International Conference on Data Engineering Workshops (ICDEW'06), page 5, Mar 2006.
2. B. Aleman-Meza, C. Halaschek-Weiner, and I. Arpinar. Ranking complex relationships on the semantic web. IEEE Internet Computing, Jan 2005.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
4. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, Jan 1959.
5. D. Eppstein and J. Wang. Fast approximation of centrality. Proceedings of the twelfth annual ACM-SIAM symposium on..., Jan 2001.
6. N.-T. format. www.w3.org/tr/rdf-testcases/#ntriples.
7. D. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM (JACM), 24(1): 1-13, 1977.
8. R. R. parser library. librdf.org/raptor/.
9. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, page 4, Oct 1999.
10. J. Sibeyn. External matrix multiplication and all-pairs shortest path. Information Processing Letters, Jan 2004.