Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/FSKD.2014.6980891 | FSKD |
Keywords | DocType | Citations |
time tolerance threshold,data stream cleaning,user-appointed constraint,telecommunication network reliability,redundancy deleting algorithm,self-learned constraint,constraint strategy,RFID data cleaning,telecommunication computing,radiofrequency identification,dynamic path data cleaning algorithm,redundancy,data handling,data redundancy,Radio Frequency Identification (RFID) | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kongfa Hu | 1 | 38 | 9.26 |
| Long Li | 2 | 0 | 0.34 |
| Chengjun Hu | 3 | 0 | 0.34 |
| Jiadong Xie | 4 | 0 | 0.68 |
| Zhipeng Lü | 5 | 159 | 14.07 |