{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:26:18Z","timestamp":1777695978343,"version":"3.51.4"},"reference-count":42,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2021,3,4]]},"abstract":"<jats:p>Time series similarity search is an essential operation in time series data mining and has received much higher interest along with the growing popularity of time series data. Although many algorithms to solve this problem have been investigated, there is a challenging demand for supporting similarity search in a fast and accurate way. In this paper, we present a novel approach, TS2BC, to perform time series similarity search efficiently and effectively. TS2BC uses binary code to represent time series and measures the similarity under the Hamming Distance. Our method is able to represent original data compactly and can handle shifted time series and work with time series of different lengths. Moreover, it can be performed with reasonably low complexity due to the efficiency of calculating the Hamming Distance. We extensively compare TS2BC with state-of-the-art algorithms in classification framework using 61 online datasets. Experimental results show that TS2BC achieves better or comparative performance than other the state-of-the-art in accuracy and is much faster than most existing algorithms. Furthermore, we propose an approximate version of TS2BC to speed up the query procedure and test its efficiency by experiment.<\/jats:p>","DOI":"10.3233\/ida-194876","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T12:45:42Z","timestamp":1615293942000},"page":"439-461","source":"Crossref","is-referenced-by-count":11,"title":["An efficient method for time series similarity search using binary code representation and hamming distance"],"prefix":"10.1177","volume":"25","author":[{"given":"Haowen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yabo","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Duanqing","family":"Xu","sequence":"additional","affiliation":[]}],"member":"179","reference":[{"key":"10.3233\/IDA-194876_ref1","doi-asserted-by":"crossref","unstructured":"H. Abe, M. Ohsaki, H. Yokoi and T. Yamaguchi, Implementing an integrated time-series data mining environment based on temporal pattern extraction methods: a case study of an interferon therapy risk mining for chronic hepatitis, in: Annual Conference of the Japanese Society for Artificial Intelligence, Springer, 2005, pp. 425\u2013435.","DOI":"10.1007\/11780496_45"},{"issue":"2","key":"10.3233\/IDA-194876_ref2","first-page":"40","article-title":"Tuning time series queries in finance: case studies and recommendations","volume":"22","author":"Shasha","year":"1999","journal-title":"IEEE Data Eng. Bull."},{"issue":"4","key":"10.3233\/IDA-194876_ref3","doi-asserted-by":"crossref","first-page":"3100","DOI":"10.3390\/s100403100","article-title":"Energy-aware scheduling of surveillance in wireless multimedia sensor networks","volume":"10","author":"Wang","year":"2010","journal-title":"Sensors"},{"issue":"11","key":"10.3233\/IDA-194876_ref5","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","article-title":"Clustering of time series data \u2013 a survey","volume":"38","author":"Liao","year":"2005","journal-title":"Pattern Recognition"},{"issue":"1","key":"10.3233\/IDA-194876_ref6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/IDA-150351","article-title":"Empirical study of symbolic aggregate approximation for time series classification","volume":"21","author":"Song","year":"2017","journal-title":"Intelligent Data Analysis"},{"key":"10.3233\/IDA-194876_ref7","doi-asserted-by":"crossref","unstructured":"M. Shokoohi-Yekta, Y. Chen, B. Campana, B. Hu, J. Zakaria and E. Keogh, Discovery of meaningful rules in time series, in: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2015, pp. 1085\u20131094.","DOI":"10.1145\/2783258.2783306"},{"issue":"4","key":"10.3233\/IDA-194876_ref8","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s10044-011-0262-6","article-title":"A shape-based similarity measure for time series data with ensemble learning","volume":"16","author":"Nakamura","year":"2013","journal-title":"Pattern Analysis and Applications"},{"key":"10.3233\/IDA-194876_ref9","doi-asserted-by":"crossref","unstructured":"J. Peng, H. Wang, J. Li and H. Gao, Set-based similarity search for time series, in: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, ACM, 2016, pp. 2039\u20132052.","DOI":"10.1145\/2882903.2882963"},{"key":"10.3233\/IDA-194876_ref10","doi-asserted-by":"crossref","unstructured":"Y. Ye, J. Jiang, B. Ge, Y. Dou and K. Yang, Similarity measures for time series data classification using grid representation and matrix distance, in: Knowledge and Information Systems, 2018, pp. 1\u201330.","DOI":"10.1007\/s10115-018-1264-0"},{"key":"10.3233\/IDA-194876_ref11","doi-asserted-by":"crossref","first-page":"24503","DOI":"10.1109\/ACCESS.2017.2764633","article-title":"A new time series representation model and corresponding similarity measure for fast and accurate similarity detection","volume":"5","author":"Zhang","year":"2017","journal-title":"IEEE Access"},{"issue":"1","key":"10.3233\/IDA-194876_ref12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2379776.2379788","article-title":"Time-series data mining","volume":"45","author":"Esling","year":"2012","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"10.3233\/IDA-194876_ref13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TKDE.2015.2462369","article-title":"Similarity measure selection for clustering time series databases","volume":"28","author":"Mori","year":"2015","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"10.3233\/IDA-194876_ref14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10618-012-0250-5","article-title":"Experimental comparison of representation methods and distance measures for time series data","volume":"26","author":"Wang","year":"2013","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"6","key":"10.3233\/IDA-194876_ref15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TKDE.2004.14","article-title":"Skyline index for time series data","volume":"16","author":"Li","year":"2004","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-194876_ref16","unstructured":"D.J. Berndt and J. Clifford, Using dynamic time warping to find patterns in time series, in: KDD Workshop, Vol. 10, no. 16, Seattle, WA, 1994, pp. 359\u2013370."},{"key":"10.3233\/IDA-194876_ref17","doi-asserted-by":"crossref","unstructured":"T.S. Nguyen and T.A. Duong, Time series similarity search based on middle points and clipping, in: 2011 3rd Conference on Data Mining and Optimization (DMO), IEEE, 2011, pp. 13\u201319.","DOI":"10.1109\/DMO.2011.5976498"},{"issue":"6","key":"10.3233\/IDA-194876_ref18","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/TPAMI.2013.231","article-title":"Fast exact search in hamming space with multi-index hashing","volume":"36","author":"Norouzi","year":"2013","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.3233\/IDA-194876_ref19","doi-asserted-by":"crossref","unstructured":"A. Torralba, R. Fergus and Y. Weiss, Small codes and large image databases for recognition, in: 2008 IEEE Conference on Computer Vision and Pattern Recognition, 2008, pp. 1\u20138.","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"10.3233\/IDA-194876_ref20","unstructured":"D. Zhang, G. Yang, Y. Hu, Z. Jin, D. Cai and X. He, A unified approximate nearest neighbor search scheme by combining data structure and hashing, in: Twenty-Third International Joint Conference on Artificial Intelligence, 2013."},{"issue":"3","key":"10.3233\/IDA-194876_ref21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","article-title":"Dimensionality reduction for fast similarity search in large time series databases","volume":"3","author":"Keogh","year":"2001","journal-title":"Knowledge and information Systems"},{"key":"10.3233\/IDA-194876_ref22","doi-asserted-by":"crossref","unstructured":"E. Keogh, K. Chakrabarti, M. Pazzani and S. Mehrotra, Locally adaptive dimensionality reduction for indexing large time series databases, in: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Vol. 30, no. 2, 2001, pp. 151\u2013162.","DOI":"10.1145\/376284.375680"},{"key":"10.3233\/IDA-194876_ref23","unstructured":"E.J. Keogh and M.J. Pazzani, An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback, in: Kdd, Vol. 98, 1998, pp. 239\u2013243."},{"key":"10.3233\/IDA-194876_ref24","unstructured":"Q. Chen, L. Chen, X. Lian, Y. Liu and J.X. Yu, Indexable pla for efficient similarity search, in: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB Endowment, 2007, pp. 435\u2013446."},{"key":"10.3233\/IDA-194876_ref25","unstructured":"T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos and W. Truppel, Online amnesic approximation of streaming time series, in: Proceedings. 20th International Conference on Data Engineering, IEEE, 2004, pp. 339\u2013349."},{"key":"10.3233\/IDA-194876_ref26","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, ACM, 2003, pp. 2\u201311.","DOI":"10.1145\/882082.882086"},{"key":"10.3233\/IDA-194876_ref27","doi-asserted-by":"crossref","unstructured":"J. Shieh and E. Keogh, i sax: indexing and mining terabyte sized time series, in: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2008, pp. 623\u2013631.","DOI":"10.1145\/1401890.1401966"},{"key":"10.3233\/IDA-194876_ref28","doi-asserted-by":"crossref","unstructured":"C. Ratanamahatana, E. Keogh, A.J. Bagnall and S. Lonardi, A novel bit level time series representation with implication of similarity search and clustering, in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer, 2005, pp. 771\u2013777.","DOI":"10.1007\/11430919_90"},{"key":"10.3233\/IDA-194876_ref29","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos and A. Swami, Efficient similarity search in sequence databases, in: International Conference on Foundations of Data Organization and Algorithms, Springer, 1993, pp. 69\u201384.","DOI":"10.1007\/3-540-57301-1_5"},{"key":"10.3233\/IDA-194876_ref31","doi-asserted-by":"crossref","unstructured":"Z.R. Struzik and A. Siebes, Wavelet transform in similarity paradigm, in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer, 1998, pp. 295\u2013309.","DOI":"10.1007\/3-540-64383-4_25"},{"key":"10.3233\/IDA-194876_ref32","doi-asserted-by":"crossref","unstructured":"Y. Cai and R. Ng, Indexing spatio-temporal trajectories with chebyshev polynomials, in: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, ACM, 2004, pp. 599\u2013610.","DOI":"10.1145\/1007568.1007636"},{"key":"10.3233\/IDA-194876_ref33","doi-asserted-by":"crossref","unstructured":"G.E. Batista, X. Wang and E.J. Keogh, A complexity-invariant distance measure for time series, in: Proceedings of the 2011 SIAM International Conference on Data Mining, SIAM, 2011, pp. 699\u2013710.","DOI":"10.1137\/1.9781611972818.60"},{"issue":"2","key":"10.3233\/IDA-194876_ref34","doi-asserted-by":"crossref","first-page":"1542","DOI":"10.14778\/1454159.1454226","article-title":"Querying and mining of time series data: experimental comparison of representations and distance measures","volume":"1","author":"Ding","year":"2008","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"9","key":"10.3233\/IDA-194876_ref35","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1016\/j.patcog.2010.09.022","article-title":"Weighted dynamic time warping for time series classification","volume":"44","author":"Jeong","year":"2011","journal-title":"Pattern Recognition"},{"key":"10.3233\/IDA-194876_ref36","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.patcog.2017.09.020","article-title":"Shapedtw: shape dynamic time warping","volume":"74","author":"Zhao","year":"2018","journal-title":"Pattern Recognition"},{"key":"10.3233\/IDA-194876_ref37","doi-asserted-by":"crossref","unstructured":"J. Yuan, Q. Lin, W. Zhang and Z. Wang, Locally slope-based dynamic time warping for time series classification, in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019, pp.\u00a01713\u20131722.","DOI":"10.1145\/3357384.3357917"},{"key":"10.3233\/IDA-194876_ref38","doi-asserted-by":"crossref","unstructured":"E.J. Keogh and M.J. Pazzani, Derivative dynamic time warping, in: First SIAM International Conference on Data Mining, 2001.","DOI":"10.1137\/1.9781611972719.1"},{"key":"10.3233\/IDA-194876_ref39","unstructured":"M. Vlachos, D. Gunopoulos and G. Kollios, Discovering similar multidimensional trajectories, in: icde, IEEE, 2002, p.\u00a00673."},{"key":"10.3233\/IDA-194876_ref40","doi-asserted-by":"crossref","unstructured":"L. Chen and R. Ng, On the marriage of lp-norms and edit distance, in: Proceedings of the Thirtieth International Conference on Very Large Data Bases-Volume 30, VLDB Endowment, 2004, pp. 792\u2013803.","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"10.3233\/IDA-194876_ref41","doi-asserted-by":"crossref","unstructured":"L. Chen, M.T. \u00d6zsu and V. Oria, Robust and fast similarity search for moving object trajectories, in: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, ACM, 2005, pp. 491\u2013502.","DOI":"10.1145\/1066157.1066213"},{"key":"10.3233\/IDA-194876_ref42","doi-asserted-by":"crossref","unstructured":"T. Rakthanmanon, B. Campana, A. Mueen, G. Batista, B. Westover, Q. Zhu, J. Zakaria and E. Keogh, Searching and mining trillions of time series subsequences under dynamic time warping, in: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2012, pp. 262\u2013270.","DOI":"10.1145\/2339530.2339576"},{"issue":"1","key":"10.3233\/IDA-194876_ref43","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","article-title":"Product quantization for nearest neighbor search","volume":"33","author":"Jegou","year":"2010","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"10.3233\/IDA-194876_ref45","doi-asserted-by":"crossref","first-page":"561","DOI":"10.3233\/IDA-2007-11508","article-title":"Toward accurate dynamic time warping in linear time and space","volume":"11","author":"Salvador","year":"2007","journal-title":"Intelligent Data Analysis"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-194876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:57Z","timestamp":1777454337000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-194876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,4]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/ida-194876","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,4]]}}}