{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T22:11:21Z","timestamp":1775167881604,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":23,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369697","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"125-131","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Method for Discovering Variable-length Motifs in Time Series based on Suffix Array"],"prefix":"10.1145","author":[{"given":"Nguyen Ngoc","family":"Phien","sequence":"first","affiliation":[{"name":"Center for Applied Information Technology, Ton Duc Thang University, Ho Chi Minh City, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}]},{"given":"Nguyen Trong","family":"Nhan","sequence":"additional","affiliation":[{"name":"Center for Applied Information Technology, Ton Duc Thang University, Ho Chi Minh City, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}]},{"given":"Duong Tuan","family":"Anh","sequence":"additional","affiliation":[{"name":"Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3368926.3369697-1","doi-asserted-by":"crossref","unstructured":"N. Castro and P. Azevedo, \"Multiresolution motif discovery in time series,\" in Proceedings of the 2010 SIAM International Conference on Data Mining, 2010, pp. 665--676.","DOI":"10.1137\/1.9781611972801.73"},{"key":"key-10.1145\/3368926.3369697-2","doi-asserted-by":"crossref","unstructured":"B. Chiu, E. Keogh, and S. Lonardi, \"Probabilistic discovery of time series motifs,\" in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 493--498.","DOI":"10.1145\/956750.956808"},{"key":"key-10.1145\/3368926.3369697-3","unstructured":"H.A. Dau, E. Keogh, K. Kamger, C.C. M. Yeh, Y. Zhu, S. Garghabi, C. A. Ratanamahatana, Y. Chen, B. Hu, N. Begum, A. Bagnall, A. Mueen and A. Batista (2018). The ucr time series classification archive. Available: https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/"},{"key":"key-10.1145\/3368926.3369697-4","doi-asserted-by":"crossref","unstructured":"T.-c. Fu, \"A review on time series data mining,\", Engineering Applications of Artificial Intelligence, vol. 24, no. 1, pp. 164--181, 2011.","DOI":"10.1016\/j.engappai.2010.09.007"},{"key":"key-10.1145\/3368926.3369697-5","unstructured":"C. Gruber, M. Coduro, and B. Sick, \"Signature verification with dynamic RBF network and time series motifs\", in Proc. of 10th Int. Workshop on Frontiers in Hand Writing Recognition, 2006."},{"key":"key-10.1145\/3368926.3369697-6","doi-asserted-by":"crossref","unstructured":"E. Keogh, K. Chakrabatti, M. Pazzani, \"Dimensionality reduction for fast similarity search in large time series databases,\" Knowledge and Information Systems, vol. 3, no. 3, pp. 263--286, 2000.","DOI":"10.1007\/PL00011669"},{"key":"key-10.1145\/3368926.3369697-7","doi-asserted-by":"crossref","unstructured":"N. J. Larsson and A. Moffat, \"Offline Dictionary-Based Compression\". in Proc. DCC'99 Data Compression Conference, 29-31 March, Snowbird, UT, USA, pp. 296--305, 1999.","DOI":"10.1109\/DCC.1999.755679"},{"key":"key-10.1145\/3368926.3369697-8","doi-asserted-by":"crossref","unstructured":"Y. Li, J. Lin, \"Approximate Variable Length Time Series Motif Discovery Using Grammar Inference\", in Proc. of MDMKDD'10, July 25, Washington DC, U.S.A., 2010.","DOI":"10.1145\/1814245.1814255"},{"key":"key-10.1145\/3368926.3369697-9","doi-asserted-by":"crossref","unstructured":"J. Lin, E. Keogh, S. Lonardi, and B. Chiu, \"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, 2003, pp. 2--11.","DOI":"10.1145\/882082.882086"},{"key":"key-10.1145\/3368926.3369697-10","unstructured":"J. Lin, K. Eamonn, J. Lonardi, and P. Patel, \"Finding motifs in time series,\" in Proc. of the 2nd Workshop on Temporal Data Mining, 2002, pp. 53--68."},{"key":"key-10.1145\/3368926.3369697-11","doi-asserted-by":"crossref","unstructured":"B. Liu, J. Li, C. Chen, W. tan, Q. Chen, M. C. Zhou, \"Efficient Motif Discovery for Large-Scale Time Series in Healthcare\", IEEE Trans. on Industrial Informatics, Vol. 11, No. 3, June, 2015.","DOI":"10.1109\/TII.2015.2411226"},{"key":"key-10.1145\/3368926.3369697-12","doi-asserted-by":"crossref","unstructured":"U. Manber and G. Myers, \"Suffix arrays: a new method for online string searches,\" SIAM Journal on Computing, vol. 22, no. 5, pp. 935--948, 1993.","DOI":"10.1137\/0222058"},{"key":"key-10.1145\/3368926.3369697-13","doi-asserted-by":"crossref","unstructured":"A. Mueen, E. Keogh, Q. Zhu, S. Cash, and B. Westover, \"Exact discovery of time series motifs,\" in Proceedings of the 2009 SIAM International Conference on Data mining, 2009, pp. 473--484.","DOI":"10.1137\/1.9781611972795.41"},{"key":"key-10.1145\/3368926.3369697-14","doi-asserted-by":"crossref","unstructured":"C.G. Nevill-Manning and I. H. Witten, \"Identifying Hierarchical Structure in Sequences: A linear-time algorithm\", Journal of Artificial Intelligence Research, vol.7, 67--82, 1997.","DOI":"10.1613\/jair.374"},{"key":"key-10.1145\/3368926.3369697-15","doi-asserted-by":"crossref","unstructured":"D. Pradeepkumar, M. Bhunwal, V. Ravi, \"A Novel Hybrid Algorithm for Discovering Motifs from Financial Time Series\", in Proc. of SEMCCO, LNCS 8947, 201--211, 2015.","DOI":"10.1007\/978-3-319-20294-5_18"},{"key":"key-10.1145\/3368926.3369697-16","doi-asserted-by":"crossref","unstructured":"C. A. Ratanamahatana, J. Lin, D. Gunopulos, E. Keogh, M. Vlachos, and G. Das, \"Mining time series data,\" in Data Mining and Knowledge Discovery Handbook:, Springer, 2005, pp. 1069--1103..","DOI":"10.1007\/0-387-25465-X_51"},{"key":"key-10.1145\/3368926.3369697-17","doi-asserted-by":"crossref","unstructured":"P. Senin, J. Li, X. Wang, T. Oates, S. Gandhi, A. P. Boedihardjo, C. Chen, S. Frankenstein, \"GrammarViz 3.0: Interactive discovery of variable-length time series patterns,\" ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 12, no. 1, p. 10, 2018","DOI":"10.1145\/3051126"},{"key":"key-10.1145\/3368926.3369697-18","doi-asserted-by":"crossref","unstructured":"N. T. Son and D. T. Anh, \"Discovery of time series k-motifs based on multidimensional index,\" Knowledge and Information Systems, vol. 46, no. 1, pp. 59--86, 2016.","DOI":"10.1007\/s10115-014-0814-3"},{"key":"key-10.1145\/3368926.3369697-19","doi-asserted-by":"crossref","unstructured":"Y. Tanaka, K. Iwamoto, and K. Uehara, \"Discovery of time-series motif from multidimensional data based on MDL principle,\" Machine Learning, vol. 58, no. 2-3, pp. 269--300, 2005..","DOI":"10.1007\/s10994-005-5829-2"},{"key":"key-10.1145\/3368926.3369697-20","doi-asserted-by":"crossref","unstructured":"H. Tang, S. S. Liao, \"Discovering original motifs with different lengths from time series\", Knowledge-Based Systems, Vol. 21, 666--671, 2008.","DOI":"10.1016\/j.knosys.2008.03.022"},{"key":"key-10.1145\/3368926.3369697-21","unstructured":"M. Tompa and J. Buhler, \"Finding Motifs using Random Projection.\", in Proc. of the 5th Int. Conf. on Computational Molecular Biology, Motreal, Canada, Aoril 22-25, pp. 67--74, 2001."},{"key":"key-10.1145\/3368926.3369697-22","doi-asserted-by":"crossref","unstructured":"C. D. Truong and D. T. Anh, \"A novel clustering-based method for time series motif discovery under time warping measure,\" International Journal of Data Science and Analytics, vol. 4, no. 2, pp. 113--126, September 01 2017.","DOI":"10.1007\/s41060-017-0060-3"},{"key":"key-10.1145\/3368926.3369697-23","doi-asserted-by":"crossref","unstructured":"X. Xi, E. Keogh, L. Wei, A. Mafra-Neto, \"Finding Motifs in a Database of Shapes\", in Proc. of the 2007 SIAM Int. Conf. on Data Mining, April 26-28, Minneapolis, Minnesota, U.S.A., 249--260, 2007.","DOI":"10.1137\/1.9781611972771.23"}],"event":{"name":"the Tenth International Symposium","location":"Hanoi, Ha Long Bay, Viet Nam","acronym":"SoICT 2019","number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"start":{"date-parts":[[2019,12,4]]},"end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369697&ftid=2101254&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:51Z","timestamp":1750203891000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369697"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369697","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}