skip to main content
research-article

Bayesian network movement model

Published: 09 December 2016 Publication History

Abstract

To unify and integrate various types, resolutions, and levels of uncertainty of user location data, we employ a Bayesian learning approach, which allows to iteratively add new knowledge to refine a model describing the motion of an object in space and time. By explicitly modelling uncertainty, we maintain a notion of data reliability, such that the confidence of any query and mining results can be assessed. Based on this motion model for individual users, we present our algorithms for estimating the continuous location of users based on sparse observations. Our approach uses a global traffic model using a Markov-chain as an apriori-model, which is learned from all available historic trajectory data. Starting from this apriori-model, we use observations of individual users to adapt this model, using a forward backward approach to add new knowledge to the model. This yields as user-specific aposteriori-model, which captures information of their observation, and uses the apriori-knowledge to model the error and uncertainty in-between these observations. As verified by our empirical study on real trajectory data, this model allows to predict the location of objects in-between discrete observation much more accurate than competing approaches, thus significantly reducing the uncertainty in spatio-temporal data.

References

[1]
J. Aßfalg, H.-P. Kriegel, P. Kröger, and M. Renz. Probabilistic similarity search for uncertain time series. pages 435--443, 2009.
[2]
Z. Chen, H. T. Shen, and X. Zhou. Discovering popular routes from trajectories. pages 900--911, 2011.
[3]
T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, and A. Züfle. Indexing uncertain spatio-temporal data. pages 395--404, 2012.
[4]
S. Karlin and H. M. Taylor. A First Course in Stochastic Processes, volume 2. Academic Pr Inc, 1975.
[5]
B. Kuijpers and W. Othman. Trajectory databases: Data models, uncertainty and complete query languages. In JCSS, pages 538--560, 2010.
[6]
H. Mokhtar and J. Su. Universal trajectory queries for moving object databases. In Mobile Data Management (MDM), pages 133--144, 2004.
[7]
J. Niedermayer, A. Züfle, T. Emrich, M. Renz, N. Mamoulis, L. Chen, and H.-P. Kriegel. Probabilistic nearest neighbor queries on uncertain moving object trajectories. In VLDB, 2014.
[8]
A. Papoulis. Probability, Random Variables, and Stochastic Processes, 2nd ed. McGraw-Hill, 1984.
[9]
D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. pages 396--406, 2000.
[10]
C. Ré, J. Letchner, M. Balazinksa, and D. Suciu. Event queries on correlated probabilistic streams. pages 715--728, 2008.
[11]
S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. pages 331--342, 2000.
[12]
Y. Tao, C. Faloutsos, D. Papadias, and B. Liu. Prediction and indexing of moving objects with unknown motion patterns. pages 611--622, 2004.
[13]
Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. pages 334--345, 2002.
[14]
Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. pages 287--298, 2002.
[15]
Y. Tao, D. Papadias, and J. Sun. The tpr*tree: An optimized spatio-temporal access method for predictive queries. pages 790--801, 2003.
[16]
G. Trajcevski, A. N. Choudhary, O. Wolfson, L. Ye, and G. Li. Uncertain range queries for necklaces. In 11th International Conference on Mobile Data Management (MDM 2010), Kansas City, Missouri, pages 199--208, 2010.
[17]
G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I. F. Cruz. Continuous probabilistic nearest-neighbor queries for uncertain trajectories. pages 874--885, 2009.
[18]
G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing uncertainty in moving objects databases. ACM Trans. Database Syst., 29(3):463--507, 2004.
[19]
G. Trajcevski, O. Wolfson, F. Zhang, and S. Chamberlain. The geometry of uncertainty in moving objects databases. pages 233--250, 2002.
[20]
M.-Y. Yeh, K.-L. Wu, P. S. Yu, and M. Chen. Proud: A probabilistic approach to processing similarity queries over uncertain data streams. pages 684--695, 2009.
[21]
J. Yuan, Y. Zheng, X. Xie, and G. Sun. Driving with knowledge from the physical world. pages 316--324, 2011.
[22]
J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, and Y. Huang. T-drive: Driving directions based on taxi trajectories. In Proc. ACM GIS, 2010.
[23]
Y. Zheng and X. Zhou. Computing with Spatial Trajectories. Springer, 2011.
[24]
A. Züfle. Similarity search and mining in uncertain spatial and spatio-temporal databases. PhD thesis, lmu, 2013.

Cited By

View all
  • (2022)Multi-Agent Systems for Resource Allocation and Scheduling in a Smart GridSensors10.3390/s2221809922:21(8099)Online publication date: 22-Oct-2022

Recommendations

Comments

Information & Contributors

Information

Published In

cover image SIGSPATIAL Special
SIGSPATIAL Special  Volume 8, Issue 2
Special issue on spatio-temporal uncertainty
July 2016
40 pages
EISSN:1946-7729
DOI:10.1145/3024087
  • Editor:
  • Chi-Yin Chow
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2016
Published in SIGSPATIAL Volume 8, Issue 2

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Multi-Agent Systems for Resource Allocation and Scheduling in a Smart GridSensors10.3390/s2221809922:21(8099)Online publication date: 22-Oct-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media