AgCleaning: A Track Data Filling Algorithm Based on Movement Recency for RFID Track Data

Article Preview

Abstract:

For the traditional data cleaning algorithms mainly fill up the data based on the space-time relevance in the data level, they are not suitable for RFID application scenarios with track information based on multi-logical areas. This paper proposed a track data filling algorithm based on movement recency by studying the characteristics of RFID track data. This algorithm maintains a track event tree according to the historical data, to predict the future data and guide the data cleaning. Also it considers the effect on the movement rules from time factor and brings in the ageing factor for maintaining the track event tree, which improved the predict accuracy of the tree and raise the veracity of the filling algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1330-1337

Citation:

Online since:

January 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. R. Jeffery, G. Alonso, M. J. Franklin, A pipelined framework for online cleaning of sensor data streams, In Proceedings of the 22nd International Conference on Data Engineering, 2006, pp.140-140.

DOI: 10.1109/icde.2006.8

Google Scholar

[2] S. R. Jeffery, M. Garofalakis, and M. Franklin, Adaptive cleaning for RFID data streams, In Proceedings of the 32nd international conference on Very large data bases, 2006, pp.163-174.

Google Scholar

[3] B. Kanagal, et al, Online filtering, smoothing and probabilistic modeling of streaming data, In Proceedings of the 24th International Conference on Data Engineering, 2008, pp.1160-1169.

DOI: 10.1109/icde.2008.4497525

Google Scholar

[4] T. Trany, C. Suttonz, et al, Probabilistic inference over RFID streams in mobile environments, " , In Proceedings of the 25th International Conference on Data Engineering, 2009, pp.1096-1107.

Google Scholar

[5] H. Chen, W. S. Ku, et al, Leveraging spatio-temporal redundancy for RFID data cleansing, In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, 2010, pp.51-62.

DOI: 10.1145/1807167.1807176

Google Scholar

[6] Y. Bai, F. Wang, P. Liu, Efficiently filtering RFID data streams, In CleanDB Workshop, 2006, pp.50-57.

Google Scholar

[7] Y. Gu, G. Yu, X. L. Hu, et al, Efficient RFID Data Cleaning Model Based on Dynamic Clusters of Monitored Objects, In Journal of Software, 2010, 21(4), pp.632-643.

DOI: 10.3724/sp.j.1001.2010.03565

Google Scholar

[8] Y. Gu, G. Yu, X. J. Li, Y. Wang, RFID Data Interpolation Algorithm Based on Dynamic Probabilistic Path-Event Model, In Journal of Software, 2010, 21(3), pp.438-451.

DOI: 10.3724/sp.j.1001.2010.03454

Google Scholar