Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range
Jun-Gi Jang, Dongjin Choi, Jinhong Jung, U Kang

TL;DR
Zoom-SVD is a novel method that efficiently extracts latent patterns from multiple time series data within any specified time range, significantly reducing computation time and memory usage compared to existing SVD techniques.
Contribution
It introduces a fast, memory-efficient incremental SVD approach that enables pattern detection in arbitrary time ranges, addressing limitations of existing static and incremental SVD methods.
Findings
Zoom-SVD is up to 15x faster than existing methods.
It requires 15x less space for storage.
Effective in capturing similar patterns across different time ranges.
Abstract
Given multiple time series data, how can we efficiently find latent patterns in an arbitrary time range? Singular value decomposition (SVD) is a crucial tool to discover hidden factors in multiple time series data, and has been used in many data mining applications including dimensionality reduction, principal component analysis, recommender systems, etc. Along with its static version, incremental SVD has been used to deal with multiple semi infinite time series data and to identify patterns of the data. However, existing SVD methods for the multiple time series data analysis do not provide functionality for detecting patterns of data in an arbitrary time range: standard SVD requires data for all intervals corresponding to a time range query, and incremental SVD does not consider an arbitrary time range. In this paper, we propose Zoom-SVD, a fast and memory efficient method for finding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
