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.