Error-Tolerant RDF Subgraph Matching for Adaptive Presentation of Linked Data on Mobile
published: July 30, 2014, recorded: May 2014, views: 18
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We present PRISSMA, a context-aware presentation layer for Linked Data. PRISSMA extends the Fresnel vocabulary with the notion of mobile context. Besides, it includes an algorithm that determines whether the sensed context is compatible with some context declarations. The algorithm nds optimal error-tolerant subgraph isomorphisms between RDF graphs using the notion of graph edit distance and is sublinear in the number of context declarations in the system
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !