Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Similarity-based queries for time series data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Time-series similarity problems and well-separated geometric sets
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Factorial Hidden Markov Models
Machine Learning - Special issue on learning with probabilistic representations
Melodic matching techniques for large music databases
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Scaling up dynamic time warping for datamining applications
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Segment-based approach for subsequence searches in sequence databases
Proceedings of the 2001 ACM symposium on Applied computing
HMM-based musical query retrieval
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
General match: a subsequence matching method in time-series databases based on generalized windows
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Similarity search of time-warped subsequences via a suffix tree
Information Systems
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Name that tune: a pilot study in finding a melody from a sung query
Journal of the American Society for Information Science and Technology
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Subsequence matching on structured time series data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An efficient and accurate method for evaluating time series similarity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Transition movement models for large vocabulary continuous sign language recognition
FGR' 04 Proceedings of the Sixth IEEE international conference on Automatic face and gesture recognition
Elastic partial matching of time series
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Challenging Uncertainty in Query by Humming Systems: A Fingerprinting Approach
IEEE Transactions on Audio, Speech, and Language Processing
| Hi-index | 0.00 |
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of music. Dynamic Time Warping (DTW) identifies an optimal alignment between two time series, and computes the matching cost corresponding to that alignment. Significant speed-ups can be achieved by constrained Dynamic Time Warping (cDTW), which narrows down the set of positions in one time series that can be matched with specific positions in the other time series. Both methods are designed for full sequence matching but can also be applied for subsequence matching, by using a sliding window over each database sequence to compute a matching score for each database subsequence. In addition, SPRING is a dynamic programming approach designed for subsequence matching, where the query is matched with a database subsequence without requiring the match length to be equal to the query length. SPRING has a lower computational cost than DTW and cDTW. Our database consists of a set of MIDI files taken from the web. Each MIDI file has been converted to a 2-dimensional time series, taking into account both note pitches and durations. We have used synthetic queries of fixed size and different noise levels. Surprisingly, when looking for the top-K best matches, all three approaches show similar behavior in terms of retrieval accuracy for small values of K. This suggests that for the specific application area, a computationally cheaper method, such as SPRING, is sufficient to retrieve the best top-K matches.