{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T05:07:57Z","timestamp":1735708077815,"version":"3.32.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p>By empowering domain experts to perform interactive exploration of large time series datasets, sketch-based query interfaces have revitalized interest in the well-studied problem of time series similarity search. In this new interaction paradigm, recent similarity algorithms (e.g., Qetch, Peax, LineNet) that attempt to capture perceptually relevant features have supplanted older, more straightforward distance measures (e.g., Euclidean, DTW). However, the downside of these algorithms is the resulting difficulty in designing corresponding index structures to support efficient similarity search over large datasets, thus necessitating brute-force search.<\/jats:p>\n          <jats:p>\n            This demo will showcase\n            <jats:italic>Deep Time Series Similarity Search<\/jats:italic>\n            (DTS3), our pluggable indexing pipeline for arbitrary distance measures. DTS3 can automatically train a foundation model for any custom, user-supplied distance measure with no strict constraints (e.g., differentiability), thus enabling fast retrieval via an off-the-shelf vector DBMS. Using our DeepSketch web interface, participants can compare DTS3 to the baseline brute-force versions of several similarity algorithms to see that our approach can achieve much lower latency without sacrificing accuracy when searching over large, real-world time series datasets.\n          <\/jats:p>","DOI":"10.14778\/3685800.3685877","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T17:25:21Z","timestamp":1731086721000},"page":"4369-4372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["DeepSketch: A Query Sketching Interface for Deep Time Series Similarity Search"],"prefix":"10.14778","volume":"17","author":[{"given":"Zheng","family":"Zhang","sequence":"first","affiliation":[{"name":"Northwestern University"}]},{"given":"Zhuhan","family":"Shao","sequence":"additional","affiliation":[{"name":"Northwestern University"}]},{"given":"Andrew","family":"Crotty","sequence":"additional","affiliation":[{"name":"Northwestern University"}]}],"member":"320","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.14778\/3494124.3494142"},{"doi-asserted-by":"crossref","unstructured":"Michael Correll and Michael Gleicher. 2016. The Semantics of Sketch: Flexibility In Visual Query Systems For Time Series Data. In VAST. 131--140.","key":"e_1_2_1_2_1","DOI":"10.1109\/VAST.2016.7883519"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.14778\/2824032.2824127"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.14778\/1454159.1454226"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1109\/TPAMI.2022.3222104"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.14778\/3282495.3282498"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.14778\/3368289.3368303"},{"doi-asserted-by":"crossref","unstructured":"Philipp Eichmann and Emanuel Zgraggen. 2015. Evaluating Subjective Accuracy in Time Series Pattern-Matching Using Human-Annotated Rankings. In IUI. 28--37.","key":"e_1_2_1_8_1","DOI":"10.1145\/2678025.2701379"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1109\/TVCG.2020.3002950"},{"doi-asserted-by":"crossref","unstructured":"Amir Ilkhechi Andrew Crotty Alex Galakatos Yicong Mao Grace Fan Xiran Shi and Ugur \u00c7etintemel. 2020. DeepSqueeze: Deep Semantic Compression for Tabular Data. In SIGMOD. 1733--1746.","key":"e_1_2_1_10_1","DOI":"10.1145\/3318464.3389734"},{"key":"e_1_2_1_11_1","first-page":"1267","article-title":"You can't always sketch what you want: Understanding Sensemaking in Visual Query Systems","volume":"26","author":"Lin Lee Doris Jung","year":"2020","unstructured":"Doris Jung Lin Lee, John Lee, Tarique Siddiqui, Jaewoo Kim, Karrie Karahalios, and Aditya G. Parameswaran. 2020. You can't always sketch what you want: Understanding Sensemaking in Visual Query Systems. TVCG 26, 1 (2020), 1267--1277.","journal-title":"TVCG"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1111\/cgf.13971"},{"key":"e_1_2_1_13_1","volume-title":"Learned Data-aware Image Representations of Line Charts for Similarity Search. PACMMOD 1, 1","author":"Luo Yuyu","year":"2023","unstructured":"Yuyu Luo, Yihui Zhou, Nan Tang, Guoliang Li, Chengliang Chai, and Leixian Shen. 2023. Learned Data-aware Image Representations of Line Charts for Similarity Search. PACMMOD 1, 1 (2023), 88:1--88:29."},{"doi-asserted-by":"crossref","unstructured":"Miro Mannino and Azza Abouzied. 2018. Expressive Time Series Querying with Hand-Drawn Scale-Free Sketches. In CHI. 388.","key":"e_1_2_1_14_1","DOI":"10.1145\/3173574.3173962"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1145\/3183713.3193547"},{"doi-asserted-by":"crossref","unstructured":"Prithiviraj K. Muthumanickam Katerina Vrotsou Matthew Cooper and Jimmy Johansson. 2016. Shape Grammar Extraction for Efficient Query-by-Sketch Pattern Matching in Long Time Series. In VAST. 121--130.","key":"e_1_2_1_16_1","DOI":"10.1109\/VAST.2016.7883518"},{"key":"e_1_2_1_17_1","volume-title":"S\u00e1rk\u00f6zy","author":"Neamtu Rodica","year":"2017","unstructured":"Rodica Neamtu, Ramoza Ahsan, Charles Lovering, Cuong Nguyen, Elke A. Rundensteiner, and G\u00e1bor N. S\u00e1rk\u00f6zy. 2017. Interactive Time Series Analytics Powered by ONEX. In SIGMOD. 1595--1598."},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.14778\/3021924.3021933"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.14778\/3025111.3025126"},{"key":"e_1_2_1_20_1","volume-title":"Parameswaran","author":"Siddiqui Tarique","year":"2017","unstructured":"Tarique Siddiqui, John Lee, Albert Kim, Edward Xue, Xiaofo Yu, Sean Zou, Lijin Guo, Changfeng Liu, Chaoran Wang, Karrie Karahalios, and Aditya G. Parameswaran. 2017. Fast-Forwarding to Desired Visualizations with Zenvisage. In CIDR."},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.14778\/3229863.3236235"},{"key":"e_1_2_1_22_1","volume-title":"Parameswaran","author":"Siddiqui Tarique","year":"2020","unstructured":"Tarique Siddiqui, Paul Luh, Zesheng Wang, Karrie Karahalios, and Aditya G. Parameswaran. 2020. ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines. In SIGMOD. 51--65."},{"doi-asserted-by":"crossref","unstructured":"Qitong Wang and Themis Palpanas. 2021. Deep Learning Embeddings for Data Series Similarity Search. In KDD. 1708--1716.","key":"e_1_2_1_23_1","DOI":"10.1145\/3447548.3467317"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1109\/TKDE.2023.3270264"},{"doi-asserted-by":"crossref","unstructured":"Martin Wattenberg. 2001. Sketching a Graph to Query a Time-Series Database. In CHI EA. 381--382.","key":"e_1_2_1_25_1","DOI":"10.1145\/634067.634292"},{"doi-asserted-by":"publisher","key":"e_1_2_1_26_1","DOI":"10.14778\/3554821.3554866"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3685800.3685877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:26:31Z","timestamp":1735622791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3685800.3685877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.14778\/3685800.3685877"],"URL":"https:\/\/doi.org\/10.14778\/3685800.3685877","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}