1. Similar subsequence search studies in multi-dimensional time series data
Because dynamic time bending distance is much better than oxyster distance, it is widely used as a measure of similarity in the search for subseries similar to time series data. A similar subsequence search on a single dimension may not be able to get enough matching results to allow for further in-depth analysis
Computer research and development question no. 03 of 2010
Ai-assisted reading
2. Improved algorithms for rapid search of similar time series
The accuracy of the index spatial similarity measure is low and the i/o time between internal and external data stored during later processing is longer in the existing similar time series search algorithm. In response to this problem, a non-linear dimension of approximately abbreviated technology is used to suggest a similar time series for improvement... In detail >
Computer engineering 16 issues in 2009
Ai-assisted reading
3. Overview of research on multiple time series similarities
Multi-temporal-series similarity, which is the hot spot for research in the field of data mining, consists mainly of characterization, similar mode measurements and similarity searches. Currently, most of the research has focused on characterization and similar mode measurements, while similar searches have become a constraint..
Control and decision-making 04 2017
Ai-assisted reading
4. A subsequence search algorithm for long-paced trends
In order to overcome the disadvantages of vague and slow physical search based on the similarity of the time series from point-to-point, the temporal sequence of trends (pts) concept was proposed and, on that basis, a variable long trend subseries search algorithm was proposed. The algorithm was based on the linear... Details of the time series >
Zhejiang university journal (industrial edition), december 2004
Ai-assisted reading
5. Search algorithms based on time series similarities of map/reduce
Introduction of parallel computing strategies into time series processing, introduction of search algorithms based on map/reduce time series similarity, full use of cloud computing to perform large-scale computing and data processing characteristics, effective reduction of time series similarity operations in search, simple... Details >
Shandong university journal (technology edition), 01st 2016
Ai-assisted reading
6. Statistics of data comparability based on time series
The status of the time-series similarity search study was presented, based on a specified search sequence as an algorithm to be applied to specific statistical practices. Time-series similarity search studies are challenging and limited. ... Details
Inner mongolia university of electricity, 06, 2007
Ai-assisted reading
7. Search algorithms for time series similarities based on angular bending
In response to a question about the poorness of the search algorithm based on the similarity of the time series at point distance, a pro-formation-oriented time series was suggested as an approximation of methodology and similarity metrics. Algorithms do not depend on time series length and field knowledge. The basis for changing features while taking full advantage of the time series..
Computer engineering 15 issues in 2011
Ai-assisted reading
8. Efficient time-series similar search techniques
Time-series similar searches are considered one of the most promising technologies in the future. However, time series data are typical high-dimensional mass data, and the development of efficient algorithms is crucial.... The paper provides an overview of the status and progress of research on time series-like search techniques, as well as the main elements of the study, and discusses the technology in detail > >
Computer journal, 11th 2009
Ai-assisted reading
9. Search simulations for data multi-dimensional sequence similarities based on sequence transformation
In response to the longer search time and lower search accuracy for traditional data multi-dimensional sequence similarity, a multi-dimensional sequence similarity search for data based on sequence transformation was proposed. Based on the analysis of changes in the overall data shape of the serial points, extract the main... Details of the time series >
Computer simulation 202009
Ai-assisted reading
10. Quick search algorithms based on the lowest difference circulation chain
General methods of common time-series similarity searches were analysed, and fast search algorithms based on the lowest deviation circulation chain were proposed. The underlying idea is to symbolize stock data and to minimize the first difference in the chain of chain after the symbolization of data, which effectively resolves the time... Details
Computer knowledge and technology 19 issues in 2009
Ai-assisted reading
