skip to main content
10.1145/3340531.3417414acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

Visualet: Visualizing Shapelets for Time Series Classification

Authors Info & Claims
Published:19 October 2020Publication History

ABSTRACT

Time series classification (TSC) has attracted considerable attention from both academia and industry. TSC methods that are based on shapelets (intuitively, small highly-discriminative subsequences have been found effective and are particularly known for their interpretability, as shapelets themselves are subsequences. A recent work has significantly improved the efficiency of shapelet discovery. For instance, the shapelets of more than 65% of the datasets in the UCR Archive (containing data from different application domains) can be computed within an hour, whereas those of 12 datasets can be computed within a minute. Such efficiency has made it possible for demo attendees to interact with shapelet discovery and explore high-quality shapelets. In this demo, we present Visualet -- a tool for visualizing shapelets, and exploring effective and interpretable ones.

Skip Supplemental Material Section

Supplemental Material

3340531.3417414.mp4

mp4

12.5 MB

References

  1. Anthony Bagnall, Luke Davis, Jon Hills, and Jason Lines. 2012. Transformation Based Ensembles for Time Series Classification. (2012), 307--318. https://doi.org/10.1137/1.9781611972825.27Google ScholarGoogle Scholar
  2. Anthony Bagnall, Jason Lines, Aaron Bostrom, James Large, and Eamonn Keogh. 2017. The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Mining and Knowledge Discovery, Vol. 31, 3 (2017), 606--660.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Zicheng Fang, Peng Wang, and Wei Wang. 2018. Efficient Learning Interpretable Shapelets for Accurate Time Series Classification. In ICDE. 497--508.Google ScholarGoogle Scholar
  4. Josif Grabocka, Nicolas Schilling, Martin Wistuba, and Lars Schmidt-Thieme. 2014. Learning time-series shapelets. In SIGKDD. 392--401.Google ScholarGoogle Scholar
  5. Eamonn Keogh, Kaushik Chakrabarti, Michael Pazzani, and Sharad Mehrotra. 2001. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and information Systems, Vol. 3, 3 (2001), 263--286.Google ScholarGoogle Scholar
  6. Guozhong Li, Byron Choi, Jianliang Xu, Sourav S Bhowmick, Kwok Pan Chun, and Grace Wong. 2020. Efficient Shapelet Discovery for Time Series Classification. TKDE (2020). https://doi.org/10.1109/TKDE.2020.2995870Google ScholarGoogle Scholar
  7. Jessica Lin, Eamonn Keogh, Stefano Lonardi, and Bill Chiu. 2003. A symbolic representation of time series, with implications for streaming algorithms. In SIGMOD workshop. 2--11.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Thanawin Rakthanmanon and Eamonn Keogh. 2013. Fast shapelets: A scalable algorithm for discovering time series shapelets. In SIAM. 668--676.Google ScholarGoogle Scholar
  9. Lexiang Ye and Eamonn Keogh. 2009. Time series shapelets: a new primitive for data mining. In SIGKDD. 947--956.Google ScholarGoogle Scholar

Index Terms

  1. Visualet: Visualizing Shapelets for Time Series Classification

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
      October 2020
      3619 pages
      ISBN:9781450368599
      DOI:10.1145/3340531

      Copyright © 2020 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 19 October 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader