Publications

Sketch-based fast and accurate querying of time series using parameter-sharing LSTM networks

C. Fan, K. Matkovic, and H. Hauser

Abstract

"Sketching is one common approach to query time series data for patterns of interest. Most existing solutions for matching the data with the interaction are based on an empirically modeled similarity function between the user's sketch and the time series data with limited efficiency and accuracy. In this paper, we introduce a machine learning based solution for fast and accurate querying of time series data based on a swift sketching interaction. We build on existing LSTM technology (long short-term memory) to encode both the sketch and the time series data in a network with shared parameters. We use data from a user study to let the network learn a proper similarity function. We focus our approach on perceived similarities and achieve that the learned model also includes a user-side aspect. To the best of our knowledge, this is the first data-driven solution for querying time series data in visual analytics. Besides evaluating the accuracy and efficiency directly in a quantitative way, we also compare our solution to the recently published Qetch algorithm as well as the commonly used dynamic time warping (DTW) algorithm.."

C. Fan, K. Matkovic, and H. Hauser, "Sketch-based fast and accurate querying of time series using parameter-sharing LSTM networks," IEEE Transactions on Visualization and Computer Graphics, pp. 1-12, 2020. doi:10.1109/TVCG.2020.3002950
[BibTeX]

"Sketching is one common approach to query time series data for patterns of interest. Most existing solutions for matching the data with the interaction are based on an empirically modeled similarity function between the user's sketch and the time series data with limited efficiency and accuracy. In this paper, we introduce a machine learning based solution for fast and accurate querying of time series data based on a swift sketching interaction. We build on existing LSTM technology (long short-term memory) to encode both the sketch and the time series data in a network with shared parameters. We use data from a user study to let the network learn a proper similarity function. We focus our approach on perceived similarities and achieve that the learned model also includes a user-side aspect. To the best of our knowledge, this is the first data-driven solution for querying time series data in visual analytics. Besides evaluating the accuracy and efficiency directly in a quantitative way, we also compare our solution to the recently published Qetch algorithm as well as the commonly used dynamic time warping (DTW) algorithm.."
@article{sketchingQuery,
author={Fan, Chaoran and Matkovic, Kresimir and Hauser, Helwig},
journal={IEEE Transactions on Visualization and Computer Graphics},
title={Sketch-based fast and accurate querying of time series using parameter-sharing LSTM networks},
year={2020},
volume={},
number={},
pages={1-12},
doi={10.1109/TVCG.2020.3002950},
abstract = {"Sketching is one common approach to query time series data for patterns of interest. Most existing solutions for matching the data with the interaction are based on an empirically modeled similarity function between the user's sketch and the time series data with limited efficiency and accuracy. In this paper, we introduce a machine learning based solution for fast and accurate querying of time series data based on a swift sketching interaction. We build on existing LSTM technology (long short-term memory) to encode both the sketch and the time series data in a network with shared parameters. We use data from a user study to let the network learn a proper similarity function. We focus our approach on perceived similarities and achieve that the learned model also includes a user-side aspect. To the best of our knowledge, this is the first data-driven solution for querying time series data in visual analytics. Besides evaluating the accuracy and efficiency directly in a quantitative way, we also compare our solution to the recently published Qetch algorithm as well as the commonly used dynamic time warping (DTW) algorithm.."},
pdf = "pdfs/Fan-2020-sketchingQuery.pdf",
images = "images/Fan-2020-sketchingQuery.png",
thumbnails = "images/Fan-2020-sketchingQuery.png",
}
projectidprojectid

Media

Downloads

Full paper [PDF]