A Dynamic Path Data Cleaning Algorithm Based on Constraints for RFID Data Cleaning

摘要：

　　The traditional data cleaning technology cannot fully meet the needs of cleaning RFID data streams.The original data set collected by the readers is very enormous and with a lot of redundancies,it is not suitable to the following cleaning process.This paper proposes a redundancy deleting algorithm.By setting a time tolerance threshold,it cleans the data redundancy and reduces the data,avoiding the redundancy refill in the following data cleaning processes.At the same time,considering the different constraints existing in different RFID applications,we propose a data cleaning algorithm based on constraints which can guide the data cleaning with the self-learned constraints and user-appointed constraints,and improve the accuracy of cleaning.

关键词： Radio Frequency Identification (RFID) data stream cleaning constraint strategy

作者: Kongfa Hu Long Li Chengjun Hu Jiadong Xie Zhipeng Lu

作者单位: College of Information Technology Nanjing University of Chinese Medicine Nanjing,China

会议类型: 国际会议

会议名称: The 2014 10th International Conference on Natural Computation (ICNC 2014) and the 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

会议地点: 厦门

会议语种:英文

页码: 545-550

在线出版日期: 2014-08-19（万方平台首次上网日期，不代表论文的发表时间）