Discrete-time signal processing
Discrete-time signal processing
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Similarity-based queries for time series data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Fast time-series searching with scaling and shifting
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Duality-Based Subsequence Matching in Time-Series Databases
Proceedings of the 17th International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On Similarity-Based Queries for Time Series Data
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases
Data Mining and Knowledge Discovery
Detection of complex temporal patterns over data streams
Information Systems - Special issue: ADBIS 2002: Advances in databases and information systems
Online event-driven subsequence matching over financial data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A Unified Framework for Monitoring Data Streams in Real Time
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Subsequence matching on structured time series data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient stream sequence matching algorithms for handheld devices on time-series stream data
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Quantizing time series for efficient subsequence matching
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
A novel filtration method in biological sequence databases
Pattern Recognition Letters
Efficient moving average transform-based subsequence matching algorithms in time-series databases
Information Sciences: an International Journal
Using multiple indexes for efficient subsequence matching in time-series databases
Information Sciences: an International Journal
Ranked subsequence matching in time-series databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Information Sciences: an International Journal
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Noise Control Boundary Image Matching Using Time-Series Moving Average Transform
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Efficient indexing of interval time sequences
Information Processing Letters
Fast Normalization-Transformed Subsequence Matching in Time-Series Databases
IEICE - Transactions on Information and Systems
Towards faster activity search using embedding-based subsequence matching
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
Fast likelihood search for hidden Markov models
ACM Transactions on Knowledge Discovery from Data (TKDD)
Distortion-free predictive streaming time-series matching
Information Sciences: an International Journal
Correlation analysis of spatial time series datasets: a filter-and-refine approach
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
An MBR-safe transform for high-dimensional MBRs in similar sequence matching
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Benchmarking dynamic time warping for music retrieval
Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
Scaling-invariant boundary image matching using time-series matching techniques
Data & Knowledge Engineering
Fast Discovery of Group Lag Correlations in Streams
ACM Transactions on Knowledge Discovery from Data (TKDD)
A review on time series data mining
Engineering Applications of Artificial Intelligence
A parallel dimensionality reduction for time-series data and some of its applications
International Journal of Intelligent Information and Database Systems
A new approach for processing ranked subsequence matching based on ranked union
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On-line rule matching for event prediction
The VLDB Journal — The International Journal on Very Large Data Bases
Embedding-based subsequence matching in time-series databases
ACM Transactions on Database Systems (TODS)
An envelope-based approach to rotation-invariant boundary image matching
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Similar subsequence search in time series databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Continuously monitoring the correlations of massive discrete streams
Proceedings of the 20th ACM international conference on Information and knowledge management
Similarity matching for uncertain time series: analytical and experimental comparison
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Querying and Mining Uncertain Spatio-Temporal Data
DAPSS: exact subsequence matching for data streams
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Subseries join: a similarity-based time series match approach
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
Mining temporal patterns in popularity of web items
Information Sciences: an International Journal
A generic framework for efficient and effective subsequence retrieval
Proceedings of the VLDB Endowment
Uncertain time-series similarity: return to the basics
Proceedings of the VLDB Endowment
Data structures for detecting rare variations in time series
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Hi-index | 0.00 |
We generalize the method of constructing windows in subsequence matching. By this generalization, we can explain earlier subsequence matching methods as special cases of a common framework. Based on the generalization, we propose a new subsequence matching method, General Match. The earlier work by Faloutsos et al. (called FRM for convenience) causes a lot of false alarms due to lack of point-filtering effect. Dual Match, recently proposed as a dual approach of FRM, improves performance significantly over FRM by exploiting point filtering effect. However, it has the problem of having a smaller allowable window size---half that of FRM---given the minimum query length. A smaller window increases false alarms due to window size effect. General Match offers advantages of both methods: it can reduce window size effect by using large windows like FRM and, at the same time, can exploit point-filtering effect like Dual Match. General Match divides data sequences into generalized sliding windows (J-sliding windows) and the query sequence into generalized disjoint windows (J-disjoint windows). We formally prove that General Match is correct, i.e., it incurs no false dismissal. We then propose a method of estimating the optimal value of the sliding factor J that minimizes the number of page accesses. Experimental results for real stock data show that, for low selectivities (10-6∼10-4), General Match improves average performance by 117% over Dual Match and by 998% over FRM; for high selectivities (10-3∼10-1), by 45% over Dual Match and by 64% over FRM. The proposed generalization provides an excellent theoretical basis for understanding the underlying mechanisms of subsequence matching.