Relaxed selection techniques for querying time-series graphs

ABSTRACT

Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patterns, either exact or approximate. However, tools that support time-series graphs typically separate query specification from the actual search process, allowing users to adapt the level of similarity only after specifying the pattern. We introduce relaxed selection techniques, in which users implicitly define a level of similarity that can vary across the search pattern, while creating a search query with a single-gesture interaction. Users sketch over part of the graph, establishing the level of similarity through either spatial deviations from the graph, or the speed at which they sketch (temporal deviations). In a user study, participants were significantly faster when using our temporally relaxed selection technique than when using traditional techniques. In addition, they achieved significantly higher precision and recall with our spatially relaxed selection technique compared to traditional techniques.

REFERENCES

• 1: Buono, P., Aris, A., Plaisant, C., Khella, A., and Shneiderman, B. (2005). Interactive pattern search in time series. Proc. VDA'05, 175--186.
• 2: Buono, P., Simeone, A.L. (2008). Interactive shape specification for pattern search in time series. Proc. AVI'08, 480--481.
• 3: Chortaras, A. (2002). Efficient storage, retrieval and indexing of time series data. Master's thesis, Imperial College of Science, Technology and Medicine, University of London.
• 4: Hochheiser, H., Baehrecke, E., Mount, S., and Shneiderman, B. (2003). Dynamic querying for pattern identification in microarray and genomic data. Proc. ICME'03, 453--456.
• 5: Hochheiser, H. and Shneiderman, B. (2001). Interactive exploration of time series data. Discovery Science, 441--446.
• 6: Hochheiser, H. and Shneiderman, B. (2004). Dynamic query tools for time series data sets: Timebox widgets for interactive exploration. Information Visualization, 3(1):1--18.
• 7: Keogh, E., Chakrabarti, K., Pazzani, M., and Mehrotra, S. (2001). Locally adaptive dimensionality reduction for indexing large time series databases. SIGMOD Rec., 30(2):151--162.
• 8: Keogh, E., Hochheiser, H., and Shneiderman, B. (2002). An augmented visual query mechanism for finding patterns in time series data. Proc. FQAS '02, 240--250.
• 9: Keogh, E. and Pazzani, M. (1999). Relevance feedback retrieval of time series data. Proc. SIGIR'99, 183--190.
• 10: Kincaid, R. and Lam, H. (2006). Line graph explorer: Scalable display of line graphs using focus+context. Proc. AVI'06, 404--411.
• 11: Lin, J., Keogh, E., Lonardi, S., and Chiu, B. (2003). A symbolic representation of time series, with implications for streaming algorithms. Proc. DMKD'03, 2--11.
• 12: Lin, J., Keogh, E., Lonardi, S., Lankford, J., and Nystrom, D. (2004a). Visually mining and monitoring massive time series. Proc. KDD'04, 460--469.
• 13: Lin, J., Keogh, E., Lonardi, S., Lankford, J., and Nystrom, D. (2004b). Viztree: A tool for visually mining and monitoring massive time series databases. Proc. VLDB '04, 1269--1272.
• 14: Lin, J., Keogh, E., Lonardi, S., and Patel, P. (2002). Finding motifs in time series. ACM SIGKDD Workshop on Temporal Data Mining, 53--68.
• 15: Morrill, J. (1998). Distributed recognition of patterns in time series data. Communic. ACM, 41(5):45--51.
• 16: Pan, W. (2002). A comparative review of statistical methods for discovering differentially expressed genes in replicated microarray experiments. Bioinformatics, 18(4):546--554.
• 17: Perng, C.-S., Wang, H., Zhang, S., and Parker, D. (2000). Landmarks: A new model for similarity-based pattern querying in time series databases. Proc. Data Eng. '00, 0:33.
• 18: Ryall, K., Lesh, N., Lanning, T., Leigh, D., Miyashita, H., and Makino, S. (2005). Querylines: Approximate query for visual browsing. Proc. CHI '05, 1765--1768.
• 19: Shatkay, H. and Zdonik, S. (1996). Approximate queries and representations for large data sequences. Proc. ICDE'96, 536--545.
• 20: Silva, S. and Catarci, T. (2000). Visualization of linear time-oriented data: A survey. Proc. WISE'00, 310.
• 21: Wattenberg, M. (2001). Sketching a graph to query a time-series database. Proc. CHI'01, 381--382.
• 22: Yi, B.-K., Jagadish, H., and Faloutsos, C. (1998). Efficient retrieval of similar time sequences under time warping. Proc. ICDE'98, 201--208.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Query formulation

Additional Classification:
  H. Information Systems
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.2 User Interfaces (D.2.2, H.1.2, I.3.6)
          Subjects: Graphical user interfaces (GUI)

General Terms:
Design, Human Factors

Keywords:
similarity queries, time-series data