Advanced search
2 files | 1.22 MB Add to list

MinMaxLTTB : leveraging MinMax-preselection to scale LTTB

Author
Organization
Project
Abstract
Visualization plays an important role in the analysis and exploration of time series data. To facilitate efficient visualization of large datasets, downsampling has emerged as a well-established approach. This work concentrates on LTTB (Largest-Triangle-Three-Buckets), a widely adopted downsampling algorithm for time series data point selection. Specifically, we introduce MinMaxLTTB, a two-step algorithm that significantly improves the scalability of LTTB. MinMaxLTTB consists of the following two steps: (i) the MinMax algorithm preselects a certain ratio of minimum and maximum data points, followed by (ii) applying the LTTB algorithm on only these preselected data points, effectively reducing LTTB’s time complexity. The MinMax algorithm is computationally efficient and can be parallelized, enabling efficient data point preselection. Additionally, MinMax demonstrates competitive performance in terms of visual representation, making it also an effective data reduction method. Experimental results demonstrate that MinMaxLTTB outperforms LTTB by more than an order of magnitude in terms of computation time. Furthermore, preselecting a small multiple of the desired output size already yields similar visual representativeness compared to LTTB. In summary, MinMaxLTTB leverages the computational efficiency of MinMax to scale LTTB, without compromising on LTTB its favorable visualization properties. The code and experiments associated with this paper can be found at https://github.com/predict-idlab/MinMaxLTTB.
Keywords
Evaluation, PerceptionPreselection, Computational efficiency, LTTB, MinMax, Downsampling algorithms, Line charts, Time series

Downloads

  • Ds716 acc.pdf
    • full text (Accepted manuscript)
    • |
    • open access
    • |
    • PDF
    • |
    • 431.26 KB
  • (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 786.60 KB

Citation

Please use this url to cite or link to this publication:

MLA
Van Der Donckt, Jeroen, et al. “MinMaxLTTB : Leveraging MinMax-Preselection to Scale LTTB.” 2023 IEEE Visualization and Visual Analytics (VIS), IEEE, 2023, pp. 21–25, doi:10.1109/vis54172.2023.00013.
APA
Van Der Donckt, J., Van Der Donckt, J., Rademaker, M., & Van Hoecke, S. (2023). MinMaxLTTB : leveraging MinMax-preselection to scale LTTB. 2023 IEEE Visualization and Visual Analytics (VIS), 21–25. https://doi.org/10.1109/vis54172.2023.00013
Chicago author-date
Van Der Donckt, Jeroen, Jonas Van Der Donckt, Michaël Rademaker, and Sofie Van Hoecke. 2023. “MinMaxLTTB : Leveraging MinMax-Preselection to Scale LTTB.” In 2023 IEEE Visualization and Visual Analytics (VIS), 21–25. IEEE. https://doi.org/10.1109/vis54172.2023.00013.
Chicago author-date (all authors)
Van Der Donckt, Jeroen, Jonas Van Der Donckt, Michaël Rademaker, and Sofie Van Hoecke. 2023. “MinMaxLTTB : Leveraging MinMax-Preselection to Scale LTTB.” In 2023 IEEE Visualization and Visual Analytics (VIS), 21–25. IEEE. doi:10.1109/vis54172.2023.00013.
Vancouver
1.
Van Der Donckt J, Van Der Donckt J, Rademaker M, Van Hoecke S. MinMaxLTTB : leveraging MinMax-preselection to scale LTTB. In: 2023 IEEE Visualization and Visual Analytics (VIS). IEEE; 2023. p. 21–5.
IEEE
[1]
J. Van Der Donckt, J. Van Der Donckt, M. Rademaker, and S. Van Hoecke, “MinMaxLTTB : leveraging MinMax-preselection to scale LTTB,” in 2023 IEEE Visualization and Visual Analytics (VIS), Melbourne, Australia, 2023, pp. 21–25.
@inproceedings{01HMTX2Y65WBNMYFQTF94XX2Q0,
  abstract     = {{Visualization plays an important role in the analysis and exploration of time series data. To facilitate efficient visualization of large datasets, downsampling has emerged as a well-established approach. This work concentrates on LTTB (Largest-Triangle-Three-Buckets), a widely adopted downsampling algorithm for time series data point selection. Specifically, we introduce MinMaxLTTB, a two-step algorithm that significantly improves the scalability of LTTB. MinMaxLTTB consists of the following two steps: (i) the MinMax algorithm preselects a certain ratio of minimum and maximum data points, followed by (ii) applying the LTTB algorithm on only these preselected data points, effectively reducing LTTB’s time complexity. The MinMax algorithm is computationally efficient and can be parallelized, enabling efficient data point preselection. Additionally, MinMax demonstrates competitive performance in terms of visual representation, making it also an effective data reduction method. Experimental results demonstrate that MinMaxLTTB outperforms LTTB by more than an order of magnitude in terms of computation time. Furthermore, preselecting a small multiple of the desired output size already yields similar visual representativeness compared to LTTB. In summary, MinMaxLTTB leverages the computational efficiency of MinMax to scale LTTB, without compromising on LTTB its favorable visualization properties. The code and experiments associated with this paper can be found at https://github.com/predict-idlab/MinMaxLTTB.}},
  author       = {{Van Der Donckt, Jeroen and Van Der Donckt, Jonas and Rademaker, Michaël and Van Hoecke, Sofie}},
  booktitle    = {{2023 IEEE Visualization and Visual Analytics (VIS)}},
  isbn         = {{9798350325577}},
  issn         = {{2771-9537}},
  keywords     = {{Evaluation,PerceptionPreselection,Computational efficiency,LTTB,MinMax,Downsampling algorithms,Line charts,Time series}},
  language     = {{eng}},
  location     = {{Melbourne, Australia}},
  pages        = {{21--25}},
  publisher    = {{IEEE}},
  title        = {{MinMaxLTTB : leveraging MinMax-preselection to scale LTTB}},
  url          = {{http://doi.org/10.1109/vis54172.2023.00013}},
  year         = {{2023}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: