| 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 1st 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 |
|
| [2]. Rafiei, D., and Mendelzon, A. O., 1998, Efficient retrieval of similar time sequences using DFT. In Proceedings of the 5th International Conference on Foundations of Data Organization and Algorithms, Kobe, Japan, pp. 249-257 |
Sách, tạp chí |
| Tiêu đề: |
Efficient retrieval of similar time sequences using DFT |
|
| [3]. Chan, K., and Fu, A. W., 1999, Efficient time series matching by wavelets. In Proceedings of the 15th IEEE International Conference on Data Engineering, Sydney, Australia, pp. 126-133 |
Sách, tạp chí |
| Tiêu đề: |
Efficient time series matching by wavelets |
|
| [4]. Berndt, D., and, Clifford J., 1994, Using dynamic time warping to find patterns in time series. In Proceedings of AAAI Workshop on Knowledge Discovery in Databases, KDD 94, Seattle, Washington, USA, pp. 359-370 |
Sách, tạp chí |
| Tiêu đề: |
Using dynamic time warping to find patterns in time series |
|
| [5]. Agrawal, R., Lin, K. I., Sawhney, H. S., and Shim, K., 1995, Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proceedings of the 21st International Conference on Very Large Databases, VLDB95, Zurich, Switzerland, pp. 490-501 |
Sách, tạp chí |
| Tiêu đề: |
Fast similarity search in the presence of noise, scaling, and translation in time-series databases |
|
| [6]. Fabian, M., 2003, Time series feature extraction for data mining using DWT and DFT, Technical Report No. 33, Department of Mathematics and Computer Science, University of Marburg, Germany, 31 pages |
Sách, tạp chí |
| Tiêu đề: |
Time series feature extraction for data mining using DWT and DFT |
|
| [8]. Keogh, E., Chu, S., Hart, D., and Pazzani, M. J., 2001, An online algorithm for segmenting time series. In Proceedings of the IEEE International Conference on Data Mining, California, USA, pp. 289-296 |
Sách, tạp chí |
| Tiêu đề: |
An online algorithm for segmenting time series |
|
| [9]. Chen, Q., Chen, L., Lian, X., Liu, Y., and Yu, J. X., 2007, Indexable PLA for efficient similarity search. In Proceedings of the 33rd international conference on Very large data bases, Vienna, Austria, pp. 435-446 |
Sách, tạp chí |
| Tiêu đề: |
Indexable PLA for efficient similarity search |
|
| [10]. Jarke, J. V. W., and Edward, R. V. S., 1999, Cluster and Calendar based Visualization of Time Series Data. In Proceedings of the 1999 IEEE Symposium on Information Visualization, Washington, DC, USA, pp. 4 |
Sách, tạp chí |
| Tiêu đề: |
Cluster and Calendar based Visualization of Time Series Data |
|
| [11]. Lin, J., Vlachos, M., Keogh, E., and Gunopulos, D., 2004, Iterative Incremental Clustering of Time Series. In Proceedings of the IX Conference on Extending Database Technology (EDBT 2004), Crete, Greece, pp. 14-18 |
Sách, tạp chí |
| Tiêu đề: |
Iterative Incremental Clustering of Time Series |
|
| [12]. Keogh, E. J., and Pazzani, M. J., 1999, An Indexing Scheme for Fast Similarity Search in Large Time Series Databases. In Proceedings of the 11th International Conference on Scientific and Statistical Database Management, pp. 56 |
Sách, tạp chí |
| Tiêu đề: |
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases |
|
| [13]. Alsabti, K., Ranka, S., and Singh, V., 1998, An Efficient K-Means Clustering Algorithm. In Proceedings of IPPS/SPDP Workshop on High Performance Data Mining |
Sách, tạp chí |
| Tiêu đề: |
An Efficient K-Means Clustering Algorithm |
|
| [14]. Warren Liao, T., 2005, Clustering of time series data—a survey. In Pattern Recognition, Volume 38, Issue 11 (November 2005), pp. 1857-1874 |
Sách, tạp chí |
| Tiêu đề: |
Clustering of time series data—a survey |
|
| [16]. Keogh, E., 2006, A Decade of Progress in Indexing and Mining Large Time Series Databases. Tuorial of 32nd International Conference on Very Large Data Bases (VLDB’2006), Seoul, Korea, pp. 1268 - 1268 |
Sách, tạp chí |
| Tiêu đề: |
A Decade of Progress in Indexing and Mining Large Time Series Databases |
|
| [17]. Keogh, E., 2007, Mining Shape and Time Series Databases with Symbolic Representations. Tutorial of the 13rd ACM International Conference on Knowledge Discovery and Data Mining, KDD 2007, California, USA |
Sách, tạp chí |
| Tiêu đề: |
Mining Shape and Time Series Databases with Symbolic Representations |
|
| [18]. Lin, J., Vlachos, M., Keogh, E., Gunopulos, D., Liu, J., Yu, S., and Le, J., 2005, A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams. In Advances in Knowledge Discovery and Data Mining, Volume 3518/2005, pp. 333-342 |
Sách, tạp chí |
| Tiêu đề: |
A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams |
|
| [19]. Laszlo, M., and Mukherjee, S., 2007, A genetic algorithm that exchanges neighboring centers for k-means clustering. In Pattern Recognition Letters, Volume 28 Issue 16, pp. 2359-2366 |
Sách, tạp chí |
| Tiêu đề: |
A genetic algorithm that exchanges neighboring centers for k-means clustering |
|
| [20]. Pena, J., Lozano, J., and Larranaga, P., 1999, An Empirical comparison of four initialization methods for the k-means algorithm. In Pattern Recognition Letters Vol. 20, pp. 1027-1040 |
Sách, tạp chí |
| Tiêu đề: |
An Empirical comparison of four initialization methods for the k-means algorithm |
|
| [21]. Redmond, S. J., and Heneghan, C., 2007, A method for initialising the K-means clustering algorithm using kd-trees. In Pattern Recognition Letters, Volume 28, Issue 8 (June 2007), pp. 965-973 |
Sách, tạp chí |
| Tiêu đề: |
A method for initialising the K-means clustering algorithm using kd-trees |
|
| [22]. Sample, N., Haines, M., Arnold, M., and Purcell, T., 2001, Optimizing Search Strategies in kd-trees. In: 5th WSES/IEEE World Multiconference on Circuits |
Sách, tạp chí |
| Tiêu đề: |
Optimizing Search Strategies in kd-trees |
|