Matches in ScholarlyData for { ?s ?p ?o. }
- 68 type InProceedings.
- 68 label "Plan-Based Semantic Enrichment of Event Streams".
- 68 sameAs 68.
- 68 abstract "Background knowledge about the application domain can be used in event processing in order to improve processing quality. The idea of semantic enrichment is to incorporate background knowledge into events, thereby generating enriched events which in the next processing step can be better understood by event processing engines. In this paper, we present an efficient technique for event stream enrichment by planning multi-step event enrichment and processing. Our optimization goal is to minimize event enrichment costs while meeting application-specific service expectations. The event enrichment is optimized to avoid unnecessary event stream enrichment without missing any complex events of interest. Our experimental results shows that by using this approach it is possible to reduce the knowledge acquisition costs.".
- 68 hasAuthorList authorList.
- 68 isPartOf proceedings.
- 68 keyword "knowledge-based complex event processing".
- 68 keyword "semantic complex event processing".
- 68 keyword "semantic enrichment of event streams".
- 68 title "Plan-Based Semantic Enrichment of Event Streams".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent kia-teymourian.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent adrian-paschke.
- item-2 previous item-1.
- 73 creator ansgar-scherp.
- 73 creator stefan-scheglmann.
- 73 creator thomas-gottron.
- 73 type InProceedings.
- 73 label "Providing Alternative Declarative Descriptions for Entity Sets using Parallel Concept Lattices".
- 73 sameAs 73.
- 73 abstract "Abstract We propose an approach for modifying a declarative description of a set of entities (e.g., a SPARQL query) for the purpose of finding alternative declarative descriptions of the entities. Such a shift in representation can help to get new insights into the data, to discover related attributes, or to find a more con- cise description of the entities of interest. Allowing the alternative descriptions furthermore to be close approximations of the original entity set leads to more flexibility in finding such insights. Our approach is based on the construction of parallel formal concept lattices over different sets of attributes for the same en- tities. Between the formal concepts in the parallel lattices, we define mappings which constitute approximations of the extent of the concepts. In this paper, we formalize the idea of two types of mappings between formal concept lattices, provide an implementation of these mappings and evaluate their ability of finding alternative descriptions on several real-world RDF data sets for one concrete set- ting of finding alternative descriptions for entities described by RDF class types which are based on properties.".
- 73 hasAuthorList authorList.
- 73 isPartOf proceedings.
- 73 keyword "Declarative description".
- 73 keyword "Formal concept analysis".
- 73 keyword "alternative representation".
- 73 title "Providing Alternative Declarative Descriptions for Entity Sets using Parallel Concept Lattices".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent thomas-gottron.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ansgar-scherp.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stefan-scheglmann.
- item-3 previous item-2.
- 76 creator david-celestin-faye.
- 76 creator dominique-revuz.
- 76 creator guillaume-blin.
- 76 creator olivier-cure.
- 76 type InProceedings.
- 76 label "WaterFowl: a Compact, Self-indexed and Inference-enabled RDF Store".
- 76 sameAs 76.
- 76 abstract "In this paper, we present a novel approach – called WaterFowl – for the storage of RDF triples that addresses some key issues in the contexts of big data and the Semantic Web. The architecture of our prototype, largely based on the use of succinct data structures, enables the representation of triples in a self-indexed, compact manner without requiring decompression at query answering time. Moreover, it is adapted to efficiently support RDF and RDFS entailment regimes thanks to an optimized encoding of ontology concepts and properties that does not require a complete inference materialization or extensive query rewriting algorithms. This approach implies to make a distinction between the ter- minological and the assertional components of the knowledge base early in the process of data preparation, i.e., preprocessing the data before storing it in our structures. The paper describes the complete architec- ture of this system and presents some preliminary results obtained from evaluations conducted on our first prototype.".
- 76 hasAuthorList authorList.
- 76 isPartOf proceedings.
- 76 keyword "Compression".
- 76 keyword "RDF store".
- 76 keyword "RDFS reasoning".
- 76 keyword "Succinct data structures".
- 76 keyword "self-index".
- 76 title "WaterFowl: a Compact, Self-indexed and Inference-enabled RDF Store".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent olivier-cure.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent guillaume-blin.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dominique-revuz.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent david-celestin-faye.
- item-4 previous item-3.
- 80 creator andreas-kasten.
- 80 creator ansgar-scherp.
- 80 creator peter-schauss.
- 80 type InProceedings.
- 80 label "A Framework for Iterative Signing of Graph Data on the Web".
- 80 sameAs 80.
- 80 abstract "Existing algorithms for signing graph data typically do not cover the whole signing process. In addition, they lack distinctive features such as signing graph data at different levels of granularity, iterative signing of graph data, and signing multiple graphs. In this paper, we introduce a novel framework for signing arbitrary graph data provided, e.g., as RDF(S), Named Graphs, or OWL. We conduct an extensive theoretical and empirical analysis of the runtime and space complexity of different framework configurations. The experiments are performed on synthetic and real-world graph data of different size and different number of blank nodes. We investigate security issues, present a trust model, and discuss practical considerations for using our signing framework.".
- 80 hasAuthorList authorList.
- 80 isPartOf proceedings.
- 80 keyword "authenticity of graph data".
- 80 keyword "digital signature".
- 80 keyword "integrity of graph data".
- 80 keyword "semantic web security".