| Tài liệu tham khảo |
Loại |
Chi tiết |
| [1]. Gunopulos, D., Das, G. and Mannila, H. (1997), “Finding similar time series”. In Proceedings of the 1 st European Symposium on Principles of Data Mining and Knowledge Discovery, PKDD97, Trondheim, Norway, pp. 88-100 |
Sách, tạp chí |
| Tiêu đề: |
Finding similar time series”. "In Proceedings of the 1"st" European Symposium on Principles of Data Mining and Knowledge Discovery |
| Tác giả: |
Gunopulos, D., Das, G. and Mannila, H |
| Năm: |
1997 |
|
| [2]. Lin, Y. (2008) “Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation”. PhD Thesis, University of Waterloo, Ontario, Canada |
Sách, tạp chí |
| Tiêu đề: |
Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation”. "PhD Thesis, University of Waterloo |
|
| [3]. Mcreight, E.M. (1976) “A space-economical suffix tree construction algorithm”. Journal of the ACM , 23, 2 (Apr. 1976), pp. 262-272 |
Sách, tạp chí |
| Tiêu đề: |
A space-economical suffix tree construction algorithm”. "Journal of the ACM |
|
| [4]. “The UCR Time Series Classification/Clustering” Homepage: http://www.cs.ucr.edu/~eamonn/time_series_data/ |
Sách, tạp chí |
| Tiêu đề: |
The UCR Time Series Classification/Clustering |
|
| [5]. Lin, J., Keogh, E., Lonardi, S. and Chiu, B. (2003). “A Symbolic Representation of Time Series, with Implications for Streaming Algorithms”. In Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. San Diego, CA.June 13, 2003 |
Sách, tạp chí |
| Tiêu đề: |
A Symbolic Representation of Time Series, with Implications for Streaming Algorithms”. "In Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery |
| Tác giả: |
Lin, J., Keogh, E., Lonardi, S. and Chiu, B |
| Năm: |
2003 |
|
| [6]. Keogh, E. and Kasetty, S. (2002). “On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration”. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. July 23 - 26, 2002. Edmonton, Alberta, Canada. pp 102-111 |
Sách, tạp chí |
| Tiêu đề: |
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration”. "In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining |
| Tác giả: |
Keogh, E. and Kasetty, S |
| Năm: |
2002 |
|
| [8]. Morrison, D.R. (1968) “PATRICIA - Practical algorithm to retrieve information coded in alphanumeric”. Journal of the ACM , 15, 4, pp.514-534 |
Sách, tạp chí |
| Tiêu đề: |
PATRICIA - Practical algorithm to retrieve information coded in alphanumeric”. "Journal of the ACM |
|
| [9]. Weiner, P. (1973) “Linear pattern matching algorithms”. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory (Washington, DC, USA 1973), IEEE Computer Society, pp. 1-11 |
Sách, tạp chí |
| Tiêu đề: |
Linear pattern matching algorithms”. "In Proceedings of the 14th Annual Symposium on Switching and Automata Theory (Washington, DC, USA 1973) |
|
| [10]. Bockenhauer, H.J. and Bongartz, D. (1998) “Algorithmic Aspects of Bioinformatics”. ACM Computing Classification, pp. 58-79 |
Sách, tạp chí |
| Tiêu đề: |
Algorithmic Aspects of Bioinformatics”. "ACM Computing Classification |
|
| [11]. Karkkainen, J., Sanders, P. and Burkhardt, S. (2006) “Linear Work Suffix Array Construction”. Journal of the ACM, Vol. 53, No. 6, November 2006, pp. 918–936 |
Sách, tạp chí |
| Tiêu đề: |
Linear Work Suffix Array Construction”. "Journal of the ACM |
|
| [12]. Lian, X., and Chen, L. (2009). “Efficient Similarity Join over Multiple Stream Time Series”. IEEE Transactions on Knowledge and Data Engineering, Vol. 20, No. 11, November |
Sách, tạp chí |
| Tiêu đề: |
Efficient Similarity Join over Multiple Stream Time Series”. "IEEE Transactions on Knowledge and Data Engineering |
| Tác giả: |
Lian, X., and Chen, L |
| Năm: |
2009 |
|
| [13]. Brinkhoff, T., Kriegel, H.P. and Seeger, B. (1993). “Efficient Processing of Spatial Joins Using R-Trees”. Proc. ACM SIGMOD |
Sách, tạp chí |
| Tiêu đề: |
Efficient Processing of Spatial Joins Using R-Trees” |
| Tác giả: |
Brinkhoff, T., Kriegel, H.P. and Seeger, B |
| Năm: |
1993 |
|
| [14]. Guttman, A. (1984). “R-trees: A Dynamic Index Structure for Spatial Searching”. Proc. ACM SIGMOD |
Sách, tạp chí |
| Tiêu đề: |
R-trees: A Dynamic Index Structure for Spatial Searching” |
| Tác giả: |
Guttman, A |
| Năm: |
1984 |
|
| [15]. Lo, M.L. and Ravishankar, C.V. (1996). “Spatial Hash-Joins”. Proc. ACM SIGMOD |
Sách, tạp chí |
| Tiêu đề: |
Spatial Hash-Joins” |
| Tác giả: |
Lo, M.L. and Ravishankar, C.V |
| Năm: |
1996 |
|
| [16]. Huang, Y.W., Jing, N., and Rundensteiner, E.A. (1997). “Spatial Joins Using R-Trees: Breadth-First Traversal with Global Optimizations”.Proc. 23rd Int’l Conf. Very Large Data Bases (VLDB) |
Sách, tạp chí |
| Tiêu đề: |
Spatial Joins Using R-Trees: Breadth-First Traversal with Global Optimizations” |
| Tác giả: |
Huang, Y.W., Jing, N., and Rundensteiner, E.A |
| Năm: |
1997 |
|
| [17]. Keogh, E. (2002). “Exact indexing of dynamic time warping”. In 28 th International Conference on Very Large Data Bases, (pp. 406-417). Hong Kong |
Sách, tạp chí |
| Tiêu đề: |
Exact indexing of dynamic time warping”. In" 28"th"International Conference on Very Large Data Bases |
| Tác giả: |
Keogh, E |
| Năm: |
2002 |
|
| [18]. Mueen, A., Hamooni, H. and Estrada, T. (2014). “Time Series Join on Subsequence Correlation”. In Data Mining (ICDM), 2014 IEEE International Conference on. pp. 450-459 |
Sách, tạp chí |
| Tiêu đề: |
Time Series Join on Subsequence Correlation”. In" Data Mining (ICDM), 2014 IEEE International Conference on |
| Tác giả: |
Mueen, A., Hamooni, H. and Estrada, T |
| Năm: |
2014 |
|
| [19]. Slissenko, A.O. (1983) “Detection of periodicities and string-matching in real time”. Journal of Soviet Mathematics, 22, 3, pp. 1316-1386 |
Sách, tạp chí |
| Tiêu đề: |
Detection of periodicities and string-matching in real time”. "Journal of Soviet Mathematics |
|
| [20]. Kosaraju, S.R. (1994) “Real-time pattern matching and quasi-real-time construction of suffix trees”. In Proceedings of the 26th annual ACM symposium on theory of computing, ACM, pp. 310-316 |
Sách, tạp chí |
| Tiêu đề: |
Real-time pattern matching and quasi-real-time construction of suffix trees”. "In Proceedings of the 26th annual ACM symposium on theory of computing, ACM |
|
| [21]. Dan, G. (1997) “Algorithms on Strings, Trees, and Sequences”. University of California, Davis Cambridge University Press, pp. 94-107 |
Sách, tạp chí |
| Tiêu đề: |
Algorithms on Strings, Trees, and Sequences |
|