1 code implementation • 24 Aug 2023 • François Painblanc, Laetitia Chapel, Nicolas Courty, Chloé Friguet, Charlotte Pelletier, Romain Tavenard
While large volumes of unlabeled data are usually available, associated labels are often scarce.
1 code implementation • 10 Feb 2020 • Titouan Vayer, Romain Tavenard, Laetitia Chapel, Nicolas Courty, Rémi Flamary, Yann Soullard
Multivariate time series are ubiquitous objects in signal processing.
no code implementations • 27 Aug 2019 • Marc Rußwurm, Romain Tavenard, Sébastien Lefèvre, Marco Körner
In this work, we introduce a recently developed early classification mechanism to satellite-based agricultural monitoring.
no code implementations • 3 Jun 2019 • Yichang Wang, Rémi Emonet, Elisa Fromont, Simon Malinowski, Etienne Menager, Loïc Mosser, Romain Tavenard
Times series classification can be successfully tackled by jointly learning a shapelet-based representation of the series in the dataset and classifying the series according to this representation.
1 code implementation • NeurIPS 2019 • Titouan Vayer, Rémi Flamary, Romain Tavenard, Laetitia Chapel, Nicolas Courty
Recently used in various machine learning contexts, the Gromov-Wasserstein distance (GW) allows for comparing distributions whose supports do not necessarily lie in the same metric space.
2 code implementations • 30 Jan 2019 • Marc Rußwurm, Nicolas Courty, Rémi Emonet, Sébastien Lefèvre, Devis Tuia, Romain Tavenard
In this work, we present an End-to-End Learned Early Classification of Time Series (ELECTS) model that estimates a classification score and a probability of whether sufficient data has been observed to come to an early and still accurate decision.
1 code implementation • 7 Nov 2018 • Titouan Vayer, Laetita Chapel, Rémi Flamary, Romain Tavenard, Nicolas Courty
Optimal transport theory has recently found many applications in machine learning thanks to its capacity for comparing various machine learning objects considered as distributions.
no code implementations • 18 Sep 2018 • James Large, Anthony Bagnall, Simon Malinowski, Romain Tavenard
We find that whilst ensembling is a key component for both algorithms, the effect of the other components is mixed and more complex.
2 code implementations • 23 May 2018 • Titouan Vayer, Laetitia Chapel, Rémi Flamary, Romain Tavenard, Nicolas Courty
This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space.
Ranked #4 on
Graph Classification
on NCI1
no code implementations • 8 Jan 2016 • Adeline Bailly, Simon Malinowski, Romain Tavenard, Thomas Guyet, Laetitia Chapel
In this paper, we design a time series classification scheme that builds on the SIFT framework adapted to time series to feed a Bag-of-Words.