NextPlace: A Spatio-Temporal Prediction Framework for Pervasive Systems Salvatore Scellato1, Micro Musolesi, Cecilia Mascolo1, Vito Latora, and Andrew.

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

Cipher Techniques to Protect Anonymized Mobility Traces from Privacy Attacks Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip and Nageswara S. V. Rao.
Mining User Similarity Based on Location History Yu Zheng, Quannan Li, Xing Xie Microsoft Research Asia.
1 Top-K Algorithms: Concepts and Applications by Demetris Zeinalipour Visiting Lecturer Department of Computer Science University of Cyprus Department.
LEARNING INFLUENCE PROBABILITIES IN SOCIAL NETWORKS Amit Goyal Francesco Bonchi Laks V. S. Lakshmanan University of British Columbia Yahoo! Research University.
Model Checker In-The-Loop Flavio Lerda, Edmund M. Clarke Computer Science Department Jim Kapinski, Bruce H. Krogh Electrical & Computer Engineering MURI.
Kira Radinsky, Sagie Davidovich, Shaul Markovitch Computer Science Department Technion – Israel Institute of technology.
Finding Self-similarity in People Opportunistic Networks Ling-Jyh Chen, Yung-Chih Chen, Paruvelli Sreedevi, Kuan-Ta Chen Chen-Hung Yu, Hao Chu.
Evaluation (practice). 2 Predicting performance  Assume the estimated error rate is 25%. How close is this to the true error rate?  Depends on the amount.
Chen Cheng1, Haiqin Yang1, Irwin King1,2 and Michael R. Lyu1
Probability based Recommendation System Course : ECE541 Chetan Tonde Vrajesh Vyas Ashwin Revo Under the guidance of Prof. R. D. Yates.
Finding Self-similarity in Opportunistic People Networks Yung-Chih Chen 1 Ling-Jyh Chen 1, Yung-Chih Chen 1, Tony Sun 2 Paruvelli Sreedevi 1, Kuan-Ta Chen.
Science Meeting-1 Lin 12/17/09 MIT Lincoln Laboratory Prediction of Weather Impacts on Air Traffic Through Flow Constrained Areas AMS Seattle Yi-Hsin Lin.
A Nonstationary Poisson View of Internet Traffic T. Karagiannis, M. Molle, M. Faloutsos University of California, Riverside A. Broido University of California,
TRIP ASSIGNMENT.
PCFG Based Synthetic Mobility Trace Generation S. C. Geyik, E. Bulut, and B. K. Szymanski Department of Computer Science, Rensselaer Polytechnic Institute.
Collaborative Signal Processing CS 691 – Wireless Sensor Networks Mohammad Ali Salahuddin 04/22/03.
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Yung-Chih Chen Jim Kurose and Don Towsley Computer Science Department University of Massachusetts Amherst A Mixed Queueing Network Model of Mobility in.
Overview and Mathematics Bjoern Griesbach
Radial Basis Function Networks
A Measurement-driven Analysis of Information Propagation in the Flickr Social Network WWW09 报告人: 徐波.
SoundSense: Scalable Sound Sensing for People-Centric Application on Mobile Phones Hon Lu, Wei Pan, Nocholas D. lane, Tanzeem Choudhury and Andrew T. Campbell.
Patterns of significant seismic quiescence in the Pacific Mexican coast A. Muñoz-Diosdado, A. H. Rudolf-Navarro, A. Barrera-Ferrer, F. Angulo-Brown National.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Statistical learning and optimal control:
1 Reading Report 9 Yin Chen 29 Mar 2004 Reference: Multivariate Resource Performance Forecasting in the Network Weather Service, Martin Swany and Rich.
Mirco Nanni, Roberto Trasarti, Giulio Rossetti, Dino Pedreschi Efficient distributed computation of human mobility aggregates through user mobility profiles.
Context-aware Adaptive Routing for Delay Tolerant Networking Mirco Musolesi Joint work with Cecilia Mascolo Department of Computer Science University College.
R. Kass/W03P416/Lecture 7 1 Lecture 7 Some Advanced Topics using Propagation of Errors and Least Squares Fitting Error on the mean (review from Lecture.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
Knowledge Discovery and Delivery Lab (ISTI-CNR & Univ. Pisa)‏ www-kdd.isti.cnr.it Anna Monreale Fabio Pinelli Roberto Trasarti Fosca Giannotti A. Monreale,
Find regular encounter pattern from mobile users. Regular encounter indicates an encounter trend that is repetitive and consistent. Using this metric can.
IEEE TRANSSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
The Examination of Residuals. Examination of Residuals The fitting of models to data is done using an iterative approach. The first step is to fit a simple.
Chapter 11Design & Analysis of Experiments 8E 2012 Montgomery 1.
Spatial-Temporal Models in Location Prediction Jingjing Wang 03/29/12.
Geographic Information Science
Energy Efficient Location Sensing Brent Horine March 30, 2011.
1 Modeling Coherent Mortality Forecasts using the Framework of Lee-Carter Model Presenter: Jack C. Yue /National Chengchi University, Taiwan Co-author:
IEEE PIMRC Short-term Traffic Forecasting in a Campus-Wide Wireless Network Maria Papadopouli Assistant Professor Department of Computer Science.
A taste of statistics Normal error (Gaussian) distribution  most important in statistical analysis of data, describes the distribution of random observations.
Suppressing Random Walks in Markov Chain Monte Carlo Using Ordered Overrelaxation Radford M. Neal 발표자 : 장 정 호.
PROCESS MODELLING AND MODEL ANALYSIS © CAPE Centre, The University of Queensland Hungarian Academy of Sciences Statistical Model Calibration and Validation.
Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University July 21, 2008WODA.
Presented By, Shivvasangari Subramani. 1. Introduction 2. Problem Definition 3. Intuition 4. Experiments 5. Real Time Implementation 6. Future Plans 7.
Inferring High-Level Behavior from Low-Level Sensors Donald J. Patterson, Lin Liao, Dieter Fox, and Henry Kautz.
Pin-Yun Tarng / An Analysis of WoW Players’ Game Hours Network and Systems Laboratory nslab.ee.ntu.edu.tw IEEE/IFIP DSN 2008 Network and Systems Laboratory.
Neural Networks Presented by M. Abbasi Course lecturer: Dr.Tohidkhah.
1 Jong Hee Kang, William Welbourne, Benjamin Stewart, Gaetano Borriello, October 2004, Proceedings of the 2nd ACM international workshop on Wireless mobile.
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
Predicting the Location and Time of Mobile Phone Users by Using Sequential Pattern Mining Techniques Mert Özer, Ilkcan Keles, Ismail Hakki Toroslu, Pinar.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Page 0 of 7 Particle filter - IFC Implementation Particle filter – IFC implementation: Accept file (one frame at a time) Initial processing** Compute autocorrelations,
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Forecasting is the art and science of predicting future events.
Extracting Places from Traces of Locations Paper Authors Jong Hee Kang Benjamin Stewart William Welbourne Gaetano Borriello PowerPoint Author Michael Cook.
An unsupervised conditional random fields approach for clustering gene expression time series Chang-Tsun Li, Yinyin Yuan and Roland Wilson Bioinformatics,
Accurate WiFi Packet Delivery Rate Estimation and Applications Owais Khan and Lili Qiu. The University of Texas at Austin 1 Infocom 2016, San Francisco.
Tree and Forest Classification and Regression Tree Bagging of trees Boosting trees Random Forest.
Mustafa Gokce Baydogan, George Runger and Eugene Tuv INFORMS Annual Meeting 2011, Charlotte A Bag-of-Features Framework for Time Series Classification.
R. Kass/Sp07P416/Lecture 71 More on Least Squares Fit (LSQF) In Lec 5, we discussed how we can fit our data points to a linear function (straight line)
Privacy Vulnerability of Published Anonymous Mobility Traces Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip (Purdue University) Nageswara S. V. Rao (Oak.
Context-aware Adaptive Routing for Delay Tolerant Networking
The Poisson probability distribution
Statistical Models for Automatic Speech Recognition
Automatic Picking of First Arrivals
Regression Analysis Week 4.
Ch 3. Linear Models for Regression (2/2) Pattern Recognition and Machine Learning, C. M. Bishop, Previously summarized by Yung-Kyun Noh Updated.
Presentation transcript:

NextPlace: A Spatio-Temporal Prediction Framework for Pervasive Systems Salvatore Scellato1, Micro Musolesi, Cecilia Mascolo1, Vito Latora, and Andrew T. Campbell2 1 Computer Laboratory, University of Cambridge, UK 2 Department of Computer Science, Dartmouth College, USA Pervasive’11

The ability to predict future locations of people allows Motivation The ability to predict future locations of people allows  A rich set of novel pervasive applications and systems Advertisement Leisure events reports and notification With pervasive technology, these could be implemented in a more effective way avoiding the delivery of information to uninterested users providing a better user experience

NextPlace A new prediction framework based on nonlinear time series analysis For forecasting user behavior In different locations From a spatio-temporal point of view Estimate the duration of a visit to a certain location and of the interva ls between two subsequent visits When they visit their most important places Do not focus on the transitions between different locations

Predictability & Intuition Any prediction of future user behavior is based on the assumption of determinism Determinism: future events are determined by past events Human activities are characterized by a certain degree of regularity and predictabi lity Because in human societies daily and weekly routines are well-established Intuition The sequence of important locations that an individual visits every day is more or less fixed Example if a woman periodically goes to the gym on Mondays and Thursdays, she may change her routine for those days, but the changed routine will be more or less the same over different weeks. Two steps of Next Place How to isolate the user’s significant places How to estimate future times of arrival and residence times in the different sig nificant places Omit the detailed nonlinear prediction model

Significant Place Extraction: GPS Many solutions have been presented in the literature [2,11,18] Intuition: permanence at a place is directly proportional to the importance that is attrib uted it by the user Approach: 2-D Gaussian distribution weighted by the residence time at each GPS point The value of the variance for the Gaussian distributions: 10 meters Frequency map Contains peaks which give information about the position of popular locations Significant places: regions that are above a certain threshold T (a) Frequency map (b) Significant places

Significant Place Extraction: WiFi Intuition: the most frequently seen access points are natural candidates to re present significant places Methodology Determine a significant place if the user has a sequence of at least n visits to the access point In the setting: n = 20

Predicting User Behavior Algorithm description The history of visits of a user to each of its significant locations is considered For each location, try to predict when the next visits will take place and for how lon g they will last Procedure Create two time series from the sequence of previous visits C = (c1, c2, …, cn), time series of the visit start times D = (d1, d2, …, dn), time series of the visit duration Search in the time series C sequence of m consecutive values (ci-m+1, …, ci) that are closely similar to the last m values (cn-m+1,…,cn) Estimate next value of time series C by averaging all the values ci+1 that follow each found sequence Select corresponding sequences (di-m+1, …, di) Estimate next value of time series D by averaging all the values di+1 that follow thes e sequence Do not consider type of visit place, the visit purpose, correlation of visit place s, …

Example Last three visit of a certain user to a location Monday at 6:30pm Monday at 10:00pm Tuesday at 8:15 am Find sequences that are numerically close to (6:30pm, 10:00pm, 8:15 pm) i.e., (6:10pm, 9:50pm, 8:35am) and (6:35pm, 10:10pm, 8:00am) Assume that the next visits that follow these subsequences Start at 1:10pm and 12:40pm Last for 40 and 30 minutes Estimate the next visit at 12:55pm for 35 minutes

Validation: Datasets Cabspotting: movement traces of taxi cabs in San Francisco with GP S coordinates of approximately 500 taxis CenceMe GPS: during the deployment of CenceMe[21], at Dartmout h College with GPS Dartmouth WiFi: extracted from SNMP logs of the WiFi LAN of Dart mouth College campus Ile Sans Fils: a non-profit organization which operates a network of free WiFi hotspots in Montreal, Canada. Over 45,000 users with 140 h otspots

Validation: Careful Choice of suitable threshold GPS-based: threshold T for frequency map T: a fraction of the maximum value of the frequency map T=0.10 for Cabspotting T=0.15 for CenceMe GPS

Validation: Predictability Test Mean quadratic prediction error 𝜀= 1 𝑁 𝑛=1 𝑁 ( 𝑠 𝑛 − 𝑝 𝑛 ) 2 sn = time series pn = predicted values Predictability error: error / variance^2 If this ratio is close to 1, the mean quadratic prediction error is large  no determinism is present If this ratio is close to 0, the mean quadratic prediction error is small  a high degree of determinism

Evaluation Methodology NPm : NextPlace with m = 1, 2, 3 M1, M2: first-order and second-order Markov-based L: NextPlace with linear predictor Definition of correctness If we predict that, at time T, the user will be at location L at time TP = T + delta T Correct only if the user is at L at any time during the interval [TP – theta, TP+theta]