A Spatio-Temporal Linked Data Representation for Modeling Spatio-Temporal Dialect Data

Author(s):  
Johannes Scholz ◽  
Emanual Hrastnig ◽  
Eveline Wandl-Vogt
Algorithms ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 182
Author(s):  
Elias Dritsas ◽  
Andreas Kanavos ◽  
Maria Trigka ◽  
Gerasimos Vonitsanos ◽  
Spyros Sioutas ◽  
...  

Privacy Preserving and Anonymity have gained significant concern from the big data perspective. We have the view that the forthcoming frameworks and theories will establish several solutions for privacy protection. The k-anonymity is considered a key solution that has been widely employed to prevent data re-identifcation and concerns us in the context of this work. Data modeling has also gained significant attention from the big data perspective. It is believed that the advancing distributed environments will provide users with several solutions for efficient spatio-temporal data management. GeoSpark will be utilized in the current work as it is a key solution that has been widely employed for spatial data. Specifically, it works on the top of Apache Spark, the main framework leveraged from the research community and organizations for big data transformation, processing and visualization. To this end, we focused on trajectory data representation so as to be applicable to the GeoSpark environment, and a GeoSpark-based approach is designed for the efficient management of real spatio-temporal data. Th next step is to gain deeper understanding of the data through the application of k nearest neighbor (k-NN) queries either using indexing methods or otherwise. The k-anonymity set computation, which is the main component for privacy preservation evaluation and the main issue of our previous works, is evaluated in the GeoSpark environment. More to the point, the focus here is on the time cost of k-anonymity set computation along with vulnerability measurement. The extracted results are presented into tables and figures for visual inspection.


The data in the organization is distributed among multiple structured databases. The large database makes the process of risk analysis difficult, as data is distributed in the organization. Information gathering for Risk analysis is more subjective and therefore, processing incomplete information over distributed databases increase more fault in risk analysis. Linked Data representation helps to make structured, distributed data more related, combined and ready to be processed. Linked Data approach makes data interlinked and semantically rich, extracting meaning with the use of machines and eliminating the human subjectivity factor in assessing insurance risk. Using Linked data, information retrieval process can be easier as data or databases interlinked semantically. The proposed technique uses a linked data approach for risk analysis and related information retrieval methods over structured data. The work efficiency is also tested and found to be good


2018 ◽  
Vol 1 ◽  
pp. 1-6
Author(s):  
Ieva Dobraja ◽  
Menno-Jan Kraak ◽  
Yuri Engelhardt

Since the movement data exist, there have been approaches to collect and analyze them to get insights. This kind of data is often heterogeneous, multiscale and multi-temporal. Those interested in spatio-temporal patterns of movement data do not gain insights from textual descriptions. Therefore, visualization is required. As spatio-temporal movement data can be complex because size and characteristics, it is even challenging to create an overview of it. Plotting all the data on the screen will not be the solution as it likely will result into cluttered images where no data exploration is possible. To ensure that users will receive the information they are interested in, it is important to provide a graphical data representation environment where exploration to gain insights are possible not only in the overall level but at sub-levels as well. A dashboard would be a solution the representation of heterogeneous spatio- temporal data. It provides an overview and helps to unravel the complexity of data by splitting data in multiple data representation views. The adaptability of dashboard will help to reveal the information which cannot be seen in the overview.


Author(s):  
B. Margan ◽  
F. Hakimpour

Abstract. Linked Data is available data on the web in a standard format that is useful for content inspection and insights deriving from data through semantic queries. Querying and Exploring spatial and temporal features of various data sources will be facilitated by using Linked Data. In this paper, an application is presented for linking transport data on the web. Data from Google Maps API and OpenStreetMap linked and published on the web. Spatio-Temporal queries were executed over linked transport data and resulted in network and traffic information in accordance with the user’s position. The client-side of this application contains a web and a mobile application which presents a user interface to access network and traffic information according to the user’s position. The results of the experiment show that by using the intrinsic potential of Linked Data we have tackled the challenges of using heterogeneous data sources and have provided desirable information that could be used for discovering new patterns. The mobile GIS application enables assessing the profits of mentioned technologies through an easy and user-friendly way.


Author(s):  
Manish Kumar Mehrotra ◽  
Suvendu Kanungo

: Resource description framework (RDF) is the de-facto standard language model for semantic data representation on Semantic Web. Designing an efficient management of RDF data with huge volume and efficient querying techniques are the primary research areas in semantic web. So far, several RDF management methods have been offered with data storage designs and query processing algorithms for data retrieval. We propose a Bio-inspired Holistic Matching based Linked Data Clustering (BHM-LDC) which works based on RDF data storing, clustering the linked data and web service discovery. Initially the BHM-LDC algorithm store the RDF dataset as graph based linked data. Then, an Integrated Holistic Entity Matching based Distributed Genetic Algorithm (IHEM-DGA) is proposed to cluster the linked data. Finally, modified sub-graph matching based Web Service Discovery Algorithm uses the clustered triples to find the best web services. The performance of the proposed web service discovery approach is established by business RDF dataset.


Author(s):  
A. Caselli ◽  
G. Falquet ◽  
C. Métral

Abstract. In the recent years the concept of knowledge graph has emerged as a way to aggregate information from various sources without imposing too strict data modelling constraints. Several graph models have been proposed during the years, ranging from the “standard” RDF to more expressive ones, such as Neo4J and RDF-star. The adoption of knowledge graph has become established in several domains. It is for instance the case of the 3D geoinformation domain, where the adoption of semantic web technologies has led to several works in data integration and publishing. However, yet there is not a well-defined model or technique to represent 3D geoinformation including uncertainty and time variation in knowledge graphs. In this paper we propose a model to represent parameterized geometries of subsurface objects. The vocabulary of the model has been defined as an OWL ontology and it extends existing ontologies by adding classes and properties to represent the uncertainty and the spatio-temporal behaviour of a geometry, as well as additional attributes, such as the data provenance. The model has been validated on significant use cases showing different types of uncertainties on 3D subsurface objects. A possible implementation is also presented, using RDF-star for the data representation.


2018 ◽  
Vol 7 (3) ◽  
pp. 1286
Author(s):  
Nidha Khanam ◽  
Rupali Sunil Wagh

Graphs or networks very commonly are used to represent connected or linked data. With the penetration of www in every sphere of life networked relationships can be easily established through communication links over web and network and graph analysis come as obvious choices of data representation and analysis. There are processes which can be analysed as network not through web but through the knowledge links available in these domains. In both these cases network analysis is challenged by the enormous size of the network in terms of nodes and links. Sub graph sampling can effectively be employed on large network structures to reduce the size of data while preserving the original properties of the network. Through this paper authors present a case study on application of sub graph sampling approach to obtain reduced case citation network in legal domain.  


Sign in / Sign up

Export Citation Format

Share Document