Presented by: Shahab Helmi Spring 2016

Slides:



Advertisements
Similar presentations
Clustering Overview Algorithm Begin with all sequences in one cluster While splitting some cluster improves the objective function: { Split each cluster.
Advertisements

Xiaolei Li, Zhenhui Li, Jiawei Han, Jae-Gil Lee. 1. Motivation 2. Anomaly Definitions 3. Algorithm 4. Experiments 5. Conclusion.
Incremental Clustering for Trajectories
Research Challenges in the CarTel Mobile Sensor System Samuel Madden Associate Professor, MIT.
Urban Computing with Taxicabs
SkewReduce YongChul Kwon Magdalena Balazinska, Bill Howe, Jerome Rolia* University of Washington, *HP Labs Skew-Resistant Parallel Processing of Feature-Extracting.
Graduate : Sheng-Hsuan Wang
Constructing Popular Routes from Uncertain Trajectories Authors of Paper: Ling-Yin Wei (National Chiao Tung University, Hsinchu) Yu Zheng (Microsoft Research.
Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.
ACE: Exploiting Correlation for Energy-Efficient and Continuous Context Sensing Suman Nath Microsoft Research MobiSys 2012 Presenter: Jeffrey.
Critical Analysis Presentation: T-Drive: Driving Directions based on Taxi Trajectories Authors of Paper: Jing Yuan, Yu Zheng, Chengyang Zhang, Weilei Xie,
A Novel Scheme for Video Similarity Detection Chu-Hong Hoi, Steven March 5, 2003.
T-Drive : Driving Directions Based on Taxi Trajectories Microsoft Research Asia University of North Texas Jing Yuan, Yu Zheng, Chengyang Zhang, Xing Xie,
CENTRE Cellular Network’s Positioning Data Generator Fosca GiannottiKDD-Lab Andrea MazzoniKKD-Lab Puntoni SimoneKDD-Lab Chiara RensoKDD-Lab.
Requirements Specification
A First Attempt towards a Logical Model for the PBMS PANDA Meeting, Milano, 18 April 2002 National Technical University of Athens Patterns for Next-Generation.
The Data Mining Visual Environment Motivation Major problems with existing DM systems They are based on non-extensible frameworks. They provide a non-uniform.
21 / 06 / 2000Segmentation of Sea-bed Images.1 Josepha UNIA Ecole Centrale de Lyon.
(C) 2001 SNU CSE Biointelligence Lab Incremental Classification Using Tree- Based Sampling for Large Data H. Yoon, K. Alsabti, and S. Ranka Instance Selection.
Hand Signals Recognition from Video Using 3D Motion Capture Archive Tai-Peng Tian Stan Sclaroff Computer Science Department B OSTON U NIVERSITY I. Introduction.
Reducing Uncertainty of Low-sampling-rate Trajectories Kai Zheng, Yu Zheng, Xing Xie, Xiaofang Zhou University of Queensland & Microsoft Research Asia.
Sensys 2009 Speaker:Lawrence.  Introduction  Overview & Challenges  Algorithm  Travel Time Estimation  Evaluation  Conclusion.
嵌入式視覺 Pattern Recognition for Embedded Vision Template matching Statistical / Structural Pattern Recognition Neural networks.
Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,
Irum Amjad Marko B Popovic Oscar Moll. Problem  Traditional customer account information do not fully summarize the customer spending patterns  E.g.
1. 2 Steve Grisé Solution Architect, Vertex3 September 6, 2013.
Data MINING Data mining is the process of extracting previously unknown, valid and actionable information from large data and then using the information.
TEMPLATE DESIGN © Zhiyao Duan 1,2, Lie Lu 1, and Changshui Zhang 2 1. Microsoft Research Asia (MSRA), Beijing, China.2.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Instance Filtering for Entity Recognition Advisor : Dr.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
CS 4850: Senior Project Fall 2014 Object-Oriented Design.
FREERIDE: System Support for High Performance Data Mining Ruoming Jin Leo Glimcher Xuan Zhang Ge Yang Gagan Agrawal Department of Computer and Information.
INFERRING HUMAN ACTIVITY FROM GPS TRACKS Sun Simiao.
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
A DISTRIBUTION BASED VIDEO REPRESENTATION FOR HUMAN ACTION RECOGNITION Yan Song, Sheng Tang, Yan-Tao Zheng, Tat-Seng Chua, Yongdong Zhang, Shouxun Lin.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Fast accurate fuzzy clustering through data reduction Advisor.
A New Temporal Pattern Identification Method for Characterization and Prediction of Complex Time Series Events Advisor : Dr. Hsu Graduate : You-Cheng Chen.
MODEL-BASED SOFTWARE ARCHITECTURES.  Models of software are used in an increasing number of projects to handle the complexity of application domains.
Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science.
1 Knowledge Discovery from Transportation Network Data Paper Review Jiang, W., Vaidya, J., Balaporia, Z., Clifton, C., and Banich, B. Knowledge Discovery.
Real-Time Trip Information Service for a Large Taxi Fleet
Capstone Project Fall Course Information Instructor Ye Zhao –Office: MSB 220 – Fall 2015 (MSB162) –Time: Tue, Thu 10:45am.
Motivation and Overview
Extracting stay regions with uncertain boundaries from GPS trajectories a case study in animal ecology Haidong Wang.
Using decision trees to build an a framework for multivariate time- series classification 1 Present By Xiayi Kuang.
CSIS 4850: CS Senior Project – Spring 2009 CSIS 4850: Senior Project Spring 2009 Object-Oriented Design.
C ROWD P LANNER : A C ROWD -B ASED R OUTE R ECOMMENDATION S YSTEM Han Su, Kai Zheng, Jiamin Huang, Hoyoung Jeung, Lei Chen, Xiaofang Zhou.
2013 IEEE 14th International Conference on Mobile Data Management Authors: 1. Jiansu Pu 2. Siyuan Liu 3. Ye Ding 4. Huamin Qu 5. Lionel Ni By: Farah Kamw.
DOiT Dynamic Optimization in Transportation Ragnhild Wahl, SINTEF (Per J. Lillestøl SINTEF)
IllustraSound Illustrative Visualization meets Ultrasound Veronika Solteszova Åsmund Birkeland Paolo Angelelli.
Computer Science and Engineering Jianye Yang 1, Ying Zhang 2, Wenjie Zhang 1, Xuemin Lin 1 Influence based Cost Optimization on User Preference 1 The University.
MTA ETA. Product Description A real-time simulation system that estimates the expected time that it will take a certain bus to arrive at an end- user’s.
Where to find help when you meet a emergency? HelpMe: a guidance system for self-rescue Kuien Liu Institute of Software Chinese Academy of Sciences.
Big data Analytics for Tourism Destination management
Managing Massive Trajectories on the Cloud
Machine Learning with Spark MLlib
Bag-of-Visual-Words Based Feature Extraction
Evaluating state of the art in AI
Online Frequent Episode Mining
Mining the Most Influential k-Location Set from Massive Trajectories
Generalization ..
CS & CS Capstone Project & Software Development Project
Dr. Bhavani Thuraisingham The University of Texas at Dallas
Showcasing work by Jing Yuan, Yu Zheng, Xing Xie, Guangzhou Sun
Laura Bright David Maier Portland State University
Sourse: Www 2017 Advisor: Jia-Ling Koh Speaker: Hsiu-Yi,Chu
Segmentation of Sea-bed Images.
FRAMEWORKS AND REUSE What is “Framework”?
Introduction Dataset search
Visually Analyzing Latent Accessibility Clusters of Urban POIs
Presentation transcript:

Presented by: Shahab Helmi Spring 2016 Making Sense of Trajectory Data: A Partition-and Summarization Approach Presented by: Shahab Helmi Spring 2016

Paper Information Authors: Publication: ICDE 2015 Type: Research Paper

Introduction, Motivation Raw trajectories are not easy for humans to understand. GPS locations with semantic entities such as POIs, roads, regions, resulting in semantic trajectories or annotated trajectories. Semantic trajectories have their own disadvantages: Data Volume. Semantic trajectories cannot intuitively express the travel behaviors relating to temporal attributes such as over-speed, sharp speed change, long stopover, etc. Moreover, they cannot highlight the ‘interesting’ parts of the trajectories such as significant landmarks and important roads.

Solution Overview The partition phase tries to find an optimal partition by minimizing the variation of predefined features for the trajectory segments within the same partition. Summarization phase exploits the common patterns learned from historical trajectories, to measure the unusualness of each feature, and generate textual description for the most unusual features with a predefined template. We also implemented this framework in a prototype system—STMaker.

Solution Overview (2)

Template Examples

Experiments Datasets: Commercial Map: We use the commercial map of a large city—Beijing—provided by a collaborating company. The commercial map is used to build the landmark dataset, and to provide routing features which are essential for our algorithm. Landmark Dataset: the landmark dataset consists of two parts: the turning point dataset extracted from the commercial map, and the POI dataset of Beijing provided by a reliable third-part company. We extract about 32,000 turning points from the commercial map. The raw POI dataset has about 510,000 POI points. We cluster the raw POI dataset into approximately 17,000 clusters using DBSCAN. Trajectory Dataset: We use a real-world trajectory dataset generated by 33,000+ taxis in Beijing over three months. This dataset has more than 100,000 trajectories. We randomly split the dataset into two parts: a training dataset of 50,000 trajectories, and the rest trajectories as a testing dataset.