Clustering Pipelines of Large RDF POI Data

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Among the various domains using large RDF graphs, applications often rely on geographical information which is often represented via Points Of Interests. In particular, one challenge is to extract patterns from POI sets to discover Areas Of Interest (AOIs). To tackle this challenge, a typical method is to aggregate various points according to specific distances (e.g. geographical) via clustering algorithms. In this study, we present a flexible architecture to design pipelines able to aggregate POIs from contextual to geographical dimensions in a single run. This solution allows any kind of clustering algorithm combinations to compute AOIs and is built on top of a Semantic Web stack which allows multiple-source querying and filtering through SPARQL.

Cite

CITATION STYLE

APA

Dadwal, R., Graux, D., Sejdiu, G., Jabeen, H., & Lehmann, J. (2019). Clustering Pipelines of Large RDF POI Data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11762 LNCS, pp. 24–27). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-32327-1_5

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