Particle swarm optimization method in multiobjective problems
Proceedings of the 2002 ACM symposium on Applied computing
ULDBs: databases with uncertainty and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Event queries on correlated probabilistic streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
A Bayesian approach to tracking multiple targets using sensorarrays and particle filters
IEEE Transactions on Signal Processing
Sequential Monte Carlo methods for multiple target tracking anddata fusion
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
The management of the uncertainties over data is an urgent problem of novel applications such as cyber-physical system, sensor network and RFID data management. In order to adapt the characteristics of evolving over time of sensor data in real-time location tracing service based on RFID, a measuring algorithm for the Uncertainty of RFID Data-PPMU (a particle filter and particle swarm optimization-based measuring uncertainty algorithm for RFID Data) is proposed in this paper. PPMU can change the number of samples adaptively on the basis of K---L distance to adapt the evolution of RFID data, and PPMU introduces an improved PSO (particle swarm optimization) method to enhance the efficiency of re-sampling phase of SIRPF (sequential importance re-sampling particle filter). Meanwhile, PPMU defines a fitness function base on Conventional Weighted Aggregation for PSO that balances the importance between the priori density and likelihood density to detect the most optimal samples among candidate sample sets. It provides a measurement with confidence factor for initial tuples in the probability RFID database. Experiments on real dataset show the proposed method can effectively measure the underlying uncertainty over RFID data. Compared with existing algorithms, PPMU can be further improved particle degradation and particle impoverishment problem.