• DocumentCode
    606778
  • Title

    Finding frequently visited paths: Dealing with the uncertainty of spatio-temporal mobility data

  • Author

    Baratchi, M. ; Meratnia, Nirvana ; Havinga, P.J.M.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Twente, Enschede, Netherlands
  • fYear
    2013
  • fDate
    2-5 April 2013
  • Firstpage
    479
  • Lastpage
    484
  • Abstract
    With the ever-increasing advancements in sensor technology and localization systems, large amounts of spatio-temporal data can be collected from moving objects equipped with wireless sensor nodes. Analysis of such data provides the opportunity of extracting useful information about movement behaviour and interaction between moving objects. Inherent characteristics of wireless sensor nodes cause the data collected by them to have low or irregular frequency and often be erroneous. Existence of different levels of uncertainty in these data makes the procedure of finding movement patterns difficult and ambiguous. In this paper, we propose a hierarchical approach to find the frequently visited paths using location data of people carrying a custom designed mobile wireless sensor node. We hierarchically cluster trajectories and find their resemblance at the finest level while dealing with the uncertainties. The performance evaluation results show that compared with previous schemes, our method performs better in presence of ambiguity and sources of data uncertainty.
  • Keywords
    spatiotemporal phenomena; wireless sensor networks; data uncertainty; frequently visited paths; localization systems; sensor technology; spatio-temporal mobility data; wireless sensor nodes; Global Positioning System; Interpolation; Semantics; Trajectory; Uncertainty; Wireless communication; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Sensors, Sensor Networks and Information Processing, 2013 IEEE Eighth International Conference on
  • Conference_Location
    Melbourne, VIC
  • Print_ISBN
    978-1-4673-5499-8
  • Type

    conf

  • DOI
    10.1109/ISSNIP.2013.6529837
  • Filename
    6529837