| Tài liệu tham khảo |
Loại |
Chi tiết |
| [1] P. Indyk , N. Koudas and . S. Muthukrishnan, "Identifying Representative Trends in Massive Time Series Data Sets Using Sketches,"Proceedings of the 26th International Conference on Very Large Data Bases, pp. 363-372, 2000 |
Sách, tạp chí |
| Tiêu đề: |
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches |
|
| [2] Y. Qu, C. Wang and X. S. Wang, "Supporting fast search in time series for movement patterns in multiple scales," Proceedings of the seventh International Conference on Information and Knowledge management, pp.251-258, 1998 |
Sách, tạp chí |
| Tiêu đề: |
Supporting fast search in time series for movement patterns in multiple scales |
|
| [3] U. Manber and G. Myers, "Suffix arrays: a new method for on-line string searches," Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pp. 319-327, 1990 |
Sách, tạp chí |
| Tiêu đề: |
Suffix arrays: a new method for on-line string searches |
|
| [4] J. Kọrkkọinen, P. Sanders and S. Burkhardt, "Simple linear work suffix array," Proceedings of the 13th international conference on automata, languages and programming, pp. 943-955, 2003 |
Sách, tạp chí |
| Tiêu đề: |
Simple linear work suffix array |
|
| [5] P. Ko and S. Aluru, "Space efficient linear time construction of suffix," Proceedings of the 14th annual symposium on combinatorial pattern, pp. 200- 210, 2003 |
Sách, tạp chí |
| Tiêu đề: |
Space efficient linear time construction of suffix |
|
| [6] T. Kasai, . G. Lee, . H. Arimura, . S. Arikawa and K. Park, "Linear- time longest-common-prefix computation in suffix arrays and its applications," in Proceedings of the 12th Annual Symposium on Combinatorial, London, 2001 |
Sách, tạp chí |
| Tiêu đề: |
Linear-time longest-common-prefix computation in suffix arrays and its applications |
|
| [9] E. Keogh, S. Chu, D. Hart and M. Pazzani, "An online algorithm for segmenting time series," Proceedings of the IEEE International Conference on Data Mining, California,USA, pp. 289-296, 2001 |
Sách, tạp chí |
| Tiêu đề: |
An online algorithm for segmenting time series |
|
| [10] A. Udechukwu, K. Barker and R. Alhajj, "Discovering All Frequent Trends in Time Series," Proceedings of the winter international synposium on Information and Communication Technologies, pp. 1-6, 2004 |
Sách, tạp chí |
| Tiêu đề: |
Discovering All Frequent Trends in Time Series |
|
| [11] J. Lin, E. Keogh, P. Patel and S. Lonardi, "Mining motifs in massive time series databases," Proceedings of the 2002 IEEE International Conference on Data Mining , p. 370 |
Sách, tạp chí |
| Tiêu đề: |
Mining motifs in massive time series databases |
|
| [12] B. Chiu, E. Keogh and S. Lonardi, "Probabilistic discovery of time series motifs," Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 493-498, 2003 |
Sách, tạp chí |
| Tiêu đề: |
Probabilistic discovery of time series motifs |
|
| [13] E. Keogh and M. Pazzani, "An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback," Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, New York,NY, pp. 239-241, 27-31 Aug 1998 |
Sách, tạp chí |
| Tiêu đề: |
An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback |
|
| [14] G. Roberto and G. F. Italiano, "Suffix trees and their applications in string algorithms," Proceedings of the 1st South American Workshop on String Processing, pp. 57-76, 1993 |
Sách, tạp chí |
| Tiêu đề: |
Suffix trees and their applications in string algorithms |
|
| [15] A. T. Dương, "An overview of similarity search in time series data," Tạp chí phát triển khoa học và Công nghệ - Đại học Quốc Gia, vol. 14, no.k2, pp. 71-79, 2011 |
Sách, tạp chí |
| Tiêu đề: |
An overview of similarity search in time series data |
|
| [17] R. S. Kosaraju, "Real-time pattern matching and quasi-real-time," Proceedings of the 26th annual ACM symposium on theory of computing, pp.310-316, 1994 |
Sách, tạp chí |
| Tiêu đề: |
Real-time pattern matching and quasi-real-time |
|
| [18] J. Lin, E. Keogh, S. Lonardi and B. Chiu, "A Symbolic Representation of Time Series, with Implications for Streaming Algorithms," Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, pp. 2-11, 2003 |
Sách, tạp chí |
| Tiêu đề: |
A Symbolic Representation of Time Series, with Implications for Streaming Algorithms |
|
| [19] M. Barsky, U. Stege and A. Thomo, "A survey of practical algorithms for suffix tree construction in external memory," Software—Practice &Experience, vol. 40, pp. 965-988, 2010 |
Sách, tạp chí |
| Tiêu đề: |
A survey of practical algorithms for suffix tree construction in external memory |
|
| [20] A. Moffat and S. J. Puglisi , "Reducing Space Requirements for Disk Resident Suffix Arrays," Proceedings of the 14th International Conference on Database Systems for Advanced Applications, pp. 730 - 744, 2009 |
Sách, tạp chí |
| Tiêu đề: |
Reducing Space Requirements for Disk Resident Suffix Arrays |
|
| [21] A. Turpin and S. J. Puglisi, "Space-Time Tradeoffs for Longest- Common-Prefix Array Computation," School of Computer Science and Information Technology, RMIT University, Melbourne, Australia |
Sách, tạp chí |
| Tiêu đề: |
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation |
|
| [22] R. Sinha, S. Puglisi, A. Moffat and A. Turpin, "Improving suffix array locality for fast pattern matching on disk," Proceedings of the 2008 ACM SIGMOD international conference on Management of data , pp. 661-672 , 2008 |
Sách, tạp chí |
| Tiêu đề: |
Improving suffix array locality for fast pattern matching on disk |
|