Marc Sebban

dblp:s/MarcSebban · DBLP profile ↗
← Back
29ranked-venue papers in the field
5as first author
3since 2021 · last 2025
0000-0001-6851-169XORCID · verified

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 27 (5 first)Knowledge Engineering, Semantic Web & Information Systems · 1Other / Interdisciplinary · 1
YearPublicationVenuePosition
2025 Provably Accurate Adaptive Sampling for Collocation Points in Physics-Informed Neural Networks
Antoine Caradot, Rémi Emonet, Amaury Habrard, Abdel-Rahim Mezidi, Marc Sebban
ECML/PKDD (5)5
2024 Approximation Error of Sobolev Regular Functions with Tanh Neural Networks: Theoretical Impact on PINNs
Benjamin Girault, Rémi Emonet, Amaury Habrard, Jordan Patracone, Marc Sebban
ECML/PKDD (4)5
2023 Is My Neural Net Driven by the MDL Principle?
Eduardo Brandao, Stefan Duffner, Rémi Emonet, Amaury Habrard, François Jacquenet, Marc Sebban
ECML/PKDD (2)6
2020 Graph Diffusion Wasserstein Distances
Amélie Barbe, Marc Sebban, Paulo Gonçalves 0001, Pierre Borgnat, Rémi Gribonval
ECML/PKDD (2)2
2020 Landmark-Based Ensemble Learning with Random Fourier Features and Gradient Boosting
Léo Gautheron, Pascal Germain, Amaury Habrard, Guillaume Metzler, Emilie Morvant, Marc Sebban, Valentina Zantedeschi
ECML/PKDD (3)6
2018 Online Non-linear Gradient Boosting in Multi-latent Spaces
Jordan Fréry, Amaury Habrard, Marc Sebban, Olivier Caelen, Liyun He-Guelton
IDA3
2018 Tree-Based Cost Sensitive Methods for Fraud Detection in Imbalanced Data
Guillaume Metzler, Xavier Badiche, Brahim Belkasmi, Élisa Fromont, Amaury Habrard, Marc Sebban
IDA6
2018 Fast and Provably Effective Multi-view Classification with Landmark-Based SVM
Valentina Zantedeschi, Rémi Emonet, Marc Sebban
ECML/PKDD (2)3
2017 Efficient Top Rank Optimization with Gradient Boosting for Supervised Anomaly Detection
Jordan Fréry, Amaury Habrard, Marc Sebban, Olivier Caelen, Liyun He-Guelton
ECML/PKDD (1)3
2017 Theoretical Analysis of Domain Adaptation with Optimal Transport
Ievgen Redko, Amaury Habrard, Marc Sebban
ECML/PKDD (2)3
2016 A new boosting algorithm for provably accurate unsupervised domain adaptation
Amaury Habrard, Jean-Philippe Peyrache, Marc Sebban
Knowl. Inf. Syst.3
2015 Joint Semi-supervised Similarity Learning for Linear Classification
Maria-Irina Nicolae, Éric Gaussier, Amaury Habrard, Marc Sebban
ECML/PKDD (1)4
2013 Boosting for Unsupervised Domain Adaptation
Amaury Habrard, Jean-Philippe Peyrache, Marc Sebban
ECML/PKDD (2)3
2011 Learning Good Edit Similarities with Generalization Guarantees
Aurélien Bellet, Amaury Habrard, Marc Sebban
ECML/PKDD (1)3
2010 Weighted Symbols-Based Edit Distance for String-Structured Image Classification
Cécile Barat, Christophe Ducottet, Élisa Fromont, Anne-Claire Legrand, Marc Sebban
ECML/PKDD (1)5
2009 Discovering Patterns in Flows: A Privacy Preserving Approach with the ACSM Prototype
Stéphanie Jacquemont, François Jacquenet, Marc Sebban
ECML/PKDD (2)3
2008 SEDiL: Software for Edit Distance Learning
Laurent Boyer 0002, Yann Esposito, Amaury Habrard, José Oncina, Marc Sebban
ECML/PKDD (2)5
2007 Learning Metrics Between Tree Structured Data: Application to Image Recognition
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
ECML3
2007 Correct your text with Google
abstract
With the increasing amount of text files that are produced nowadays, spell checkers have become essential tools for everyday tasks of millions of end users. Among the years, several tools have been designed that show decent performances. Of course, grammatical checkers may improve corrections of texts, nevertheless, this requires large resources. We think that basic spell checking may be improved (a step towards) using the Web as a corpus and taking into account the context of words that are identified as potential misspellings. We propose to use the Google search engine and some machine learning techniques, in order to design a flexible and dynamic spell checker that may evolve among the time with new linguistic features.
Stéphanie Jacquemont, François Jacquenet, Marc Sebban
Web Intelligence3
2006 Learning Stochastic Tree Edit Distance
Marc Bernard, Amaury Habrard, Marc Sebban
ECML3
2003 Improvement of the State Merging Rule on Noisy Data in Probabilistic Grammatical Inference
Amaury Habrard, Marc Bernard, Marc Sebban
ECML3
2003 On Boosting Improvement: Error Reduction and Convergence Speed-Up
Marc Sebban, Henri-Maxime Suchier
ECML1
2002 Boosting Density Function Estimators
Franck Thollard, Marc Sebban, Philippe Ézéquel
ECML2
2000 Contribution of Dataset Reduction Techniques to Tree-Simplification and Knowledge Discovery
Marc Sebban, Richard Nock
PKDD1
1999 From Theoretical Learnability to Statistical Measures of the Learnable
Marc Sebban, Gilles Richard
IDA1
1999 Experiments on a Representation-Independent "Top-Down and Prune" Induction Scheme
Richard Nock, Marc Sebban, Pascal Jappy
PKDD2
1999 Contribution of Boosting in Wrapper Models
Marc Sebban, Richard Nock
PKDD1
1999 Selection and Statistical Validation of Features and Prototypes
Marc Sebban, Djamel A. Zighed, S. Di Palma
PKDD1
1996 A Comparison of Some Contextual Discretization Methods
Sabine Loudcher, Ricco Rakotomalala, Marc Sebban
Inf. Sci.3