Hechen Liu & Markus Schneider Department of Computer and Information Science and Engineering University of Florida Balloon: Representing and Querying the.

Slides:



Advertisements
Similar presentations
Answering Approximate Queries over Autonomous Web Databases Xiangfu Meng, Z. M. Ma, and Li Yan College of Information Science and Engineering, Northeastern.
Advertisements

Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
PAPER BY : CHRISTOPHER R’E NILESH DALVI DAN SUCIU International Conference on Data Engineering (ICDE), 2007 PRESENTED BY : JITENDRA GUPTA.
Getting started with ML ML is a functional programming language. ML is statically typed: The types of literals, values, expressions and functions in a.
Some computational aspects of geoinformatics Mike Worboys NCGIA, University of Maine, USA.
SA-1 Probabilistic Robotics Planning and Control: Partially Observable Markov Decision Processes.
STUN: SPATIO-TEMPORAL UNCERTAIN (SOCIAL) NETWORKS Chanhyun Kang Computer Science Dept. University of Maryland, USA Andrea Pugliese.
1. Algorithms for Inverse Reinforcement Learning 2
Effectively Indexing Uncertain Moving Objects for Predictive Queries School of Computing National University of Singapore Department of Computer Science.
A Generic Framework for Handling Uncertain Data with Local Correlations Xiang Lian and Lei Chen Department of Computer Science and Engineering The Hong.
Probabilistic Cardinal Direction Queries On Spatio-Temporal Data Ganesh Viswanathan Midterm Project Report CIS 6930 Data Science: Large-Scale Advanced.
Time-dependent Similarity Measure of Queries Using Historical Click- through Data Qiankun Zhao*, Steven C. H. Hoi*, Tie-Yan Liu, et al. Presented by: Tie-Yan.
Spatio-Temporal Databases
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
1 Location Information Management and Moving Object Databases “Moving Object Databases: Issues and Solutions” Ouri, Bo, Sam and Liqin.
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger Department of Computer.
Lecture 4B Page A Discrete Model The task: Define finite representations for all the types of the abstract model (and map these into data structures.
1 The t table provides critical value for various probabilities of interest. The form of the probabilities that appear in Appendix B are: P(t > t A, d.f.
1 A DATA MINING APPROACH FOR LOCATION PREDICTION IN MOBILE ENVIRONMENTS* by Gökhan Yavaş Feb 22, 2005 *: To appear in Data and Knowledge Engineering, Elsevier.
The Tornado Model: Uncertainty Model for Continuously Changing Data Byunggu Yu 1, Seon Ho Kim 2, Shayma Alkobaisi 2, Wan Bae 2, Thomas Bailey 3 Department.
Indexing Spatio-Temporal Data Warehouses Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zhang Department of Computer Science Hong Kong University of Science.
Semantic Representation of Temporal Metadata in a Virtual Observatory Han Wang 1 Eric Rozell 1
Presenter: Miguel Garzon Torres CrUise Lab - SITE SQL Coverage Measurement for Testing Database Applications María José Suárez-Cabal University of Oviedo.
Integrating Multi-Media with Geographical Information in the BORG Architecture R. George Department of Computer Science Clark Atlanta University Atlanta,
Predicting Missing Provenance Using Semantic Associations in Reservoir Engineering Jing Zhao University of Southern California Sep 19 th,
OMAP: An Implemented Framework for Automatically Aligning OWL Ontologies SWAP, December, 2005 Raphaël Troncy, Umberto Straccia ISTI-CNR
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
Semantic modeling of System Requirements Lunch Lieke Verhelst MSc Student for GIMA Feb 27 th 2009.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 10.2.
Semantic Streams: a Framework for Composable Semantic Interpretation of Sensor Data Kamin Whitehouse UC Berkeley EWSN, Feb 13, 2006 Joint with Feng Zhao.
DBSQL 3-1 Copyright © Genetic Computer School 2009 Chapter 3 Relational Database Model.
General Database Statistics Using Maximum Entropy Raghav Kaushik 1, Christopher Ré 2, and Dan Suciu 3 1 Microsoft Research 2 University of Wisconsin--Madison.
Statistics for Managers Using Microsoft Excel, 5e © 2008 Pearson Prentice-Hall, Inc.Chap 8-1 Statistics for Managers Using Microsoft® Excel 5th Edition.
A Survey Based Seminar: Data Cleaning & Uncertain Data Management Speaker: Shawn Yang Supervisor: Dr. Reynold Cheng Prof. David Cheung
Department of Computer Science City University of Hong Kong Department of Computer Science City University of Hong Kong 1 Probabilistic Continuous Update.
Discrete Distributions The values generated for a random variable must be from a finite distinct set of individual values. For example, based on past observations,
Modeling Storing and Mining Moving Object Databases Proceedings of the International Database Engineering and Applications Symposium (IDEAS’04) Sotiris.
1 Spatio-Temporal Predicates Martin Erwig and Markus Schneider IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING Presented by Mamadou Hassimiou Diallo.
INFERRING HUMAN ACTIVITY FROM GPS TRACKS Sun Simiao.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Uncertainty Management in Rule-based Expert Systems
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
Issues in Ontology-based Information integration By Zhan Cui, Dean Jones and Paul O’Brien.
DeepDive Model Dongfang Xu Ph.D student, School of Information, University of Arizona Dec 13, 2015.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Calculating frequency moments of Data Stream
1 Complex Spatio-Temporal Pattern Queries Cahide Sen University of Minnesota.
An Ontological Approach to Financial Analysis and Monitoring.
Modeling Security-Relevant Data Semantics Xue Ying Chen Department of Computer Science.
Using Bayesian Networks to Predict Plankton Production from Satellite Data By: Rob Curtis, Richard Fenn, Damon Oberholster Supervisors: Anet Potgieter,
A Level Computing#BristolMet Session Objectives#U2S11 MUST identify built-in string manipulation functions SHOULD correctly use string manipulation functions.
Toward Entity Retrieval over Structured and Text Data Mayssam Sayyadian, Azadeh Shakery, AnHai Doan, ChengXiang Zhai Department of Computer Science University.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Quantum Mechanics. Electromagnetic Spectrum Visible Spectrum.
L1-S1 Infinite R-DB 2003 SJSU -- CmpE Database Design Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San.
Maitrayee Mukerji. INPUT MEMORY PROCESS OUTPUT DATA INFO.
Advanced Database Aggregation Query Processing
OPERATING SYSTEMS CS 3502 Fall 2017
Simulation based verification: coverage
GC211Data Structure Lecture2 Sara Alhajjam.
Associative Query Answering via Query Feature Similarity
Lecture 16: Probabilistic Databases
CLUSTER BY: A NEW SQL EXTENSION FOR SPATIAL DATA AGGREGATION
Knowledge-based event recognition from salient regions of activity
Chapter 2: Intro to Relational Model
Probabilistic Databases
Programming Concepts and Database
Tantan Liu, Fan Wang, Gagan Agrawal The Ohio State University
Using Clustering to Make Prediction Intervals For Neural Networks
Presentation transcript:

Hechen Liu & Markus Schneider Department of Computer and Information Science and Engineering University of Florida Balloon: Representing and Querying the Near Future Movement of Predictive Moving Objects 1st ACM SIGSPATIAL International Workshop on Spatial Semantics and Ontologies (SSO) 2011

Motivation Moving objects (cars, animals, and hurricanes) are ubiquitous. Their movements are observed and represented, for example, by means of trajectories: Such movements can be stored in moving objects databases (MOD) Trajectory of Hurricane Katrina, indicating the strength of the hurricane as it moved first west, then north

Problem How can we represent and query the movement of spatial objects in the future? The locations of a moving object in the future are uncertain. All possible locations are within a region. Position now Possible positions later

Goals and Solutions Our goal is to represent and query the spatio- temporal uncertainty in the near future Related work Examples: 3D cylinder model, space-time prism model Models assume a maximum speed constraint

Goals and Solutions The speeds in the future may vary largely from the previous ones, and are difficult to predict On the other hand, it is not the task of the database designer or GIS expert to make predictions. It is the task of a domain scientist to design prediction models and to determine the relevant input parameters of these models.

Balloon Model: Representing Near Future Movement Afflicted with Uncertainty Represent the movement in the 2D+time space Historical movement: at a time instant, the function returns a location in the 2D space Future movement: at a specific time instant, the possible location is a single point that can be anywhere in a region x y t now x y t t1t1 t2t2 t3t3

Balloon Model: Representing Near Future Movement Afflicted with Uncertainty Combine the historical and future movements together The historical movement corresponds to the string of the balloon The future movement corresponds to the body of the balloon

Balloon Model: Representing Near Future Movement Afflicted with Uncertainty How to represent the uncertainty? Confidence distribution function: Shows how the confidence is distributed over the 2D space Shows the degree of certainty that a spatial object (point or region) will be the future location of the moving point Each point is associated with a confidence distribution value The confidence of a region S to represent the possible locations of a moving region can be calculated as Example: How certain is it that hurricane Katrina will enter Florida?

Balloon Model: Representing Near Future Movement Afflicted with Uncertainty Different confidence distribution functions within a region

Representation of Balloon Objects A balloon object bo in the database is represented by a finite set of tuples, or slices bo =

Representing the Uncertainty Confidence_at A value between [0,1] which shows the degree of certainty that a region will be traversed by a balloon object at a time instance. Let at_future_instance operation return the uncertain region of the moving point at a specific time in the future. Input: A balloon object bo, a region r, a time instance t Output: A decimal number d between [0,1] Method: confidence_at (bo, r, t) 1 c := 0 2 if t > now 3 r 1 := at_future_instant(bo, t); 4 r 0 := intersection(r, r 1 ); 5 c := Integrate over all (x, y) in r 0 with bo.cdf 6 return c 7 end

Predicates on Balloon Objects Had_crossed Indicates whether a moving point had entered and then left a specific region in the given time interval Assume temporal_selection selects part of the moving object within a specific time interval Input: A balloon object bo, a region r, an interval I, Output: A boolean value Method: had_crossed(bo, r, I) 1 if I.t2 >= now then return false; 2 bo’ := temporal_selection(bo, I) 3 sa := the first slice in bo’; 4 sb := the last slice in bo’; 5 if inside(sa.p, r) or inside(sb.p, r)then return false; 6 while disjoint(sa.p, r) do sa := get_next_slice(sa); 7 while disjoint(sb.p, r) do sb := get_prev_slice(sb); 8 if sa.t <= sb.t and inside(sa.p, r) then return true else return false; 9 end

Predicates on Balloon Objects Possibly_enter The confidence that the moving object will enter the region in the future is not less than 0.25 Similar terms: likely (confidence ≥0.5), probably (confidence ≥ 0.75) Input A balloon object bo, a region r, an interval I, Output A boolean value Method possibly_enter (bo,r,I) 1 max_conf := 0 2 if I.t1 0 or confidence_at(bo, r, I.t2) = 0 then 3 return false; 4 bo’ := temporal_selection(bo, I) 5 foreach slice s in bo’ do 7 conf := confidence_at(bo1,r, s.t); 8if conf > max_conf then max_conf := conf 9 endfor; 10 return max_conf >= end

Predicates on Balloon Objects The had_crossed (a) and possibly_enter (b) predicates

Query Example on Balloon Objects Goal: Enable users to query predicted and uncertain future movements using an SQL-like query language Confidence distribution functions have to be provided by domain scientists Assume we have the following schema hurricanes(name: string, eye: balloon, life: range) Cities(name: string, extent: region) The query “Find all cities that will possibly be traversed by Katrina between 25 Aug 2007 and 27 Aug 2007” SELECTc.name FROM hurricanes h, cities c WHERE possibly_enter(h.eye,c.extent, interval(‘ ’,’ ’)) and h.name=‘Katrina’;

Conclusions and Future Work We address the problem of modeling and querying the uncertainty of a moving object in the near future We introduce the balloon model to represent the historical and future movements We define some important operations and predicates which can enable users to query the future movements of moving objects in a database context Plan: Implementation of an entire type system for this balloon model in the future