( en | de | ru )

 

Disambiguation of "Anh, Duong Tuan"

Author of the publication

copydeleteadd this publication to your clipboard
A new discord definition and an efficient time series discord detection method using GPUs.

, , and . ICSED, page 63-70. ACM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Duong Ngoc Tuan

Tuan-Anh Tran

Pham Anh Tuan

Trân-Anh Tuân

Anh-Tuan Pham

 

Other publications of authors with the same name

Instance reduction for time series classification using MDL principle., and . Intell. Data Anal., 21 (3): 491-514 (2017)A Fast Method for Motif Discovery in Large Time Series Database under Dynamic Time Warping., and . KSE, volume 326 of Advances in Intelligent Systems and Computing, page 155-167. Springer, (2014)Using motif information to improve anytime time series classification., and . SoCPaR, page 1-6. IEEE, (2013)A hybrid method for forecasting trend and seasonal time series., , and . RIVF, page 203-208. IEEE, (2013)An Improvement of PAA for Dimensionality Reduction in Large Time Series Databases., and . PRICAI, volume 5351 of Lecture Notes in Computer Science, page 698-707. Springer, (2008)An efficient method for motif and anomaly detection in time series based on clustering., and . Int. J. Bus. Intell. Data Min., 10 (4): 356-377 (2015)An efficient implementation of anytime k-medoids clustering for time series under dynamic time warping., and . SoICT, page 22-29. ACM, (2016)Extracting rules from neural networks for time series prediction., and . SoICT, page 218-225. ACM, (2014)An Efficient Method for Discovering Motifs in Streaming Time Series Data., and . KSE (1), volume 244 of Advances in Intelligent Systems and Computing, page 225-236. Springer, (2013)Efficient search for top-k discords in streaming time series., and . Int. J. Bus. Intell. Data Min., 16 (4): 397-417 (2020)