Learning Significant Locations and Predicting User Movement with GPS Daniel Ashbrook and Thad Starner Learning Significant Locations and Predicting User.

Slides:



Advertisements
Similar presentations
Artificial Intelligence 12. Two Layer ANNs
Advertisements

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
MP3 proposal. Template  Title  Your group name and group members  Application overview  Main functions  Detail description  Timeline and task assignment.
Inferences The Reasoning Power of Expert Systems.
SCENARIO Suppose the presenter wants the students to access a file Supply Credenti -als Grant Access Is it efficient? How can we make this negotiation.
Estimation in Sampling
Spatiotemporal Pattern Mining For Travel Behavior Prediction UIC IGERT Seminar 02/14/2007 Chad Williams.
Hidden Markov Models Ellen Walker Bioinformatics Hiram College, 2008.
Forecasting Presence and Availability Joe Tullio CS8803.
Network Operating Systems Users are aware of multiplicity of machines. Access to resources of various machines is done explicitly by: –Logging into the.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
On Reducing Communication Cost for Distributed Query Monitoring Systems. Fuyu Liu, Kien A. Hua, Fei Xie MDM 2008 Alex Papadimitriou.
Home: Phones OFF Please Unix Kernel Parminder Singh Kang Home:
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
University of Athens, Greece Pervasive Computing Research Group An Online Adaptive Model for Location Prediction University of Athens, Department of Informatics.
Learning the meaning of places IfGi Location based Services SS 06 Milad Sabersamandari.
Probabilistic Model of Sequences Bob Durrant School of Computer Science University of Birmingham (Slides: Dr Ata Kabán)
October 14, 2010Neural Networks Lecture 12: Backpropagation Examples 1 Example I: Predicting the Weather We decide (or experimentally determine) to use.
16: Distributed Systems1 DISTRIBUTED SYSTEM STRUCTURES NETWORK OPERATING SYSTEMS The users are aware of the physical structure of the network. Each site.
Role and Place of Statistical Data Analysis and very simple applications Simplified diagram of a scientific research When you know the system: Estimation.
Using GPS to learn significant locations and predict movement across multiple users Daniel Ashbrook, Thad Starner College Of Computing, Georgia Institute.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
SoundSense: Scalable Sound Sensing for People-Centric Application on Mobile Phones Hon Lu, Wei Pan, Nocholas D. lane, Tanzeem Choudhury and Andrew T. Campbell.
Context Awareness System and Service SCENE JS Lee 1 Energy-Efficient Rate-Adaptive GPS-based Positioning for Smartphones.
DANIEL ASHBROOK AND THAD STARNER COLLEGE OF COMPUTING GEORGIA INSTITUTE OF TECHNOLOGY PERSONAL AND UBIQUITOUS COMPUTING, 2003 Using GPS to Learn Significant.
Applied Transportation Analysis ITS Application SCATS.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Patient Location via Received Signal Strength (RSS) Analysis D. Albano, C. Comeau, J. Ianelli, S. Palastro Components Hardware Pre-existing b infrastructure.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Project.  Topic should be: Clear and specific Practical and meaningful, this means the results of your research must have some implications in real life.
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Understanding and Presenting Your Data OR What to Do with All Those Numbers You’re Recording.
Art 315 Lecture 6 Dr. J. Parker. Variables Variables are one of a few key concepts in programming that must be understood. Many engineering/cs students.
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.
From Theory to Practice: Inference about a Population Mean, Two Sample T Tests, Inference about a Population Proportion Chapters etc.
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
Deducing Mode and Purpose from GPS Data Peter Stopher, Jun Zhang and Eoin Clifford Institute of Transport and Logistics Studies The University of Sydney.
1 Virtual COMSATS Inferential Statistics Lecture-16 Ossam Chohan Assistant Professor CIIT Abbottabad.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Learning and Inferring Transportation Routines By: Lin Liao, Dieter Fox and Henry Kautz Best Paper award AAAI’04.
Time Management.  Time management is concerned with OS facilities and services which measure real time, and is essential to the operation of timesharing.
Task Analysis Methods IST 331. March 16 th
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Statistical Inference for the Mean Objectives: (Chapter 9, DeCoursey) -To understand the terms: Null Hypothesis, Rejection Region, and Type I and II errors.
The famous “sprinkler” example (J. Pearl, Probabilistic Reasoning in Intelligent Systems, 1988)
Indoor Location Detection By Arezou Pourmir ECE 539 project Instructor: Professor Yu Hen Hu.
Network Coding Data Collecting Mechanism based on Prioritized Degree Distribution in Wireless Sensor Network Wei Zhang, Xianghua Xu, Qinchao Zhang, Jian.
Presented By, Shivvasangari Subramani. 1. Introduction 2. Problem Definition 3. Intuition 4. Experiments 5. Real Time Implementation 6. Future Plans 7.
Data Mining Spring 2007 Noisy data Data Discretization using Entropy based and ChiMerge.
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
Week Aug-24 – Aug-29 Introduction to Spatial Computing CSE 5ISC Some slides adapted from the book Computing with Spatial Trajectories, Yu Zheng and Xiaofang.
1 An infrastructure for context-awareness based on first order logic 송지수 ISI LAB.
Time Management.  Time management is concerned with OS facilities and services which measure real time.  These services include:  Keeping track of.
PROCESS RESILIENCE By Ravalika Pola. outline: Process Resilience  Design Issues  Failure Masking and Replication  Agreement in Faulty Systems  Failure.
Fault Tolerance (2). Topics r Reliable Group Communication.
Probabilistic Robotics Introduction. SA-1 2 Introduction  Robotics is the science of perceiving and manipulating the physical world through computer-controlled.
Statistical Inference for the Mean Objectives: (Chapter 8&9, DeCoursey) -To understand the terms variance and standard error of a sample mean, Null Hypothesis,
GSU Indoor Navigation Senior Project Fall Semester 2013 Michael W Tucker.
What is filter ? A filter is a circuit that passes certain frequencies and rejects all others. The passband is the range of frequencies allowed through.
Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments.
Chapter 11 – Neural Nets © Galit Shmueli and Peter Bruce 2010 Data Mining for Business Intelligence Shmueli, Patel & Bruce.
Lecture-6 Bscshelp.com. Todays Lecture  Which Kinds of Applications Are Targeted?  Business intelligence  Search engines.
Authors: Jiang Xie, Ian F. Akyildiz
Introduction Wireless devices offering IP connectivity
Classification with Perceptrons Reading:
The Medium Access Control Sublayer
Artificial Intelligence 12. Two Layer ANNs
CS 416 Artificial Intelligence
Presentation transcript:

Learning Significant Locations and Predicting User Movement with GPS Daniel Ashbrook and Thad Starner Learning Significant Locations and Predicting User Movement with GPS Daniel Ashbrook and Thad Starner Avinash Parnandi

Learning Significant Locations and Predicting User Movement with GPS: Learning Significant Locations: Significant Locations are those locations which we commonly visit & spend time, over a period of time(say one semester). e.g. Home, Work, KOH, Leavey, DRB-Lab, Smart-Final… etc. Predicting User Movement: After collecting the GPS data and analyzing it, it uses Markov Model to predict user movement and answer queries like: – right now the user is at home, what is the likely place she`ll go next? -- how likely is he to stop at the grocery store on way from school to home. Location is one of the most commonly used context. Given this other information can inferred i.e. what are you doing(Stadium-Match, Classroom-Studying, Movie Hall- Movie etc.)

Applications: Single User Applications: Single User Associate a To-Do list or Reminders with location. So the reminders will pop up depending on your location e.g.“Buy Vegetables” when you are near a grocery stor e. This is where Prediction spices up the system… Early reminders --- Suppose you`ve a library book to return & the phone predicts that you`ll be taking the library route today so it`ll prompt a reminder before you leave your home instead of reminding you near the library. Location prediction abilities could allow a wearable computer to optimize its transmissions based on availability of service in various locations and the knowledge of how its user moves throughout the day.

Applications: Multi User Simplest example : “Will I see Bob today?“ Another application is scheduling a meeting of several people depending on their calendar. Serendipitous meeting. Intelligent Interruption: Location models can be used to make an intelligent guess about whether the user is interruptible or not. S uppose your location says that you are in a lecture or at your workplace and cannot be disturbed so it`ll automatically take your phone into silent mode. Requires sharing of information. Various mechanisms are available like central server, sharing only with trusted associates etc. Here privacy issues needs to be taken care of.

Implementation Hardware: Collects the data using a GPS receiver & data logger. Software: Processes the data, then by using a Markov Model makes prediction about user movements based upon this data. Duration of experiment: 4 months Data logger recorded the output from the GPS receiver at an interval of one second, but only if the receiver was moving at one mile an hour or greater. This helps pre-process the data. Limitation of GPS: Accuracy of the GPS receiver was 15 meters; this means that the same physical location will have a different GPS coordinate from day to day.

Significant Locations We are interested in the places where the user spends time and by looking at the time gaps in the GPS data we can find these significant locations. Time gaps will occur when the data logger is not logging which happens when either you are stationary(less than 1mph) in an open place or you are in a building with no GPS signal. Both these cases mean that you spend your time here. The value of time gap is an important parameter. Whenever a point is found that has more than a certain time ‘t’ between it and the previous point, we conclude that the point marks a significant location. ◦ So now we`ve the significant locations……

Determining places & Clustering Determining places & Clustering Because GPS measurements taken in the same physical location can vary by as much as 15 meters, the logger may record different point for a location even if the user stops at precisely the same point. Hence create clusters of some radius ‘r’. All GPS locations inside a cluster are now recognized by the cluster ID. So original hundreds of thousands of GPS coordinates are now just a few significant locations. Clustering done by a variant of K-mean clustering Algorithm.

K Mean Clustering 1. Take one place point and a radius. All the points within this radius of the place are marked, and the mean of these points is found. 2. The mean is then taken as the new centre point, and the process is repeated. 3. This continues until the mean stops changing. 4. When the mean no longer moves, all points within its radius are placed in its cluster and removed from consideration

To determine the Radius: knee

Radius of a Cluster: Identifying Sub-locations Radius of a Cluster: Identifying Sub-locations Problem with radius of the cluster-- Large R— small transits like SSL-RTH wont be predicted. All it`ll say is – ‘campus’, which is a cluster. Small R—Many locations will be individual clusters which is exactly what we want to avoid by clustering. Also broader trips will not be predicted. Variable R – Sub-locations inside a cluster, Campus can be a cluster & RTH, SSL, Lyon can be sub-locations.

So now we have our locations, what next?? Prediction!!!!

Prediction A Markov Model is created for each location in the map with transition to other locations. What is a Markov Model? ◦ Markov Models are State Transition models with the nodes being the states & with corresponding state transition probabilities between the nodes. ◦ It follows the Markov Rule i.e. future state depends on the current state and observational data & independent of past states. A simple random walk is an example of Markov Chain.

How does it work? This model predicts user movement. Given current location, it reads out transition probabilities for all possible locations from this location and the one with the highest probability is accepted and taken as the next move. Probability here is the relative frequency of transitions. If no transition ever occurs between two nodes then the transition probability between those nodes is zero.

Future Work & Limitations: Future Work: This project was for single user, so the next obvious step is Multi-User collaboration. Design a Markov Model to support time based prediction. Can predict where someone will go next but not when. Limitations: Changes in schedule may take a long time to be reflected in the model. Does not update the user models in real time.

Related Work: Multi-User: Learning locations & Prediction Work done by the same group. Mostly similar work, few changes to the approach. The data collected was implemented for multi user collaborative applications. Still does not support time prediction. Adaptive mobility prediction for location management using mobile positioning Location management scheme for mobile wireless networks is presented T he mobile periodically compares its current location (GPS) with the predicted location and sends an autonomous location update whenever the prediction error exceeds a certain threshold.

Related Work: Learning Significant Locations from GPS Data with Time Window: (Tang Jian, Meng Lingkui 2006) They identify significant locations but no prediction. Distinguishes the location of the same place where the user went at different time i.e. OHE at 11 AM is different from OHE at 3:30 PM. They make use of the fact that every GPS point is acquired with a time stamp. Can be the basis for time based prediction.

References: Learning Significant Locations and Predicting User Movement with GPS & Using GPS to learn significant locations and predict movement across multiple users: Daniel Ashbrook and Thad Starner Learning Significant Locations from GPS Data with Time Window: Tang Jian, Meng Lingkui. Adaptive mobility prediction for location management using mobile positioning: Zhang Rui, Bassiouni Mostafa A. markov-model/

Thanks!!!

Questions ?????