Abstract
RFID applications usually rely on RFID deployments to manage high-level events. A fundamental relation for these purposes is the location of people and objects over time. However, the nature of RFID data streams is noisy, redundant and unreliable and thus streams of low-level tag-reads can be transformed into probabilistic data streams that can reach in practical cases the size of gigabytes in a day. In this paper, we propose a simple on-line summarization mechanism, which is able to provide small space representation for massive RFID probabilistic data streams while preserving the meaningful information. The main idea behind the proposed approach is to keep on aggregating tuples in an incremental way until a state transition is detected. Probabilistic tuples are processed as they arrive, hence avoiding the use of expensive offline disk based operations, and the output is stored in a probabilistic database in such a way that, as we also experimentally prove, a wide range of probabilistic queries can be applicable and answered effectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aggarwal, C., Yu, P.: A framework for clustering uncertain data streams. In: Proceedings of the 24th International Conference on Data Engineering, pp. 150–159. IEEE (2008)
Cucchiara, R., Fornaciari, M., Haider, R., Mandreoli, F., Martoglia, R., Prati, A., Sassatelli, S.: A Reasoning Engine for Intruders’ Localization in Wide Open Areas using a Network of Cameras and RFIDs. In: Proceedings of 1st IEEE Workshop on Camera Networks and Wide Area Scene Analysis. IEEE (2011)
Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, vol. 1996, pp. 226–231. AAAI Press, Portland (1996)
Gonzalez, H., Han, J., Li, X., Klabjan, D.: Warehousing and analyzing massive RFID data sets. In: 22nd International Conference on Data Engineering, ICDE 2006. IEEE Computer Society (2006)
Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: ACM SIGMOD Record, vol. 27, pp. 73–84. ACM (1998)
Hu, W.C., Cheng, Z.L.: Clustering algorithm for probabilistic data streams over sliding window. In: Proceedings of the 9th International Conference on Machine Learning and Cybernetics (ICMLC), pp. 2065–2070. IEEE (2010)
Huang, J., Antova, L., Koch, C., Olteanu, D.: MayBMS: a probabilistic database management system. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, pp. 1071–1074. ACM (2009)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Compututing Survey 31, 264–323 (1999)
Kim, D., Kim, J., Kim, S., Yoo, S.: Design of RFID based the Patient Management and Tracking System in hospital. In: 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS, pp. 1459–1461. IEEE (2008)
Kriegel, H., Pfeifle, M.: Density-based clustering of uncertain data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 672–677. ACM (2005)
Legány, C., Juhász, S., Babos, A.: Cluster validity measurement techniques. In: Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, pp. 388–393 (2006)
Ngai, W., Kao, B., Chui, C., Cheng, R., Chau, M., Yip, K.: Efficient clustering of uncertain data. In: Proceedings of the 6th International Conference on Data Mining (ICDM), pp. 436–445. IEEE (2006)
Ré, C., Letchner, J., Balazinksa, M., Suciu, D.: Event queries on correlated probabilistic streams. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 715–728 (2008)
Xu, H., Li, G.: Density-based probabilistic clustering of uncertain data. In: Proceedings of International Conference on Computer Science and Software Engineering, pp. 474–477. IEEE (2008)
Zhang, C., Gao, M., Zhou, A.: Tracking high quality clusters over uncertain data streams. In: 25th International Conference on Data Engineering, ICDE 2009, pp. 1641–1648. IEEE (2009)
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM SIGMOD Record, vol. 25, pp. 103–114. ACM (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haider, R., Mandreoli, F., Martoglia, R., Sassatelli, S. (2012). Fast On-Line Summarization of RFID Probabilistic Data Streams. In: Dua, S., Gangopadhyay, A., Thulasiraman, P., Straccia, U., Shepherd, M., Stein, B. (eds) Information Systems, Technology and Management. ICISTM 2012. Communications in Computer and Information Science, vol 285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29166-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-29166-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29165-4
Online ISBN: 978-3-642-29166-1
eBook Packages: Computer ScienceComputer Science (R0)