{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:28:43Z","timestamp":1781018923189,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior \u2013 Brasil (CAPES)","award":["88887.228628\/2025-00"],"award-info":[{"award-number":["88887.228628\/2025-00"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2023\/11775-5"],"award-info":[{"award-number":["2023\/11775-5"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2023\/02680-0"],"award-info":[{"award-number":["2023\/02680-0"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2022\/03176-1"],"award-info":[{"award-number":["2022\/03176-1"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2023\/11745-9"],"award-info":[{"award-number":["2023\/11745-9"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2023\/05041-9"],"award-info":[{"award-number":["2023\/05041-9"]}]},{"name":"French Agence Nationale de la Recherche (ANR)","award":["ANR-25-CE23-2879"],"award-info":[{"award-number":["ANR-25-CE23-2879"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3780002","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"1065-1072","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Deformable Convolutions Improve Time Series Classification by Capturing Sparsed Patterns"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8793-6528","authenticated-orcid":false,"given":"Jos\u00e9 Gilberto","family":"Barbosa de Medeiros J\u00fanior","sequence":"first","affiliation":[{"name":"Universidade de S\u00e3o Paulo, S\u00e3o Carlos, S\u00e3o Paulo, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2197-3460","authenticated-orcid":false,"given":"Andr\u00e9","family":"Guarnier de Mitri","sequence":"additional","affiliation":[{"name":"Universidade de S\u00e3o Paulo, S\u00e3o Carlos, S\u00e3o Paulo, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1458-3855","authenticated-orcid":false,"given":"Maxime","family":"Devanne","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Haute-Alsace, Mulhouse, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4960-7554","authenticated-orcid":false,"given":"Germain","family":"Forestier","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Haute-Alsace, Mulhouse, France"},{"name":"Monash University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5184-9413","authenticated-orcid":false,"given":"Diego","family":"Furtado Silva","sequence":"additional","affiliation":[{"name":"Universidade de S\u00e3o Paulo, S\u00e3o Carlos, S\u00e3o Paulo, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Should we really use post-hoc tests based on mean-ranks","volume":"17","author":"Benavoli Alessio","year":"2016","unstructured":"Alessio Benavoli, Giorgio Corani, and Francesca Mangili. 2016. Should we really use post-hoc tests based on mean-ranks? Journal of Machine Learning Research, 17, 5, 1\u201310. http:\/\/jmlr.org\/papers\/v17\/benavoli16a.html.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.89"},{"key":"e_1_3_2_1_3_1","unstructured":"Hoang Anh Dau et al. 2018. The ucr time series classification archive. (2018)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00701-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00619-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"},{"key":"e_1_3_2_1_8_1","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","volume":"6","author":"Holm Sture","year":"1979","unstructured":"Sture Holm. 1979. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6, 2, 65\u201370. Retrieved Sept. 5, 2023 from http:\/\/www.jstor.org\/stable\/4615733.","journal-title":"Scandinavian Journal of Statistics"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358132"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00710-y"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA60987.2023.10302569"},{"key":"e_1_3_2_1_12_1","unstructured":"Ali Ismail-Fawaz et al. 2023. An approach to multiple comparison benchmark evaluations that is stable under manipulation of the comparate set. arXiv preprint arXiv:2305.11921."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3649448"},{"key":"e_1_3_2_1_14_1","article-title":"Mctan: a novel multichannel temporal attention-based network for industrial health indicator prediction","author":"Ren Lei","year":"2022","unstructured":"Lei Ren, Yuxin Liu, Di Huang, Keke Huang, and Chunhua Yang. 2022. Mctan: a novel multichannel temporal attention-based network for industrial health indicator prediction. IEEE Transactions on Neural Networks and Learning Systems.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.1990.144191"},{"key":"e_1_3_2_1_16_1","volume-title":"Icentia11k: an unsupervised representation learning dataset for arrhythmia subtype discovery. (2019). arXiv","author":"Tan Shawn","year":"1910","unstructured":"Shawn Tan, Guillaume Androz, Ahmad Chamseddine, Pierre Fecteau, Aaron Courville, Yoshua Bengio, and Joseph Paul Cohen. 2019. Icentia11k: an unsupervised representation learning dataset for arrhythmia subtype discovery. (2019). arXiv: 1910.09570 [q-bio.QM]."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Patrick Wagner Nils Strodthoff Ralf-Dieter Bousseljot Wojciech Samek and Tobias Schaeffter. 2022. Ptb-xl a large publicy available electrocardiography dataset. (2022). 10.13026\/kfzx-aw45","DOI":"10.13026\/kfzx-aw45"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 14408\u201314419","author":"Wenhai","unstructured":"Wenhai Wang et al. 2023. Internimage: exploring large-scale vision foundation models with deformable convolutions. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, 14408\u201314419."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.110118"},{"key":"e_1_3_2_1_20_1","volume-title":"Time series classification from scratch with deep neural networks: a strong baseline. In 2017 International joint conference on neural networks (IJCNN)","author":"Wang Zhiguang","unstructured":"Zhiguang Wang, Weizhong Yan, and Tim Oates. 2017. Time series classification from scratch with deep neural networks: a strong baseline. In 2017 International joint conference on neural networks (IJCNN). IEEE, 1578\u20131585."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2022.3158427"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.09.130"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00953"}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3780002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:48:25Z","timestamp":1781016505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3780002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":24,"alternative-id":["10.1145\/3748522.3780002","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3780002","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}