Extracting stay regions with uncertain boundaries from GPS trajectories a case study in animal ecology Haidong Wang.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Incremental Clustering for Trajectories
Mining Frequent Spatio-temporal Sequential Patterns
Mining Mobile Group Patterns: A Trajectory-based Approach San-Yih Hwang, Ying-Han Liu, Jeng-Kuen Chiu NSYSU, Taiwan Ee-Peng Lim NTU, Singapore.
Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet Presented by Eric Arnaud Makita
Presented by: GROUP 7 Gayathri Gandhamuneni & Yumeng Wang.
DBSCAN – Density-Based Spatial Clustering of Applications with Noise M.Ester, H.P.Kriegel, J.Sander and Xu. A density-based algorithm for discovering clusters.
Clustering Prof. Navneet Goyal BITS, Pilani
More on Clustering Hierarchical Clustering to be discussed in Clustering Part2 DBSCAN will be used in programming project.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ What is Cluster Analysis? l Finding groups of objects such that the objects in a group will.
A Novel Scheme for Video Similarity Detection Chu-Hong Hoi, Steven March 5, 2003.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Avatar Path Clustering in Networked Virtual Environments Jehn-Ruey Jiang, Ching-Chuan Huang, and Chung-Hsien Tsai Adaptive Computing and Networking Lab.
Yu Zheng, Lizhu Zhang, Xing Xie, Wei-Ying Ma Microsoft Research Asia
Temporal Pattern Matching of Moving Objects for Location-Based Service GDM Ronald Treur14 October 2003.
Detecting and Tracking Moving Objects for Video Surveillance Isaac Cohen and Gerard Medioni University of Southern California.
Segmentation Graph-Theoretic Clustering.
SCAN: A Structural Clustering Algorithm for Networks
Constrained Pattern Assignment for Standard Cell Based Triple Patterning Lithography H. Tian, Y. Du, H. Zhang, Z. Xiao, M. D.F. Wong Department of ECE,
Distributed and Efficient Classifiers for Wireless Audio-Sensor Networks Baljeet Malhotra Ioanis Nikolaidis Mario A. Nascimento University of Alberta Canada.
Introduction Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Introduction Facebook How does Facebook use your data? Where do you think.
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Friends and Locations Recommendation with the use of LBSN
Demography and Population Growth. Some Basic Questions n 1What are the characteristics of populations? What parameters can we measure? How do populations.
On Simultaneous Clustering and Cleaning over Dirty Data
Efficient Gathering of Correlated Data in Sensor Networks
Outlier Detection Using k-Nearest Neighbour Graph Ville Hautamäki, Ismo Kärkkäinen and Pasi Fränti Department of Computer Science University of Joensuu,
Time-focused density-based clustering of trajectories of moving objects Margherita D’Auria Mirco Nanni Dino Pedreschi.
Mining Interesting Locations and Travel Sequences from GPS Trajectories IDB & IDS Lab. Seminar Summer 2009 강 민 석강 민 석 July 23 rd,
Name: Sujing Wang Advisor: Dr. Christoph F. Eick
Mining Shifting-and-Scaling Co-Regulation Patterns on Gene Expression Profiles Jin Chen Sep 2012.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
1 CSE 980: Data Mining Lecture 17: Density-based and Other Clustering Algorithms.
Migration Motif: A Spatial-Temporal Pattern Mining Approach for Financial Markets Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee, John H.Thornton Jr.
Density-Based Clustering Algorithms
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Spatio-Temporal Case-Based Reasoning for Behavioral Selection Maxim Likhachev and Ronald Arkin Mobile Robot Laboratory Georgia Tech.
Siyuan Liu *#, Yunhuai Liu *, Lionel M. Ni *# +, Jianping Fan #, Minglu Li + * Hong Kong University of Science and Technology # Shenzhen Institutes of.
Most of contents are provided by the website Introduction TJTSD66: Advanced Topics in Social Media Dr.
 3000 Km off the coast of Chile  5 th century – 400 people  Created Moai…had food and war was unknown  Several centuries later…15000!  Not enough.
Lei Zhang and Guoning Chen, Department of Computer Science, University of Houston Robert S. Laramee, Swansea University David Thompson and Adrian Sescu,
DBSCAN Data Mining algorithm Dr Veljko Milutinović Milan Micić
A New Temporal Pattern Identification Method for Characterization and Prediction of Complex Time Series Events Advisor : Dr. Hsu Graduate : You-Cheng Chen.
黃福銘 (Angus). Angus Fuming Huang Academia Sinica, Institute of Information Science, ANTS Lab Jae-Gil Lee Jiawei Han UIUC Kyu-Young Whang KAIST ACM SIGMOD’07.
Density-Based Clustering Methods. Clustering based on density (local cluster criterion), such as density-connected points Major features: –Discover clusters.
Exploiting Network Structure for Proactive Spam Mitigation Shobha Venkataraman * Joint work with Subhabrata Sen §, Oliver Spatscheck §, Patrick Haffner.
Mining Trajectory Profiles for Discovering User Communities Speaker : Chih-Wen Chang National Chiao Tung University, Taiwan Chih-Chieh Hung,
Robust Kernel Density Estimation by Scaling and Projection in Hilbert Space Presented by: Nacer Khalil.
Other Clustering Techniques
Predicting the Location and Time of Mobile Phone Users by Using Sequential Pattern Mining Techniques Mert Özer, Ilkcan Keles, Ismail Hakki Toroslu, Pinar.
CLUSTERING DENSITY-BASED METHODS Elsayed Hemayed Data Mining Course.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
An Energy-Efficient Approach for Real-Time Tracking of Moving Objects in Multi-Level Sensor Networks Vincent S. Tseng, Eric H. C. Lu, & Kawuu W. Lin Institute.
Parameter Reduction for Density-based Clustering on Large Data Sets Elizabeth Wang.
CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks (WWW2013) BEUTEL, ALEX, WANHONG XU, VENKATESAN GURUSWAMI, CHRISTOPHER.
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
DATA MINING: CLUSTER ANALYSIS (3) Instructor: Dr. Chun Yu School of Statistics Jiangxi University of Finance and Economics Fall 2015.
Presented by: Shahab Helmi Spring 2016
Urban Sensing Based on Human Mobility
A tale of many cities: universal patterns in human urban mobility
School of Sociological and Anthropological Studies
Generalized Principal Component Analysis CVPR 2008
Clustering Uncertain Taxi data
Segmentation Graph-Theoretic Clustering.
Presenting a harmonised city definition and its application
Characteristics of Populations
GPX: Interactive Exploration of Time-series Microarray Data
Characteristics of Populations
Introduction to Machine learning
Presentation transcript:

Extracting stay regions with uncertain boundaries from GPS trajectories a case study in animal ecology Haidong Wang

Introduction and problem Introduction: With the advances in mobile technologies, the extraction of behavioral patterns from collections of geometric trajectories regarding e.g. people, animals and goods, has become a prominent research issue in a variety of disciplines. Problem: How to extract stay regions with uncertain boundaries from GPS trajectories.

Solution to the problem and the study case Solution: To use a time-aware, density-based clustering technique for the identification of stay regions in trajectories. Study case: Object: roe deer, a partial migration species. Pattern:

Motivation The study can open up new opportunities for the study of the animal behavior.

Definitions : distance threshold. K : the minimum number of points that a cluster contains. δ : presence threshold. -neighborhood : denoted N (p), is the subset of points that are ”close” to p. Core point : Point p is a core point if its -neighborhood contains at least K points. Border point : point that is not a core point but belongs to the neighborhood of a core point is a border point.

Definitions Dense region: A dense region S is a sub-trajectory S = [q1,.., qm] such that the set of locations [l1,.., lm] is a maximal density connected set with respect to and K. The points that do not belong to any dense region in T are qualified as noise. Presence:

Example

Dense region:

Example Presence: the presence in the dense region is |t9 − t6|.

Problem formulation Stay region (S): (i) S is a dense region w.r.t. and K. (ii)The object’s presence in S is persistent w.r.t δ.

ALGORITHM

Experiments - dataset We apply the algorithm to extract the migration behavior of a group of 25 roe deer tracked in the period The dataset is provided by the research institute Fondazione E.Mach. The total number of samples amounts to over points. The animals live in an area of about 30 Km2 on the Alps near the city of Trento (Italy). The history of these animals, since their capture for the installation of the GPS collar, is known and used as ground truth. The points are sampled approximately every 4 hours.

Experiments – sampled points

Experiment - result 4606 points over two years with 9.64% noise migrate 2642 points with 32% noise migrate 1543 points with 1.4% noise stationary

Experiment - stats

Conclusion The paper presents a novel framework for the study of migratory behaviors, consisting of: a mobility pattern model; an algorithm, i.e. SeqScan, to extract such a pattern from GPS trajectories; a usage methodology for the study of wild animal migrations; and a first validation of the whole framework over a real data set. On the algorithmic side, SeqScan provides a conceptually clean and founded mechanism for the analysis of stop-and-move like patterns over large temporal scales.

Questions?

Algorithm

Example