Skip to main content
Conference ProceedingsOPEN ACCESS

Error-tolerant RDF subgraph matching for adaptive presentation of linked data on mobile

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8465 LNCS 36-51
DOI: 10.1007/978-3-319-07443-6_4
3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 finds 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. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Costabello, L. (2014). Error-tolerant RDF subgraph matching for adaptive presentation of linked data on mobile. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8465 LNCS, pp. 36–51). Springer Verlag. https://doi.org/10.1007/978-3-319-07443-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free