9 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.AI2026
WiCleanData: Guaranteeing the Type Consistency of Wikidata by Taxonomy Refinement and Constraint Enforcement
Yiwen Peng, Marc Jeanmougin, Thomas Bonald
Because of its collaborative nature, Wikidata suffers from errors, in- consistencies, and excessive complexity, such as redundant classes, ambiguity between instances and classes,…
cs.LG2023
A Self-Encoder for Learning Nearest Neighbors
Armand Boschin, Thomas Bonald, Marc Jeanmougin
We present the self-encoder, a neural network trained to guess the identity of each data sample. Despite its simplicity, it learns a very useful representation of data, in a self-s…
cs.FL2012★ 9 cited
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
Antoine Amarilli, Marc Jeanmougin
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though…