Renjie Wu

Orcid: 0000-0001-9326-7772

Affiliations:
  • University of California, Riverside, CA, USA


According to our database1, Renjie Wu authored at least 12 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
C<sup>22</sup>MP: the marriage of catch22 and the matrix profile creates a fast, efficient and interpretable anomaly detector.
Knowl. Inf. Syst., August, 2024

Problems with Problems in Data Mining
PhD thesis, 2024

2023
Current Time Series Anomaly Detection Benchmarks are Flawed and are Creating the Illusion of Progress.
IEEE Trans. Knowl. Data Eng., March, 2023

When is Early Classification of Time Series Meaningful?
IEEE Trans. Knowl. Data Eng., March, 2023

DAMP: accurate time series anomaly detection on trillions of datapoints and ultra-fast arriving data streams.
Data Min. Knowl. Discov., March, 2023

Matrix Profile XXIX: C<sup>22</sup>MP, Fusing catch 22 and the Matrix Profile to Produce an Efficient and Interpretable Anomaly Detector.
Proceedings of the IEEE International Conference on Data Mining, 2023

2022
FastDTW is Approximate and Generally Slower Than the Algorithm it Approximates.
IEEE Trans. Knowl. Data Eng., 2022

Matrix Profile XXIV: Scaling Time Series Anomaly Detection to Trillions of Datapoints and Ultra-fast Arriving Data Streams.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Current Time Series Anomaly Detection Benchmarks are Flawed and are Creating the Illusion of Progress (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

When is Early Classification of Time Series Meaningful? (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Matrix Profile XXVII: A Novel Distance Measure for Comparing Long Time Series.
Proceedings of the IEEE International Conference on Knowledge Graph, 2022

2021
FastDTW is approximate and Generally Slower than the Algorithm it Approximates (Extended Abstract).
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021


  Loading...