Louis Carpentier

dblp:327/9273 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-3679-8873ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 InTimeAD: Interactive Time Series Anomaly Detection
abstract
Time series anomaly detection has received substantial attention over the past two decades, leading to the development of hundreds of algorithms. However, comprehensively understanding this vast landscape remains challenging, particularly for non-experts and novices. In this demonstration paper, we present InTimeAD, an interactive web application that provides access to more than 30 state-of-the-art time series anomaly detection algorithms. InTimeAD is intended to explore the performance of existing as well as custom anomaly detection models in an interactive, hands-on manner. By lowering the entry bar, we support practitioners overwhelmed by the large number of existing techniques, while providing a platform for researchers to rapidly analyze their novel anomaly detection algorithms.
Louis Carpentier, Wannes Meert, Mathias Verbeke
AAAI1
2026 SubTSMD: discovering subspace motifs with temporal variations in multivariate time series
Louis Carpentier, Laurens Devos, Wannes Meert, Mathias Verbeke
Data Min. Knowl. Discov.1
2024 Towards Contextual, Cost-Efficient Predictive Maintenance in Heavy-Duty Trucks
Louis Carpentier, Arne De Temmerman, Mathias Verbeke
IDA (2)1
2024 Pattern-based Time Series Semantic Segmentation with Gradual State Transitions
abstract
Time series semantic segmentation is the task of extracting time intervals from the time series data that share a similar meaning within the application domain in an unsupervised manner. State-of-the-art algorithms typically treat this problem as change point detection, resulting in discrete state transitions. However, in real-world applications, states often transition gradually. This leads to a novel, more challenging variation of the traditional time series segmentation task, for which we present PaTSS, a novel, domain-agnostic algorithm to uncover those gradual state transitions. PaTSS learns a distribution over the semantic segments based on an embedding space derived from mined sequential patterns. An extensive experimental evaluation on 107 benchmark time series shows that PaTSS is capable of detecting gradual state transitions, a task current methods are unable to perform.
Louis Carpentier, Len Feremans, Wannes Meert, Mathias Verbeke
SDM1