Name That Graph. Name That Graph or the need to provide a model and syntax extension to specify the provenance of RDF graphs. Fabien Gandon (Twitter @fabien_gandon) and Olivier Corby, INRIA, W3C Member PDF Version. When querying or reasoning on metadata from the semantic web, the source of this metadata as well as a number of other characteristics (date, trust, etc.) can be of great importance. When querying or reasoning on metadata from the semantic web, the provenance of this metadata can be of great importance.
The Missing link In SPARQL [13] when querying a collection of graphs, the GRAPH keyword is used to match patterns against named graphs. 01. 02. 03. 06. 07. ? Figure 1. Unfortunately the syntax of a SPARQL source has no equivalent in terms of the RDF syntax. RDF provides constructs to write reification quads [14] but in RDF asserting the reification is not the same as asserting the original statement, and neither implies the other. Named graphs, nested graphs and Context 01. 06. 07. 08. 09. 11. 12.
Exploitation du RDF et du LOD. Maintenance du LOD. SPARQL + pubsubhubbub = sparqlPuSH | Alexandre Passant. Alimenter le LOD. Retour/Résumé WWW2010. An Empirical Study of owl:sameAs Use in Linked Data - Web Scienc. Ding, Li and Shinavier, Joshua and Finin, Tim and McGuinness, Deborah L. (2010) owl:sameAs and Linked Data: An Empirical Study. In: Proceedings of the WebSci10: Extending the Frontiers of Society On-Line, April 26-27th, 2010, Raleigh, NC: US. Linked Data is a steadily growing presence on the Web. In Linked Data, the description of resources can be obtained incrementally by dereferencing the URIs of resources via the HTTP protocol. The use of owl:sameAs further enriches the Linked Data space by declaratively supporting distributed semantic data integration at the instance level. When consuming Linked Data, users should be careful when handling owl:sameAs: in that URIs linked by owl:sameAs may not be appropriate for simple aggregation, and that recursively exploring owl:sameAs may lead to considerable network overhead.
In this work, we discuss and conduct an empirical pilot study on the usage of owl:sameAs in the Linked Data community. Repository Staff Only: item control page. Interoperate with whom? Formality, Archaeology and the Semantic. Raleigh: Technical Papers. Wednesday, 2:00 – 3:30 PM Classification-Enhanced Ranking [PDF] Paul N. Bennett, Krysta Svore, Susan Dumais Ranking Specialization for Web Search: A Divide-and-Conquer Approach by Using Topical RankSVM Jiang Bian, Xin Li, Fan Li, Zhaohui Zheng, Hongyuan Zha Generalized Distances between Rankings Ravi Kumar, Sergei Vassilvitskii Predicting Positive and Negative Links in Online Social Networks [PDF] Jure Leskovec, Daniel Huttenlocher, Jon Kleinberg Empirical Comparison of Algorithms for Network Community Detection Jure Leskovec, Kevin Lang, Michael Mahoney [PDF] Modeling Relationship Strength in Online Social Network [PDF] Rongjing Xiang, Jennifer Neville, Monica Rogati Collaborative Location and Activity Recommendations with GPS History Data [PDF] Vincent W.
Find Me If You Can: Improving Geographical Prediction with Social and Spatial Proximity [PDF] Lars Backstrom, Eric Sun, Cameron Marlow Equip Tourists with Knowledge Mined from Travelogues [PDF] Qiang Hao, Rui Cai, Changhu Wang, Lei Zhang. Raleigh: Tutorials. Raleigh: Demonstrations. Raleigh: Posters. Browse by Events. Browse by Events.