Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
A fast algorithm for computing longest common subsequences
Communications of the ACM
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Approximating Polygons and Subdivisions with Minimum Link Paths
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Mining Frequent Spatio-Temporal Sequential Patterns
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Cluster Analysis and Optimization in Color-Based Clustering for Image Abstract
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Discovery of convoys in trajectory databases
Proceedings of the VLDB Endowment
TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering
Proceedings of the VLDB Endowment
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Tracking High Quality Clusters over Uncertain Data Streams
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Real-Time Traffic Flow Statistical Analysis Based on Network-Constrained Moving Object Trajectories
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
IEEE Transactions on Knowledge and Data Engineering
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Mining moving object, trajectory and traffic data
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
On discovering moving clusters in spatio-temporal data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
A false negative approach to mining frequent itemsets from high speed transactional data streams
Information Sciences: an International Journal
Hi-index | 0.00 |
Continuous sensor stream data are often recorded as a series of discrete points in a database from which knowledge can be retrieved through queries. Two classes of uncertainties inevitably happen in sensor streams that we present as follows. The first is Uncertainty due to Discrete Sampling (DS Uncertainty); even if every discrete point is correct, the discrete sensor stream is uncertain - that is, it is not exactly like the continuous stream - since some critical points are missing due to the limited capabilities of the sensing equipment and the database server. The second is Uncertainty due to Sampling Error (SE Uncertainty); sensor readings for the same situation cannot be repeated exactly when we record them at different times or use different sensors since different sampling errors exist. These two uncertainties reduce the efficiency and accuracy of querying common patterns. However, already known algorithms generally only resolve SE Uncertainty. In this paper, we propose a novel method of Correcting Imprecise Readings and Compressing Excrescent (CIRCE) points. Particularly, to resolve DS Uncertainty, a novel CIRCE core algorithm is developed in the CIRCE method to correct the missing critical points while compressing the original sensor streams. The experimental study based on various sizes of sensor stream datasets validates that the CIRCE core algorithm is more efficient and more accurate than a counterpart algorithm to compress sensor streams. We also resolve the SE Uncertainty problem in the CIRCE method. The application for querying longest common route patterns validates the effectiveness of our CIRCE method.