2016 IEEE Tenth International Conference on Research Challenges in Information Science (RCIS) 2016
DOI: 10.1109/rcis.2016.7549333
|View full text |Cite
|
Sign up to set email alerts
|

FreGraPaD: Frequent RDF graph patterns detection for semantic data streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
7
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 19 publications
1
7
0
Order By: Relevance
“…Finally, as the above-described approach relies on traditional data mining techniques for performance pattern discovery and semantic modelling for representation of the results together with the available building data, we compare it to a direct semantic data mining approach using a frequent RDF graph pattern analysis method (Belghaouti et al 2016).…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Finally, as the above-described approach relies on traditional data mining techniques for performance pattern discovery and semantic modelling for representation of the results together with the available building data, we compare it to a direct semantic data mining approach using a frequent RDF graph pattern analysis method (Belghaouti et al 2016).…”
Section: Methodsmentioning
confidence: 99%
“…That requires the selection of relevant ontologies, defining an appropriate mapping language for conversion, selection of continuous query languages and choosing relevant datasets to link to (Llanes et al 2016) (Fig.10). To demonstrate the principle of pattern recognition within the RDF graph structure, we employ a method for frequent RDF graph pattern detection in semantic data streams, which relies on the graph predicates (Belghaouti et al 2016).…”
Section: Rdf Stream Processing and Rdf Graph Pattern Recognitionmentioning
confidence: 99%
See 1 more Smart Citation
“…The following sections explain this architecture focusing on (1) how patterns are discovered and added to the graph, (2) how user profiles can be built and benefit from the system, including feedback, and (3) how recommendations can be generated. We present an example for RDF pattern discovery in a semantic data stream by implementing a method suggested by Belghaouti et al (2016) and discuss its potential feasibility. Finally, we demonstrate an initial implementation of a linked data-based recommender system by applying the concept of Linked Data Semantic Distances proposed by Passant (2010).…”
Section: Conceptual Frameworkmentioning
confidence: 99%
“…subclassOf relations). To analyze how RDF stream processing would affect the recommendation concept, we employ the method described by Belghaouti et al (2016), who identify frequent RDF patterns in RDF streams by mapping the graphs to adjacency matrices based on the graph predicates. Using this method, one is able to construct bit vectors, which describe the graph structure.…”
Section: Listing 1: Namespaces and Prefixes Used In The Following Examentioning
confidence: 99%