Filters








90,147 Hits in 12.1 sec

Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency [article]

David Novak, Petr Volny, Pavel Zezula
2012 arXiv   pre-print
Therefore we present a new generic Subsequence Matching Framework (SMF) that tries to overcome the aforementioned problems by a uniform frame that simplifies and speeds up the design, development and evaluation  ...  This is an extended version of a paper published on DEXA 2012.  ...  best-matching subsequence from the sequences in the database.  ... 
arXiv:1206.2510v1 fatcat:n36zfkqetze23c7gxqppyjlmra

Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency [chapter]

David Novak, Petr Volny, Pavel Zezula
2012 Lecture Notes in Computer Science  
In this work, we present a new generic Subsequence Matching Framework (SMF) that tries to overcome the aforementioned problem by a uniform frame that simplifies and speeds up the design, development and  ...  It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence  ...  best-matching subsequence from the sequences in the database.  ... 
doi:10.1007/978-3-642-32597-7_23 fatcat:go3crounn5curc4l4fw5yberay

KV-match: A Subsequence Matching Approach Supporting Normalization and Time Warping [Extended Version] [article]

Jiaye Wu, Peng Wang, Ningting Pan, Chen Wang, Wei Wang, Jianmin Wang
2018 arXiv   pre-print
The volume of time series data has exploded due to the popularity of new applications, such as data center management and IoT. Subsequence matching is a fundamental task in mining time series data.  ...  UCR Suite can deal with normalized subsequence match problem (NSM), but it needs to scan full time series.  ...  Although General Match converts all values in a window into a multi-dimensional point, which keeps more information than the mean value used in KV-index, it generates candidates only based on one single  ... 
arXiv:1710.00560v3 fatcat:7thsd7vf5ndirgouqoui7jpome

Employing Subsequence Matching in Audio Data Processing [article]

Petr Volny, David Novak, Pavel Zezula
2012 arXiv   pre-print
We overview current problems of audio retrieval and time-series subsequence matching.  ...  To overcome the problems known from the time-series area like the occurrence of implementation bias and data bias we present a Subsequence Matching Framework as a tool for fast prototyping, building, and  ...  It is based on a generalization of constructing windows.  ... 
arXiv:1204.2541v1 fatcat:m45gm5pwkbc4xpmrmrcycm7xbq

Algorithm for Matching Sets of Time Series [chapter]

Iztok Savnik, Georg Lausen, Hans-Peter Kahle, Heinrich Spiecker, Sebastian Hein
2000 Lecture Notes in Computer Science  
Time series are time-stamped sequences of values which represent a parameter of the observed processes in subsequent time points.  ...  An algorithm for matching a sequence of values with the model is used for searching common patterns in the sets of time series, and for predicting the starting time points of undated time series.  ...  The search methods which were recently proposed for matching subsequences in time series databases are based on: the dynamic programming technique [2] , the sequential scan for pattern identification  ... 
doi:10.1007/3-540-45372-5_27 fatcat:f5jxf5ec3bbk3ck3y7eznzapgi

Generation of Pixel-Level SAR Image Time Series Using a Locally Adaptive Matching Technique

Liang Cheng, Yafei Wang, Manchun Li, Lishan Zhong, Jiechen Wang
2014 Photogrammetric Engineering and Remote Sensing  
A new polynomial is then used to satisfy the local geometric constraint. Based on this proposed matching technique, we introduce a pixel-level SAR image time series modeling method.  ...  Then, by analyzing the spatial distribution of the error of each matched pair in the previous iteration, local areas are divided based on the local clustering of pairs with large errors.  ...  Step 5: Write the Pixel-Level Time Series into the Database in Parallel The time series of each pixel generates a single record that is written in parallel to a conventional database, such as Oracle, Microsoft  ... 
doi:10.14358/pers.80.9.839 fatcat:o27pfordfrfblksgxocd3m7xga

Subsequence matching on structured time series data

Huanmei Wu, Betty Salzberg, Gregory C Sharp, Steve B Jiang, Hiroki Shirato, David Kaeli
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
Subsequence matching in time series databases is a useful technique, with applications in pattern matching, prediction, and rule discovery.  ...  This paper introduces our research effort in using the internal structure of a time series directly in the matching process.  ...  Still another problem is incorporating indexing in the search algorithm to more rapidly retrieve similar subsequences.  ... 
doi:10.1145/1066157.1066235 dblp:conf/sigmod/WuSSJSK05 fatcat:74gxldc64zbqrlg2cu44zsjrzu

Matching Consecutive Subpatterns Over Streaming Time Series [article]

Rong Kang, Chen Wang, Peng Wang, Yuting Ding, Jianmin Wang
2018 arXiv   pre-print
Pattern matching of streaming time series with lower latency under limited computing resource comes to a critical problem, especially as the growth of Industry 4.0 and Industry Internet of Things.  ...  However, against traditional single pattern matching model, a pattern may contain multiple subpatterns representing different physical meanings in the real world.  ...  spanning from developing time series database [6] .  ... 
arXiv:1805.06757v1 fatcat:o7o4pxxytrfkpdotm3pu2qjocy

Fast subsequence matching in time-series databases

Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
We present an e cient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a speci ed tolerance.  ...  In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space.  ...  Introduction The problem we focus on is the design of fast searching methods that will search a database with time-series of real numbers, to locate subsequences that match a query subsequence, exactly  ... 
doi:10.1145/191839.191925 dblp:conf/sigmod/FaloutsosRM94 fatcat:iiomlgwfhfctbfbqechhn3xssq

Fast subsequence matching in time-series databases

Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos
1994 SIGMOD record  
We present an e cient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a speci ed tolerance.  ...  In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space.  ...  Introduction The problem we focus on is the design of fast searching methods that will search a database with time-series of real numbers, to locate subsequences that match a query subsequence, exactly  ... 
doi:10.1145/191843.191925 fatcat:u6xpnmunevhjhpecdbifaaiy3e

Ranked Subsequence Matching in Time-Series Databases

Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Haifeng Jiang
2007 Very Large Data Bases Conference  
In this paper, we present novel methods for ranked subsequence matching under time warping, which finds top-k subsequences most similar to a query sequence from data sequences.  ...  Based on the mdmwp-distance, we then develop a ranked subsequence matching algorithm to prune unnecessary subsequence accesses.  ...  We develop a fast ranked subsequence matching solution for time-series databases using distances as the ranking method.  ... 
dblp:conf/vldb/HanLMJ07 fatcat:4eog7vo4tfh7hil4z6bo25ru4y

Matching Subsequence Music Retrieval in a Software Integration Environment

Zhencong Li, Qin Yao, Wanzhi Ma, Zhihan Lv
2021 Complexity  
This paper firstly introduces the basic knowledge of music, proposes the detailed design of a music retrieval system based on the knowledge of music, and analyzes the feature extraction algorithm and matching  ...  The matching retrieval of audio features is an important task in music retrieval. In this paper, the DTW algorithm is chosen as the main algorithm for retrieving music.  ...  For this kind of retrieval task, the method based on music subsequence matching is very suitable [5] .  ... 
doi:10.1155/2021/4300059 fatcat:rcefqi7v7bduthpwfneyquo3kq

Molecular formula and METLIN Personal Metabolite Database matching applied to the identification of compounds generated by LC/TOF-MS

Theodore R Sana, Joseph C Roark, Xiangdong Li, Keith Waddell, Steven M Fischer
2008 Journal of Biomolecular Techniques  
A total of 1387 ions were detected in human urine; 16 of these ions matched both accurate mass and retention time parameters for the 78 urine standards in the database.  ...  The synthetic mixture was analyzed and screened against this METLIN urine database, resulting in 46 accurate mass and retention time matches.  ...  Based on mass information only, mass 209.0687 matched methylsalicyluric acid (molecular formula: C 10 H 11 NO 4 ) in the database.  ... 
pmid:19137116 pmcid:PMC2567134 fatcat:v6ntwuwqijfrbdr63cxm2pi3o4

Pattern matching in historical data

Michael C. Johannesmeyer, Ashish Singhal, Dale E. Seborg
2002 AIChE Journal  
A new pattern-matching strategy is proposed for multi®ariate time series based on statistical techniques, especially principal-compo-( ) nent analysis PCA .  ...  For many engineering and business problems, it would be ®ery useful to ha®e a general strategy for pattern matching in large databases.  ...  This article is concerned with the following general pattern-matching problem. Given an arbitrary set of multivariate time-series data, how can similar patterns be located in a large database?  ... 
doi:10.1002/aic.690480916 fatcat:ijhn3ekozjarxdg7t6cut4ujzq

Efficient time-series subsequence matching using duality in constructing windows

Yang-Sae Moon, Kyu-Young Whang, Woong-Kee Loh
2001 Information Systems  
In this paper, we propose a new subsequence matching method, Dual Match. Dual Match exploits duality in constructing windows and significantly improves performance.  ...  Overall, these results indicate that our approach provides a new paradigm in subsequence matching that improves performance significantly in large database applications. r  ...  Acknowledgements We would like to thank Byoung-Yong Moon for helping in revising an earlier English version of this paper.  ... 
doi:10.1016/s0306-4379(01)00021-7 fatcat:txc4wz3jgrg25lgzh3t4a3fq3i
« Previous Showing results 1 — 15 out of 90,147 results