An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract)

Huanyu Zhao; Chaoyi Pang; Ramamohanarao Rao Kotagiri; Christopher K. Pang; Ke Deng; Jian Yang; Tongliang Li

doi:10.1109/ICDE55515.2023.00321

An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract)

Huanyu Zhao, Chaoyi Pang, Ramamohanarao Rao Kotagiri, Christopher K. Pang, Ke Deng, Jian Yang, Tongliang Li

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference abstract › peer-review

Abstract

Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of "semi-connection"that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution and achieves better performances than the state-of-art solutions.

Original language	English
Title of host publication	2023 IEEE 39th International Conference on Data Engineering ICDE 2023
Subtitle of host publication	proceedings
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	3789-3790
Number of pages	2
ISBN (Electronic)	9798350322279
ISBN (Print)	9798350322286
DOIs	https://doi.org/10.1109/ICDE55515.2023.00321
Publication status	Published - 2023
Event	39th IEEE International Conference on Data Engineering, ICDE 2023 - Anaheim, United States Duration: 3 Apr 2023 → 7 Apr 2023

Publication series

Name
ISSN (Print)	1063-6382
ISSN (Electronic)	2375-026X

Conference

Conference	39th IEEE International Conference on Data Engineering, ICDE 2023
Country/Territory	United States
City	Anaheim
Period	3/04/23 → 7/04/23

Access to Document

10.1109/ICDE55515.2023.00321

Cite this

Zhao, H., Pang, C., Kotagiri, R. R., Pang, C. K., Deng, K., Yang, J., & Li, T. (2023). An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract). In 2023 IEEE 39th International Conference on Data Engineering ICDE 2023: proceedings (pp. 3789-3790). Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ICDE55515.2023.00321

@inbook{d15838ee64ac452aa5b9f68434d8c975,

title = "An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract)",

abstract = "Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of {"}semi-connection{"}that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution and achieves better performances than the state-of-art solutions.",

author = "Huanyu Zhao and Chaoyi Pang and Kotagiri, {Ramamohanarao Rao} and Pang, {Christopher K.} and Ke Deng and Jian Yang and Tongliang Li",

year = "2023",

doi = "10.1109/ICDE55515.2023.00321",

language = "English",

isbn = "9798350322286",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

pages = "3789--3790",

booktitle = "2023 IEEE 39th International Conference on Data Engineering ICDE 2023",

address = "United States",

note = "39th IEEE International Conference on Data Engineering, ICDE 2023 ; Conference date: 03-04-2023 Through 07-04-2023",

}

Zhao, H, Pang, C, Kotagiri, RR, Pang, CK, Deng, K, Yang, J & Li, T 2023, An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract). in 2023 IEEE 39th International Conference on Data Engineering ICDE 2023: proceedings. Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 3789-3790, 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, United States, 3/04/23. https://doi.org/10.1109/ICDE55515.2023.00321

An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract). / Zhao, Huanyu; Pang, Chaoyi; Kotagiri, Ramamohanarao Rao et al.
2023 IEEE 39th International Conference on Data Engineering ICDE 2023: proceedings. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2023. p. 3789-3790.

Research output: Chapter in Book/Report/Conference proceeding › Conference abstract › peer-review

TY - CHAP

T1 - An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract)

AU - Zhao, Huanyu

AU - Pang, Chaoyi

AU - Kotagiri, Ramamohanarao Rao

AU - Pang, Christopher K.

AU - Deng, Ke

AU - Yang, Jian

AU - Li, Tongliang

PY - 2023

Y1 - 2023

N2 - Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of "semi-connection"that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution and achieves better performances than the state-of-art solutions.

AB - Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of "semi-connection"that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution and achieves better performances than the state-of-art solutions.

UR - http://www.scopus.com/inward/record.url?scp=85167664332&partnerID=8YFLogxK

U2 - 10.1109/ICDE55515.2023.00321

DO - 10.1109/ICDE55515.2023.00321

M3 - Conference abstract

AN - SCOPUS:85167664332

SN - 9798350322286

SP - 3789

EP - 3790

BT - 2023 IEEE 39th International Conference on Data Engineering ICDE 2023

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 39th IEEE International Conference on Data Engineering, ICDE 2023

Y2 - 3 April 2023 through 7 April 2023

ER -

An optimal online semi-connected PLA algorithm with maximum error bound (extended abstract)

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this