Cascading Spatio-Temporal Pattern Discovery P. Mohan, S.Shekhar, J. Shine, J. Rogers CSci 8715 Presented by: Atanu Roy Akash Agrawal.

Slides:



Advertisements
Similar presentations
An Interactive-Voting Based Map Matching Algorithm
Advertisements

Ranking Outliers Using Symmetric Neighborhood Relationship Wen Jin, Anthony K.H. Tung, Jiawei Han, and Wei Wang Advances in Knowledge Discovery and Data.
Mining Frequent Spatio-temporal Sequential Patterns
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
Search Strategies.  Tries – for word searchers, spell checking, spelling corrections  Digital Search Trees – for searching for frequent keys (in text,
Transitioning Experiences with Army Geo Spatial Center (AGC) Pradeep Mohan 4 th Year PhD Student 1.
Constructing Popular Routes from Uncertain Trajectories Authors of Paper: Ling-Yin Wei (National Chiao Tung University, Hsinchu) Yu Zheng (Microsoft Research.
Spatial Frequent Pattern Mining for Crime Analysis
Infinite Horizon Problems
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
Rakesh Agrawal Ramakrishnan Srikant
Data Mining Techniques So Far: Cluster analysis K-means Classification Decision Trees J48 (C4.5) Rule-based classification JRIP (RIPPER) Logistic Regression.
SASB: Spatial Activity Summarization using Buffers Atanu Roy & Akash Agrawal.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Automated Analysis and Code Generation for Domain-Specific Models George Edwards Center for Systems and Software Engineering University of Southern California.
1 SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref Presented by.
Chapter 10: Stream-based Data Management Title: Design, Implementation, and Evaluation of the Linear Road Benchmark on the Stream Processing Core Authors:
Structural Knowledge Discovery Used to Analyze Earthquake Activity Jesus A. Gonzalez Lawrence B. Holder Diane J. Cook.
SSCP: Mining Statistically Significant Co-location Patterns Sajib Barua and Jörg Sander Dept. of Computing Science University of Alberta, Canada.
Fast Algorithms for Association Rule Mining
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
Co-location pattern mining (for CSCI 5715) Charandeep Parisineti, Bhavtosh Rath Chapter 7: Spatial Data Mining [1]Yan Huang, Shashi Shekhar, Hui Xiong.
Data Mining – Intro.
Distributed Constraint Optimization * some slides courtesy of P. Modi
Making Pattern Queries Bounded in Big Graphs 11 Yang Cao 1,2 Wenfei Fan 1,2 Jinpeng Huai 2 Ruizhe Huang 1 1 University of Edinburgh 2 Beihang University.
Modeling, Searching, and Explaining Abnormal Instances in Multi-Relational Networks Chapter 1. Introduction Speaker: Cheng-Te Li
These slides are designed to accompany Software Engineering: A Practitioner’s Approach, 7/e (McGraw-Hill 2009). Slides copyright 2009 by Roger Pressman.1.
Project presentation 1. Agenda Motivation Problem Statement Related Work Proposed Solution Hierarchical routing theory 2.
Discovering Interesting Sub-paths in Spatiotemporal Datasets: A Summary of Results Xun Zhou, Shashi Shekhar, Pradeep Mohan, Stefan Liess, and Peter K.
Interesting Interval Discovery on Spatiotemporal Datasets Csci 8715 Fall 2013.
黃福銘 (Angus F.M. Huang) ANTS Lab, IIS, Academia Sinica TrajPattern: Mining Sequential Patterns from Imprecise Trajectories.
Spatio-temporal frequent pattern mining for public safety: Concepts and Techniques Pradeep Mohan * Department of Computer Science University of Minnesota,
Mapping and analysis for public safety: An Overview.
1 Cascading spatio-temporal pattern discovery: A summary of results Pradeep Mohan¹, Shashi Shekhar¹, James A.Shine², James P.Rogers 2 ¹University of Minnesota,
1 Frequent Subgraph Mining Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY June 12, 2010.
Data Mining – Intro. Course Overview Spatial Databases Temporal and Spatio-Temporal Databases Multimedia Databases Data Mining.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Xiaowei Ying, Xintao Wu Dept. Software and Information Systems Univ. of N.C. – Charlotte 2008 SIAM Conference on Data Mining, April 25 th Atlanta, Georgia.
Spatio-temporal Pattern Queries M. Hadjieleftheriou G. Kollios P. Bakalov V. J. Tsotras.
Group 8: Denial Hess, Yun Zhang Project presentation.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Mining Weather Data for Decision Support Roy George Army High Performance Computing Research Center Clark Atlanta University Atlanta, GA
Query Sensitive Embeddings Vassilis Athitsos, Marios Hadjieleftheriou, George Kollios, Stan Sclaroff.
DISCOVERING SPATIAL CO- LOCATION PATTERNS PRESENTED BY: REYHANEH JEDDI & SHICHAO YU (GROUP 21) CSCI 5707, PRINCIPLES OF DATABASE SYSTEMS, FALL 2013 CSCI.
August 30, 2004STDBM 2004 at Toronto Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets Yoshiharu Ishikawa Yuichi Tsukamoto Hiroyuki.
Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science.
Temporal Database Paper Reading R 資工碩一 馬智釗 Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database, K Huang, C Chang.
Mining Top-K Large Structural Patterns in a Massive Network Feida Zhu 1, Qiang Qu 2, David Lo 1, Xifeng Yan 3, Jiawei Han 4, and Philip S. Yu 5 1 Singapore.
Efficient Computation of Combinatorial Skyline Queries Author: Yu-Chi Chung, I-Fang Su, and Chiang Lee Source: Information Systems, 38(2013), pp
Ephemeral Network Broker to Facilitate Future Mobility Business Models/Transactions A collaboration between Ford University Research Program and University.
1 Lecture 15: Chapter 19 Testing Object-Oriented Applications Slide Set to accompany Software Engineering: A Practitioner’s Approach, 7/e by Roger S. Pressman.
1 Complex Spatio-Temporal Pattern Queries Cahide Sen University of Minnesota.
Generalized Point Based Value Iteration for Interactive POMDPs Prashant Doshi Dept. of Computer Science and AI Institute University of Georgia
Spatial Networks Introduction to Spatial Computing CSE 5ISC Some slides adapted from Shashi Shekhar, University of Minnesota.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Corresponding Clustering: An Approach to Cluster Multiple Related Spatial Datasets Vadeerat Rinsurongkawong and Christoph F. Eick Department of Computer.
Non-market output: the view from national accounts David Caplan National Accounts Group, ONS.
A K-Main Routes Approach to Spatial Network Activity Summarization(SNAS) Group 8.
Data Mining – Intro.
A Framework for Mining Sequential Patterns from Spatio-Temporal Event Data Sets Yan Huang, Liqin Zhang, Pusheng Zhang, IEEE Transactions on Knowledge.
CACTUS-Clustering Categorical Data Using Summaries
G10 Anuj Karpatne Vijay Borra
Spatio-temporal Pattern Queries
(Geo) Informatics across Disciplines!
Chapter 24 Testing Object-Oriented Applications
Chapter 19 Testing Object-Oriented Applications
Chapter 19 Testing Object-Oriented Applications
Automated Analysis and Code Generation for Domain-Specific Models
Efficient Processing of Top-k Spatial Preference Queries
Presentation transcript:

Cascading Spatio-Temporal Pattern Discovery P. Mohan, S.Shekhar, J. Shine, J. Rogers CSci 8715 Presented by: Atanu Roy Akash Agrawal

Motivation Applications in domains like –Public safety –Climate modeling –Natural disaster planning CSci 8715

The Problem Input –ST dataset consisting of a set of boolean event-types over a common ST framework –a directed neighborhood relation –a threshold CPI Output –CSTPS with CPI ≥ threshold Objective –Minimize Computation cost Constraints –Correctness, completeness CSci 8715

Key Challenges Absence of natural transactions & overlap across instances Exponential cardinality of candidate patterns Computationally complex ST neighborhood Conflicting demands of computational scalability and statistical interpretation CSci 8715

6 Related Works Spatio-temporal frequent patterns Partially OrderedOthers Unordered (ST Co-occurrence) Totally Ordered (ST Sequences) This Work (Cascading ST patterns )  ST Co-occurrence [Celik et al. 2008, Cao et al. 2006]  Designed for moving object datasets by treating trajectories as location time series  Does not capture partially ordered relationships over space and time.  ST Sequence [Huang et al. 2008, Cao et al ]  Totally ordered patterns modeled as a chain.  Does not account for multiply connected patterns(e.g. nonlinear)  Misses non-linear semantics.  No ST statistical interpretation. Slide Courtesy: Pradeep Mohan. Used in the class for demonstrating “Articulating Novelty”.

Novel & Better! Novelty –Implementation of partial ordered ST framework. –Spatio-temporal statistical interpretation first introduced –Novel interest measure –2 filtering strategies –New measure (clumpiness degree) –Tested on novel datasets Better –Bottleneck analysis shows major time is utilized for interest measure evaluation –Computes interest measure using ST partitioning –Algebraic cost model for filtering –Comparison shows better performance from authors’ previous work CSci 8715

Key Concepts CSci 8715

Filters Upper Bound (UB) Filter*: –Has anti-monotone upper bound. –Reflects maximum possible values of interest measure. Multi-resolution Spatio-Temporal Filter: * –There exists a low dimensional embedding in space and time –Used to create a coarse CPI which is later proved to never underestimate the CPI –Can be used for pruning patterns with low CPI –Saves time since actual CPI computation is very expensive CSci 8715 * The paper should have addressed the issue that the filters are complimentary in nature and should be used together to achieve the desired results.

Description Description: for each size k pattern –Apply UB filter –for k in (1,2,…n) do Generate size k candidates using CSTPs of size (k- 1) recursively Perform MST filtering for non-prevalent patterns Generate pattern instance and compute CPI Prune non-prevalent and generate prevalent CSTP –end for CSci 8715

Validations Mathematical proofs & Statistical Interpretation –Diggle et al.’s K-function Determination of the impact of filtering Comparison of performance of the 2 different CSTPM algorithms CSci 8715

Assumptions Use of Euclidean distance for the distance instead of real network distance. Helpful only -when the network is very well- connected. In real world, Euclidean distance is rarely the “true” distance between two points. Fails to capture dynamic constraints. –Police patrol can not cross a river unless there is a bridge. –Washington Ave. is closed for vehicular movements for the next few years. Most intuitive is the use of underlying spatial network distance instead. –esp. Road Network –River Network CSci 8715

Assumptions ST events are boolean. –Domains like climate study has attributes which can have REAL data. ST non-stationarities, choices of directed neighborhood relations are beyond the scope. –Events like drunk driving can be considered as non-stationary and will change with respect to time. CSci 8715

Critique The approach used for candidate generation can be improved further to reduce the computational complexity. –Implementation of hash indices for checking sub-graph isomorphism can be tried. Joins can also be used for shortest path computation. CSci 8715

Thank You 1.P. Mohan, S. Shekhar, J. A. Shine and J. P. Rogers, "Cascading spatio-temporal pattern dis-covery: A summary of results," in SDM, 2010, pp J. A. Shine, J. P. Rogers, S. Shekhar and P. Mohan, "Discovering partially ordered patterns of Terrorism via Spatio- temporal Data Mining," in 16th Army conference on Applied Statistics, Cory, NC, USA, J. A. Shine, J. P. Rogers, S. Shekhar and P. Mohan, "Cascade models for spatio-temporal pattern discovery," in 1st USACE Research and Development Conference, Memphis, TN, USA, M. Celik, S. Shekhar, B. George, J.P. Rogers, and J.A. Shine, “Discovering and quantifying mean streets: A summary of results”, (2007). CSci 8715