{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T06:27:58Z","timestamp":1743316078142},"reference-count":22,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:p>The widespread use of sensors has resulted in an unprecedented amount of time series data. Time series mining has experienced a particular surge of interest, among which, subsequence matching is one of the most primary problem that serves as a foundation for many time series data mining techniques, such as anomaly detection and classification. In literature there exist many works to study this problem. However, in many real applications, it is uneasy for users to accurately and clearly elaborate the query intuition with a single query sequence. Consequently, in this paper, we address this issue by allowing users to submit a small query set, instead of a single query. The multiple queries can embody the query intuition better. In particular, we first propose a novel probability-based representation of the query set. A common segmentation is generated which can approximate the queries well, in which each segment is described by some features. For each feature, the corresponding values of multiple queries are represented as a Gaussian distribution. Then, based on the representation, we design a novel distance function to measure the similarity of one subsequence to the multiple queries. Also, we propose a breadth-first search strategy to find out similar subsequences. We have conducted extensive experiments on both synthetic and real datasets, and the results verify the superiority of our approach.<\/jats:p>","DOI":"10.15388\/23-infor519","type":"journal-article","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T06:58:05Z","timestamp":1687935485000},"page":"557-576","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Querying: A Subsequence Matching Approach to Support Multiple Queries"],"prefix":"10.15388","author":[{"given":"Wen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingrui","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6097","published-online":{"date-parts":[[2023,6,28]]},"reference":[{"issue":"2","key":"2023092512373448934_j_infor519_ref_001","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1145\/3514221.3526183","article-title":"A review on distance based time series classification","volume":"33","year":"2019","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"12","key":"2023092512373448934_j_infor519_ref_002","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.14778\/3407790.3407792","article-title":"Series2graph: Graph-based subsequence anomaly detection for time series","volume":"13","year":"2020","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2023092512373448934_j_infor519_ref_003","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1109\/ICDE48307.2020.00182","volume-title":"2020 IEEE 36th International Conference on Data Engineering (ICDE)","year":"2020"},{"key":"2023092512373448934_j_infor519_ref_004","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1145\/3514221.3526183","volume-title":"Proceedings of the 2022 International Conference on Management of Data, SIGMOD \u201922","year":"2022"},{"key":"2023092512373448934_j_infor519_ref_005","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/ICDE.2007.367924","volume-title":"Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007","year":"2007"},{"issue":"6","key":"2023092512373448934_j_infor519_ref_006","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/JAS.2019.1911747","article-title":"The UCR time series archive","volume":"6","year":"2019","journal-title":"IEEE\/CAA Journal of Automatica Sinica"},{"issue":"2","key":"2023092512373448934_j_infor519_ref_007","doi-asserted-by":"publisher","first-page":"109","DOI":"10.14778\/2732228.2732230","article-title":"Diversity based relevance feedback for time series search","volume":"7","year":"2013","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"7","key":"2023092512373448934_j_infor519_ref_008","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1175\/JAMC-D-18-0040.1","article-title":"Wind gust characterization at wind turbine relevant heights in moderately complex terrain","volume":"57","year":"2018","journal-title":"Journal of Applied Meteorology and Climatology"},{"key":"2023092512373448934_j_infor519_ref_009","doi-asserted-by":"publisher","first-page":"107024","DOI":"10.1016\/j.patcog.2019.107024","article-title":"Time series classification using local distance-based features in multi-modal fusion networks","volume":"97","year":"2020","journal-title":"Pattern Recognition"},{"issue":"3","key":"2023092512373448934_j_infor519_ref_010","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011669","article-title":"Dimensionality reduction for fast similarity search in large time series databases","volume":"3","year":"2001","journal-title":"Knowledge and Information Systems"},{"issue":"6","key":"2023092512373448934_j_infor519_ref_011","doi-asserted-by":"publisher","first-page":"677","DOI":"10.14778\/3184470.3184472","article-title":"Coconut: a scalable bottom-up approach for building data series indexes","volume":"11","year":"2018","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2023092512373448934_j_infor519_ref_012","doi-asserted-by":"publisher","first-page":"514","DOI":"10.5441\/002\/edbt.2017.58","volume-title":"Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017","year":"2017"},{"issue":"13","key":"2023092512373448934_j_infor519_ref_013","doi-asserted-by":"publisher","first-page":"2236","DOI":"10.14778\/3275366.3284968","article-title":"Scalable, variable-length similarity search in data series: the ULISSE approach","volume":"11","year":"2018","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2023092512373448934_j_infor519_ref_014","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/VAST.2016.7883518","volume-title":"11th IEEE Conference on Visual Analytics Science and Technology, IEEE VAST 2016","year":"2016"},{"issue":"3","key":"2023092512373448934_j_infor519_ref_015","first-page":"17","article-title":"Embedding-based subsequence matching in time-series databases","volume":"36","year":"2011","journal-title":"ACM Transactions on Database Systems"},{"key":"2023092512373448934_j_infor519_ref_016","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/2339530.2339576","volume-title":"The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201912","year":"2012"},{"key":"2023092512373448934_j_infor519_ref_017","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/1401890.1401966","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201908","year":"2008"},{"issue":"6","key":"2023092512373448934_j_infor519_ref_018","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5334\/dsj-2018-006","article-title":"Shapelet classification algorithm based on efficient subsequence matching","volume":"17","year":"2018","journal-title":"Data Science Journal"},{"issue":"3","key":"2023092512373448934_j_infor519_ref_019","doi-asserted-by":"publisher","first-page":"480","DOI":"10.14778\/3570690.3570698","article-title":"IEDeaL: a deep learning framework for detecting highly imbalanced interictal epileptiform discharges","volume":"16","year":"2022","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2023092512373448934_j_infor519_ref_020","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/3035918.3064051","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017","year":"2017"},{"key":"2023092512373448934_j_infor519_ref_021","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/ICDE.2019.00082","volume-title":"35th IEEE International Conference on Data Engineering, ICDE 2019","year":"2019"},{"issue":"6","key":"2023092512373448934_j_infor519_ref_022","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00778-016-0442-5","article-title":"ADS: the adaptive data series index","volume":"25","year":"2016","journal-title":"VLDB Endowment"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1299\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1299\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:44:02Z","timestamp":1695649442000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/23-INFOR519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":22,"alternative-id":["10.15388\/23-INFOR519"],"URL":"https:\/\/doi.org\/10.15388\/23-infor519","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}