Time Series Data and Moving Object Trajectory

Slides:

Advertisements

Similar presentations

Choosing Distance Measures for Mining Time Series Data

Advertisements

New Approaches for Traffic State Estimation: Calibrating Heterogeneous Car-Following Behavior using Vehicle Trajectory Data Dr. Xuesong Zhou & Jeffrey.

Decomposition Method.

Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.

Dual-domain Hierarchical Classification of Phonetic Time Series Hossein Hamooni, Abdullah Mueen University of New Mexico Department of Computer Science.

Jürgen Wolf 1 Wolfram Burgard 2 Hans Burkhardt 2 Robust Vision-based Localization for Mobile Robots Using an Image Retrieval System Based on Invariant.

Digital Signal Processing (DSP) Fundamentals. Overview What is DSP? Converting Analog into Digital –Electronically –Computationally How Does It Work?

Indexing Time Series. Time Series Databases A time series is a sequence of real numbers, representing the measurements of a real variable at equal time.

Indexing Time Series Based on Slides by C. Faloutsos (CMU) and D. Gunopulos (UCR)

Themis Palpanas1 VLDB - Aug 2004 Fair Use Agreement This agreement covers the use of all slides on this CD-Rom, please read carefully. You may freely use.

Distance Functions for Sequence Data and Time Series

Based on Slides by D. Gunopulos (UCR)

Detecting Time Series Motifs Under

Statistical Methods for long-range forecast By Syunji Takahashi Climate Prediction Division JMA.

A Pattern Matching Method for Finding Noun and Proper Noun Translations from Noisy Parallel Corpora Benjamin Arai Computer Science and Engineering Department.

Sensys 2009 Speaker:Lawrence.  Introduction  Overview & Challenges  Algorithm  Travel Time Estimation  Evaluation  Conclusion.

GPS Trajectories Analysis in MOPSI Project Minjie Chen SIPU group Univ. of Eastern Finland.

FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space

Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,

Click icon to add picture SmartSpaghetti: Accurate and Robust Tracking of Human's Location Mostafa Uddin, Ajay Gupta, Kurt Maly, and Tamer Nadeem.

CS910: Foundations of Data Analytics Graham Cormode Time Series Analysis.

Qualitative approximation to Dynamic Time Warping similarity between time series data Blaž Strle, Martin Možina, Ivan Bratko Faculty of Computer and Information.

Analysis of Constrained Time-Series Similarity Measures

Time Series Data Analysis - I Yaji Sripada. Dept. of Computing Science, University of Aberdeen2 In this lecture you learn What are Time Series? How to.

K. Selçuk Candan, Maria Luisa Sapino Xiaolan Wang, Rosaria Rossini

Mining Time Series.

Applications of Neural Networks in Time-Series Analysis Adam Maus Computer Science Department Mentor: Doctor Sprott Physics Department.

Medicaps Institute of Technology & Management Submitted by :- Prasanna Panse Priyanka Shukla Savita Deshmukh Guided by :- Mr. Anshul Shrotriya Assistant.

HY436: Mobile Computing and Wireless Networks Data sanitization Tutorial: November 7, 2005 Elias Raftopoulos Ploumidis Manolis Prof. Maria Papadopouli.

Distributed Spatio-Temporal Similarity Search Demetrios Zeinalipour-Yazti University of Cyprus Song Lin

ICDE, San Jose, CA, 2002 Discovering Similar Multidimensional Trajectories Michail VlachosGeorge KolliosDimitrios Gunopulos UC RiversideBoston UniversityUC.

K-Means Algorithm Each cluster is represented by the mean value of the objects in the cluster Input: set of objects (n), no of clusters (k) Output:

Distance fields. The program Multiple perspectives: euclidean, analytic, transformational Build algebraic skills Foreshadow future math concepts Build.

A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.

S.Frasca on behalf of LSC-Virgo collaboration New York, June 23 rd, 2009.

Indexing Time Series. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases Time Series databases Text databases.

Using Word Based Features for Word Clustering The Thirteenth Conference on Language Engineering 11-12, December 2013 Department of Electronics and Communications,

Private Release of Graph Statistics using Ladder Functions J.ZHANG, G.CORMODE, M.PROCOPIUC, D.SRIVASTAVA, X.XIAO.

Presenters: Amool Gupta Amit Sharma. MOTIVATION Basic problem that it addresses?(Why) Other techniques to solve same problem and how this one is step.

 Average – mean, median and mode are three “kinds” of average (commonly used to describe the mean).  Mean temperature – average temperature of the air.

Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.

Distance/Similarity Functions for Pattern Recognition J.-S. Roger Jang ( 張智星 ) CS Dept., Tsing Hua Univ., Taiwan

High-Dimensional Data. Topics Motivation Similarity Measures Index Structures.

Mustafa Gokce Baydogan, George Runger and Eugene Tuv INFORMS Annual Meeting 2011, Charlotte A Bag-of-Features Framework for Time Series Classification.

Forecasting. Model with indicator variables The choice of a forecasting technique depends on the components identified in the time series. The techniques.

Lecture 9 Forecasting. Introduction to Forecasting * * * * * * * * o o o o o o o o Model 1Model 2 Which model performs better? There are many forecasting.

Mining Data Streams with Periodically changing Distributions Yingying Tao, Tamer Ozsu CIKM’09 Supervisor Dr Koh Speaker Nonhlanhla Shongwe April 26,

Mining and Processing Biomedical Data

Applying Deep Neural Network to Enhance EMPI Searching

Supervised Time Series Pattern Discovery through Local Importance

Privacy Preserving Similarity Evaluation of Time Series Data

Distance Functions for Sequence Data and Time Series

Quality Tools - 9/18/2018 Quality Tools -

Automatic Picking of First Arrivals

Time Series Filtering Time Series

Parallelizing Dynamic Time Warping

Distance Functions for Sequence Data and Time Series

School of Computer Science & Engineering

Robust Similarity Measures for Mobile Object Trajectories

Unit-4: Dynamic Programming

Cyclic string-to-string correction

Identification of Wiener models using support vector regression

Quality Tools - 2/19/2019 Quality Tools -

Finding Periodic Discrete Events in Noisy Streams

Group 9 – Data Mining: Data

Time Series Filtering Time Series

Ensemble forecasts and seasonal precipitation tercile probabilities

Topic 7: Visualization Lesson 2 – Frequency Charts in Excel

Chapter 3: Central Tendency

Accurate Video Localization

Presentation transcript:

Time Series Data and Moving Object Trajectory Made by: Yu Cao, Fengqi Xing, XiangXu Lin, Zhiqing Gu

Overview Time Series data is a series of data points indexed(or listed/graphed) in time order. General graph predict the future trending. Moving object Trajectory Edit Distance on Real sequence (EDR) Problem EDR for project

Moving object Trajectory Financial data analysis Weather forecasting. Cars moving .

Moving object Trajectory Problem: The existing distance functions are usually sensitive to noise, shifts and scaling of data that commonly occur due to sensor failures, errors in detection techniques, disturbance signals, and different sampling rates. Cleaning data to eliminate these is not always possible. Analysis: Edit Distance on Real sequence (EDR) , Dynamic Time Warp-ing (DTW), Edit distance with Real Penalty (ERP) , Longest Common Subsequences (LCSS)

Edit Distance on Real sequence (EDR) Find how dissimilar with two string (words) are to one another by counting the minimum number of operations required to transform one string into the other. Euclidean distance

Evaluation of EDR EDR performs as well as DTW, ERP and LCSS. Conclude: the results of above two tests prove that EDR performs as well as DTW, ERP, and LCSS when trajectories contain little or no noise, and it is more robust than DTW and ERP, and on average 50% more accurate than LCSS in noisy conditions. In terms of efficiency, the computation cost of DTW, ERP, LCSS, and EDR is the same, which are quadratic using dynamic programming.

Improving of EDR EDR is not a perfect function for trajectory 3 ways to improve the efficiency: Mean value Q-grams Near triangle inequality Trajectory histogram

Moving Object Trajectories NBA players moving trajectories.

Moving Object Trajectories Find all similar trajectories in database.

Draw the Movement

Calculating Euclidean Distance Calculating Euclidean distance between consecutive points of an array with Numpy

Expect Output https://plot.ly/~cricel.design/1.embed

Thank you!