{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:50:36Z","timestamp":1774986636080,"version":"3.50.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>Dirty data are often observed in the multivariate time series, which not only degrades data quality but also adversely affects various downstream applications. Existing studies typically focus on repairing such errors appearing in either timestamps or attribute values alone, relying on the assumption that the other part is clean. However, in real scenarios, owing to various reasons, both timestamps and attribute values can be erroneous. It is intuitive to repair timestamps and attribute values respectively by calling different methods in turn. However, such a strategy may lead to over-repairing and introduce additional errors, by ignoring the mutual reference between timestamps and attribute values. Therefore, in this study, rather than repairing timestamps and attribute values respectively by calling different methods in turn, we consider the repairing for both attribute values and timestamps simultaneously. Our major contributions include (1) defining the multivariate speed constraints and formalizing the optimal repair problem with the NP-hardness analysis, (2) computing the exact solutions with pruning strategies and correctness ensurance, (3) designing the quadratic time approximation algorithm with the performance guarantee, (4) devising the linear time algorithm and ensuring its approximation performance bound. Empirical results over real-world dirty datasets demonstrate the superiority and practicality of our algorithms, against eleven competing methods, where our algorithm not only achieves the best accuracy but also spends the lowest time cost.<\/jats:p>","DOI":"10.1145\/3725367","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["The Best of Both Worlds: On Repairing Timestamps and Attribute Values for Multivariate Time Series"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1611-7717","authenticated-orcid":false,"given":"Jingyu","family":"Zhu","sequence":"first","affiliation":[{"name":"College of Computer Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0839-6455","authenticated-orcid":false,"given":"Weiwei","family":"Deng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7398-2972","authenticated-orcid":false,"given":"Yu","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9503-2755","authenticated-orcid":false,"given":"Shaoxu","family":"Song","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5852-0426","authenticated-orcid":false,"given":"Haiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5876-6856","authenticated-orcid":false,"given":"Xiaojie","family":"Yuan","sequence":"additional","affiliation":[{"name":"College of Computer Science, Nankai Univeristy, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2002.985697"},{"key":"e_1_2_1_2_1","unstructured":"2024. Gas. https:\/\/archive.ics.uci.edu\/dataset\/322\/gassensorarrayunderdynamicgasmixtures."},{"key":"e_1_2_1_3_1","unstructured":"2024. hum. https:\/\/www.kaggle.com\/datasets\/laurendobratz\/iottown'select=Temp-Hum-Sensor-B.csv."},{"key":"e_1_2_1_4_1","unstructured":"2024. Human. https:\/\/www.kaggle.com\/datasets\/die9origephit\/human-activity-recognition."},{"key":"e_1_2_1_5_1","unstructured":"2024. pems. https:\/\/archive.ics.uci.edu\/dataset\/204\/pemssf."},{"key":"e_1_2_1_6_1","unstructured":"2024. TAVhub. https:\/\/github.com\/erssss\/TAVhub."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321552"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882907"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196--6774(81)90020--1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-022--4884--7"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2022.100568"},{"key":"e_1_2_1_14_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350279"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEIB53692.2021.9686410"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538607"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469088"},{"key":"e_1_2_1_19_1","first-page":"637","article-title":"EXPONENTIAL SMOOTHING: THE STATE OF THE ART","volume":"22","author":"Gardner Everette S.","year":"2006","unstructured":"Everette S. Gardner. 2006. EXPONENTIAL SMOOTHING: THE STATE OF THE ART, PART II. International Journal of Forecasting 22 (2006), 637--666. https:\/\/api.semanticscholar.org\/CorpusID:2749748","journal-title":"PART II. International Journal of Forecasting"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687693"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.promfg.2019.02.114"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654993"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.envsoft.2009.08.010"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"Jeffery Shawn R.","unstructured":"Shawn R. Jeffery, Minos Garofalakis, and Michael J. Franklin. 2006. Adaptive cleaning for RFID data streams. In Proceedings of the 32nd International Conference on Very Large Data Bases (Seoul, Korea) (VLDB '06). VLDB Endowment, 163--174."},{"key":"e_1_2_1_25_1","volume-title":"BoostClean: Automated Error Detection and Repair for Machine Learning. CoRR abs\/1711.01299","author":"Krishnan Sanjay","year":"2017","unstructured":"Sanjay Krishnan, Michael J. Franklin, Ken Goldberg, and Eugene Wu. 2017. BoostClean: Automated Error Detection and Repair for Machine Learning. CoRR abs\/1711.01299 (2017). arXiv:1711.01299 http:\/\/arxiv.org\/abs\/1711.01299"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2010.5453878"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448943"},{"key":"e_1_2_1_28_1","unstructured":"Samuel Madden. 2003. Intel Berkeley Research Lab Data. https:\/\/db.csail.mit.edu\/labdata\/labdata.html. MIT CSAIL."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2013.13"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00024"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Yurii Nesterov and Arkadi Nemirovski. 1994. Interior-point polynomial algorithms in convex programming. In Siam studies in applied mathematics. https:\/\/api.semanticscholar.org\/CorpusID:117194167","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3570690.3570694"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-09001--1"},{"key":"e_1_2_1_34_1","volume-title":"B. Rajanarayan Prusty, and Debashisha Jena.","author":"Ranjan Kumar Gaurav","year":"2020","unstructured":"Kumar Gaurav Ranjan, Debesh Shankar Tripathy, B. Rajanarayan Prusty, and Debashisha Jena. 2020. An improved sliding window prediction-based outlier detection and correction for volatile time-series. International Journal of Numerical Modelling: Electronic Networks 34 (2020). https:\/\/api.semanticscholar.org\/CorpusID:225339439"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Andreas Rogge-Solti R. S. Mans Wil M.P. van der Aalst and Mathias Weske. 2013. Improving Documentation by Repairing Event Logs. In The Practice of Enterprise Modeling. https:\/\/api.semanticscholar.org\/CorpusID:5909285","DOI":"10.1007\/978-3-642-41641-5_10"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460418.3479277"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977798"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465740"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-020-00641--6"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723730"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00068"},{"key":"e_1_2_1_42_1","volume-title":"Exploring the accuracy potential of IMU preintegration in factor graph optimization. arXiv preprint arXiv:2109.03010","author":"Tang Hailiang","year":"2021","unstructured":"Hailiang Tang, Xiaoji Niu, Tisheng Zhang, Jing Fan, and Jingnan Liu. 2021. Exploring the accuracy potential of IMU preintegration in factor graph optimization. arXiv preprint arXiv:2109.03010 (2021)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514067"},{"key":"e_1_2_1_44_1","volume-title":"Priority-based voice segmentation and transmission in quality-driven wireless audio sensor networks. Ad Hoc & Sensor Wireless Networks 29 (01","author":"Turkes Okan","year":"2015","unstructured":"Okan Turkes and Sebnem Baydere. 2015. Priority-based voice segmentation and transmission in quality-driven wireless audio sensor networks. Ad Hoc & Sensor Wireless Networks 29 (01 2015), 311--331."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2962152"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915233"},{"key":"e_1_2_1_47_1","unstructured":"Aoqian Zhang Shaoxu Song Jianmin Wang and Philip S. Yu. 2020. Time Series Data Cleaning: From Anomaly Detection to Anomaly Repairing (Technical Report). arXiv:2003.12396 [cs.DB] https:\/\/arxiv.org\/abs\/2003.12396"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2411.01214"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3102110"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3625687.3625788"},{"key":"e_1_2_1_51_1","first-page":"141","article-title":"A High-Dimensional Timing Data Cleaning Algorithm for Wireless Sensor Networks","volume":"53","author":"Zhou Jingjing","year":"2022","unstructured":"Jingjing Zhou, Xiaokang Yu, Jilin Zhang, Hanxiao Shi, Yu xing Mao, and Junfeng Yuan. 2022. A High-Dimensional Timing Data Cleaning Algorithm for Wireless Sensor Networks. Ad Hoc Sens. Wirel. Networks 53 (2022), 141--164. https:\/\/api.semanticscholar.org\/CorpusID:252623861","journal-title":"Ad Hoc Sens. Wirel. Networks"},{"key":"e_1_2_1_52_1","unstructured":"Tianwen Zhu Yongyi Ran Xin Zhou and YonggangWen. 2024. A Survey of Predictive Maintenance: Systems Purposes and Approaches. arXiv:1912.07383 [eess.SP] https:\/\/arxiv.org\/abs\/1912.07383"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:58:54Z","timestamp":1774983534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725367"],"URL":"https:\/\/doi.org\/10.1145\/3725367","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}