참고문헌
- R. Agrawal, C. Faloutsos, and A. Swami, “Efficient Similarity Search in Sequence Databases,” In Proc. Int'l Conf. on Foundations and Data Organization and Algorithm (FODO), Chicago, Illinois, pp.69-84, Oct., 1993
- M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander, “OPTICS: Ordering Points To Identify the Clustering Structure,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Philadelphia, Pennsylvania, pp.49-60, June, 1999
- R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, Addison Wesley, 1999
- P. J. Carrington, J. Scott, and S Wasserman, Models and Methods in Social Network Analysis, Cambridge University Press, 2005
- S. Chien and N. Immorlica, “Semantic Similarity between Search Engine Queries Using Temporal Correlation,” In Proc. Int'l Conf. on World Wide Web (WWW), Chiba, Japan, pp. 2-11, May, 2005 https://doi.org/10.1145/1060745.1060752
- M. G. Elfeky, W. G. Aref, and A. K. Elmagarmid, “Periodicity Detection in Time Series Databases,” IEEE Trans. on Knowledge and Data Engineering (TKDE), Vol.17, No.7, pp.875-887, July, 2005 https://doi.org/10.1109/TKDE.2005.114
- C. Elkan, “Using the Triangle Inequality to Accelerate k-Means,” In Proc. Int'l Conf. on Machine Learning (ICML), Washington, DC, pp. 147-153, Aug., 2003
- M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A Density -Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise,” In Proc. Int'l Conf. on Knowledge Discovery and Data Mining (KDD), Portland, Oregon, pp.226-231, Aug., 1996
- C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, “Fast Subsequence Matching in Time-Series Databases,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp.419-429, May, 1994 https://doi.org/10.1145/191843.191925
- R. C. Gonzalez and R. E. Woods, Digital Image Processing, Prentice Hall, 2nd Ed., 2002
- J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2nd Ed., 2005
- M. R. Henzinger, “Web Information Retrieval – An Algorithmic Perspective,” In Proc. Annual European Symposium (ESA), Saarbrucken, Germany, pp.1-8, Sept., 2000
- E. J. Keogh, “Exact Indexing of Dynamic Time Warping,” In Proc. Int'l Conf. on Very Large Data Bases (VLDB), Hong Kong, China, pp.406-417, Aug., 2002
- E. J. Keogh and S. Kasetty, “On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration,” In Proc. Int'l Conf. on Knowledge Discovery and Data Mining, ACM SIGKDD, Edmonton, Canada, pp.102-111, July, 2002 https://doi.org/10.1145/775047.775062
- E. J. Keogh, L. Wei, X. Xi, S.-H. Lee, and M. Vlachos, “LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures,” In Proc. Int'l Conf. on Very Large Data Bases(VLDB), Seoul, Korea, pp.882-893, Sept., 2006
- R. Kosala and H. Blockeel, “Web Mining Research: A Survey,” SIGKDD Explorations, Vol.2, No.1, pp.1-15, June, 2000 https://doi.org/10.1145/360402.360406
- A. N. Langville and C. D. Meyer, “A Survey of Eigenvector Methods of Web Information Retrieval,” The SIAM Review, Vol.47, No.1, pp.135-161, Jan., 2005 https://doi.org/10.1137/S0036144503424786
- J. Lin, M. Vlachos, E. J. Keogh, and D. Gunopulos, “Iterative Incremental Clustering of Time Series,” In Proc. Int'l Conf. on Extending Database Technology (EDBT), Crete, Greece, pp.106-122, Mar., 2004
- J. Lin et al., “An MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams,” In Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining (PAKDD), Hanoi, Vietnam, pp.333-342, May, 2005
- J. McQueen, “Some Methods for Classification and Analysis of Multivariate Observation,” In Proc. Berkeley Symp. on Mathematical Statistics and Probability, Berkeley, California, pp.281-297, 1967
- Y.-S. Moon, K.-Y. Whang, and W.-K. Loh, “Duality-Based Subsequence Matching in Time-Series Databases,” In Proc. Int'l Conf. on Data Engineering (ICDE), IEEE, Heidelberg, Germany, pp.263-272, Apr., 2001
- Y.-S. Moon, K.-Y. Whang, and W.-S. Han, “General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp. 382-393, June, 2002 https://doi.org/10.1145/564691.564735
- M. Nanni, “Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics,” In Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining (PAKDD), Hanoi, Vietnam, pp.378-387, May, 2005 https://doi.org/10.1007/11430919_45
- W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, 2nd Ed., 1992
- J. G. Proakis and D. K. Manolakis, Digital Signal Processing, Prentice Hall, 4th Ed., 2006
- C. Ratanamahatana and E. J. Keogh, “Three Myths about Dynamic Time Warping Data Mining,” In Proc. SIAM International Data Mining Conference (SDM), Newport Beach, California, pp.506-510, Apr., 2005
- Y. Sakurai, S. Papadimitriou, and C. Faloutsos, “AutoLag: Automatic Discovery of Lag Correlations in Stream Data,” In Proc. Int'l Conf. on Data Engineering(ICDE), Tokyo, Japan, pp.159-160, Apr., 2005 https://doi.org/10.1109/ICDE.2005.24
- M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. J. Keogh, “Indexing Multi-Dimensional Time-Series with Support for Multiple Distance Measures,” In Proc. Int'l Conf. on Knowledge Discovery and Data Mining, ACM SIGKDD, Washington, D.C., pp. 216-225, Aug., 2003 https://doi.org/10.1145/956750.956777
- M. Vlachos, C. Meek, Z. Vagena, and D. Gunopulos, “Identifying Similarities, Periodicities and Bursts for Online Search Queries,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Paris, France, pp.131-142, June, 2004 https://doi.org/10.1145/1007568.1007586
- B.-K. Yi, H. V. Jagadish, and C. Faloutsos, “Efficient Retrieval of Similar Time Sequences Under Time Warping,” In Proc. Int'l Conf. on Data Engineering (ICDE), Orlando, Florida, pp.201-208, Feb., 1998 https://doi.org/10.1109/ICDE.1998.655778
- B.-K. Yi and C. Faloutsos, “Fast Time Sequence Indexing for Arbitrary Lp Norms,” In Proc. Int'l Conf. on Very Large Data Bases(VLDB), Cairo, Egypt, pp.385-394, Sept., 2000
- T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: An Efficient Data Clustering Method for Very Large Databases,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Montreal, Canada, pp.103-114, June, 1996