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. While the SPARQL query language provides a keyword to match patterns against named graphs, the RDF data model focuses on expressing triples. 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  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. Likewise, statements can be made using the URI of a document as commonly done by annotations in OWL. 01.
Exploitation du RDF et du LOD. Maintenance du LOD. SPARQL + pubsubhubbub = sparqlPuSH. There have been lots of discussion recently regarding dynamics and notification in the Semantic Web realm, including various vocabularies for describing changes and approaches for notifying them – as Leigh recently blogged about it . Last month, while visiting Kno.e.sis , Pablo an I worked on an approach using pubsubhubbub for RDF changes notification, that I’m happy to announce today. The result is sparqlPuSH , an interface that can be plugged on any SPARQL endpoint and that broadcast notifications to clients interested in what’s happening in the store using the pubsubhubbub protocol. At a glance, anyone can register a particular query to the RDF store (e.g. list all microblog posts, or list any changes made by X, using the Changesets vocabulary ) and results are provided in an RSS / Atom feed that is then sync-ed using pubsubhubbub: each time new data corresponding the register query is added into the store, the store itself notifies the interested parties of such updates.
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. 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.
Raleigh: Tutorials. Raleigh: Demonstrations. Raleigh: Posters. Browse by Events. Browse by Events.