Remi Gilleron
Émérite
CNU : SECTION 27 - INFORMATIQUE
Laboratoire / équipe
Contact
remi.gilleron[chez]univ-lille[point].fr
03 20 41 73 00
bureau D.50 (bâtiment D, campus pont de bois (ouest))
Publications
{
"response":{"numFound":51,"start":0,"numFoundExact":true,"docs":[
{
"citationRef_s":"<i>EACL 2023 - 17th Conference of the European Chapter of the Association for Computational Linguistics</i>, May 2023, Dubrovnik, Croatia",
"citationFull_s":"Joseph Renner, Pascal Denis, Rémi Gilleron, Angèle Brunellière. Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks. <i>EACL 2023 - 17th Conference of the European Chapter of the Association for Computational Linguistics</i>, May 2023, Dubrovnik, Croatia. <a target=\"_blank\" href=\"https://inria.hal.science/hal-03986142\">⟨hal-03986142⟩</a>",
"title_s":["Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks"],
"authFullName_s":["Joseph Renner",
"Pascal Denis",
"Rémi Gilleron",
"Angèle Brunellière"],
"halId_s":"hal-03986142",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"<i>Findings of the Association for Computational Linguistics: EMNLP 2023</i>, 2023, Singapore, France",
"citationFull_s":"Joseph Renner, Pascal Denis, Rémi Gilleron. WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment. <i>Findings of the Association for Computational Linguistics: EMNLP 2023</i>, 2023, Singapore, France. <a target=\"_blank\" href=\"https://hal.science/hal-04250849\">⟨hal-04250849⟩</a>",
"title_s":["WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment"],
"authFullName_s":["Joseph Renner",
"Pascal Denis",
"Rémi Gilleron"],
"halId_s":"hal-04250849",
"docType_s":"COMM",
"producedDateY_i":2023},
{
"citationRef_s":"<i>Statistique et Société</i>, 2021, Gilets jaunes et Grand Débat National : outils, données et analyses, 9 (1-2), pp.147-168",
"citationFull_s":"Aurélien Bellet, Pascal Denis, Rémi Gilleron, Mikaela Keller, Nathalie Vauquier. Pour plus de transparence dans l’analyse automatique des consultations ouvertes : leçons de la synthèse du Grand Débat National. <i>Statistique et Société</i>, 2021, Gilets jaunes et Grand Débat National : outils, données et analyses, 9 (1-2), pp.147-168. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02860659v3\">⟨hal-02860659v3⟩</a>",
"title_s":["Pour plus de transparence dans l’analyse automatique des consultations ouvertes : leçons de la synthèse du Grand Débat National",
"For more transparency in the automatic analysis of public consultations: lessons learned from the French \"Grand Débat National"],
"authFullName_s":["Aurélien Bellet",
"Pascal Denis",
"Rémi Gilleron",
"Mikaela Keller",
"Nathalie Vauquier"],
"halId_s":"hal-02860659",
"docType_s":"ART",
"producedDateY_i":2021},
{
"citationRef_s":"<i>A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)</i>, Springer International Publishing, pp.1-50, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-06170-8_1\">⟨10.1007/978-3-030-06170-8_1⟩</a>",
"citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Theoretical Computer Science: Computability, Decidability and Logic. <i>A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)</i>, Springer International Publishing, pp.1-50, 2020, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-030-06170-8_1\">⟨10.1007/978-3-030-06170-8_1⟩</a>. <a target=\"_blank\" href=\"https://hal.science/hal-03173193\">⟨hal-03173193⟩</a>",
"title_s":["Theoretical Computer Science: Computability, Decidability and Logic"],
"authFullName_s":["Olivier Bournez",
"Gilles Dowek",
"Rémi Gilleron",
"Serge Grigorieff",
"Jean-Yves Marion",
"Simon Perdrix",
"S. Tison"],
"halId_s":"hal-03173193",
"docType_s":"COUV",
"producedDateY_i":2020},
{
"citationRef_s":"<i>A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)</i>, Springer International Publishing, 2020",
"citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Theoretical Computer Science: Computational Complexity. <i>A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)</i>, Springer International Publishing, 2020. <a target=\"_blank\" href=\"https://hal.science/hal-02995771\">⟨hal-02995771⟩</a>",
"title_s":["Theoretical Computer Science: Computational Complexity"],
"authFullName_s":["Olivier Bournez",
"Gilles Dowek",
"Rémi Gilleron",
"Serge Grigorieff",
"Jean-Yves Marion",
"Simon Perdrix",
"S. Tison"],
"halId_s":"hal-02995771",
"docType_s":"COUV",
"producedDateY_i":2020},
{
"citationRef_s":"<i>Journal of Machine Learning Research</i>, 2020, 21, pp.1 - 18",
"citationFull_s":"Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Skill Rating for Multiplayer Games Introducing Hypernode Graphs and their Spectral Theory. <i>Journal of Machine Learning Research</i>, 2020, 21, pp.1 - 18. <a target=\"_blank\" href=\"https://inria.hal.science/hal-02566930\">⟨hal-02566930⟩</a>",
"title_s":["Skill Rating for Multiplayer Games Introducing Hypernode Graphs and their Spectral Theory"],
"authFullName_s":["Thomas Ricatte",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-02566930",
"docType_s":"ART",
"producedDateY_i":2020},
{
"citationRef_s":"[Research Report] INRIA Lille. 2015",
"citationFull_s":"Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Learning from Binary Relations between Groups in Networks. [Research Report] INRIA Lille. 2015. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01247103\">⟨hal-01247103⟩</a>",
"title_s":["Hypernode Graphs for Learning from Binary Relations between Groups in Networks"],
"authFullName_s":["Thomas Ricatte",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-01247103",
"docType_s":"REPORT",
"producedDateY_i":2015},
{
"citationRef_s":"<i>Networks: From Graphs to Rich Data, NIPS Workshop.</i>, Dec 2014, Montreal, Canada. <a target=\"_blank\" href=\"http://gdriv.es/networks2014\"></a>, 2014",
"citationFull_s":"Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Learning from Binary Relations between Groups in Networks. <i>Networks: From Graphs to Rich Data, NIPS Workshop.</i>, Dec 2014, Montreal, Canada. <a target=\"_blank\" href=\"http://gdriv.es/networks2014\"></a>, 2014. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01088036\">⟨hal-01088036⟩</a>",
"title_s":["Hypernode Graphs for Learning from Binary Relations between Groups in Networks"],
"authFullName_s":["Thomas Ricatte",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-01088036",
"docType_s":"POSTER",
"producedDateY_i":2014},
{
"citationRef_s":"<i>ECML/PKDD - 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</i>, Sep 2014, Nancy, France",
"citationFull_s":"Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Spectral Learning on Binary Relations over Sets. <i>ECML/PKDD - 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</i>, Sep 2014, Nancy, France. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01017025\">⟨hal-01017025⟩</a>",
"title_s":["Hypernode Graphs for Spectral Learning on Binary Relations over Sets"],
"authFullName_s":["Thomas Ricatte",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-01017025",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"<i>Conférence Francophone sur l'Apprentissage Automatique (Cap 2014)</i>, Jul 2014, Saint-Etienne, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-44851-9_42\">⟨10.1007/978-3-662-44851-9_42⟩</a>",
"citationFull_s":"Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Spectral Learning on Binary Relations over Sets. <i>Conférence Francophone sur l'Apprentissage Automatique (Cap 2014)</i>, Jul 2014, Saint-Etienne, France. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-662-44851-9_42\">⟨10.1007/978-3-662-44851-9_42⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/hal-01104618\">⟨hal-01104618⟩</a>",
"title_s":["Hypernode Graphs for Spectral Learning on Binary Relations over Sets"],
"authFullName_s":["Thomas Ricatte",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-01104618",
"docType_s":"COMM",
"producedDateY_i":2014},
{
"citationRef_s":"[Research Report] 2013",
"citationFull_s":"Thomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi. A Spectral Framework for a Class of Undirected Hypergraphs. [Research Report] 2013. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00914286v2\">⟨hal-00914286v2⟩</a>",
"title_s":["A Spectral Framework for a Class of Undirected Hypergraphs"],
"authFullName_s":["Thomas Ricatte",
"Gemma C. Garriga",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-00914286",
"docType_s":"REPORT",
"producedDateY_i":2013},
{
"citationRef_s":"<i>The 12th International Conference on Machine Learning and Applications (ICMLA'13)</i>, Dec 2013, Miami, United States",
"citationFull_s":"Thomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi. Learning from Multiple Graphs using a Sigmoid Kernel. <i>The 12th International Conference on Machine Learning and Applications (ICMLA'13)</i>, Dec 2013, Miami, United States. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00913237\">⟨hal-00913237⟩</a>",
"title_s":["Learning from Multiple Graphs using a Sigmoid Kernel"],
"authFullName_s":["Thomas Ricatte",
"Gemma C. Garriga",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"hal-00913237",
"docType_s":"COMM",
"producedDateY_i":2013},
{
"citationRef_s":"<i>Journal of Machine Learning Research</i>, 2013, 14 (1), pp.927−964",
"citationFull_s":"Joachim Niehren, Jérôme Champavère, Rémi Gilleron, Aurélien Lemay. Query Induction with Schema-Guided Pruning Strategies. <i>Journal of Machine Learning Research</i>, 2013, 14 (1), pp.927−964. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00607121v2\">⟨inria-00607121v2⟩</a>",
"title_s":["Query Induction with Schema-Guided Pruning Strategies"],
"authFullName_s":["Joachim Niehren",
"Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay"],
"halId_s":"inria-00607121",
"docType_s":"ART",
"producedDateY_i":2013},
{
"citationRef_s":"<i>ECML/PKDD - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - 2012</i>, 2012, Bristol, United Kingdom",
"citationFull_s":"Jean Baptiste Faddoul, Boris Chidlovskii, Rémi Gilleron, Fabien Torre. Learning Multiple Tasks with Boosted Decision Trees. <i>ECML/PKDD - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - 2012</i>, 2012, Bristol, United Kingdom. <a target=\"_blank\" href=\"https://inria.hal.science/hal-00727749\">⟨hal-00727749⟩</a>",
"title_s":["Learning Multiple Tasks with Boosted Decision Trees"],
"authFullName_s":["Jean Baptiste Faddoul",
"Boris Chidlovskii",
"Rémi Gilleron",
"Fabien Torre"],
"halId_s":"hal-00727749",
"docType_s":"COMM",
"producedDateY_i":2012},
{
"citationRef_s":"<i>The Ninth International Conference on Machine Learning and Applications (ICMLA 2010)</i>, Dec 2010, Hayatt Regency Bethesda, Washington DC, United States",
"citationFull_s":"Jean-Baptiste Faddoul, Boris Chidlovskii, Fabien Torre, Rémi Gilleron. Boosting Multi-Task Weak Learners with Applications to Textual and Social Data. <i>The Ninth International Conference on Machine Learning and Applications (ICMLA 2010)</i>, Dec 2010, Hayatt Regency Bethesda, Washington DC, United States. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00524718v2\">⟨inria-00524718v2⟩</a>",
"title_s":["Boosting Multi-Task Weak Learners with Applications to Textual and Social Data"],
"authFullName_s":["Jean-Baptiste Faddoul",
"Boris Chidlovskii",
"Fabien Torre",
"Rémi Gilleron"],
"halId_s":"inria-00524718",
"docType_s":"COMM",
"producedDateY_i":2010},
{
"citationRef_s":"[Research Report] RR-7200, INRIA. 2010, pp.23",
"citationFull_s":"Édouard Gilbert, Rémi Gilleron, Marc Tommasi. Series, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees.. [Research Report] RR-7200, INRIA. 2010, pp.23. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00455955v2\">⟨inria-00455955v2⟩</a>",
"title_s":["Series, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees."],
"authFullName_s":["Édouard Gilbert",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"inria-00455955",
"docType_s":"REPORT",
"producedDateY_i":2010},
{
"citationRef_s":"Pierre Marquis, Odile Papini and Henri Prade. <i>IA Handbook</i>, Cépaduès, pp.1-63, 2010",
"citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. Pierre Marquis, Odile Papini and Henri Prade. <i>IA Handbook</i>, Cépaduès, pp.1-63, 2010. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00549416\">⟨inria-00549416⟩</a>",
"title_s":["Décidabilité et Complexité"],
"authFullName_s":["Olivier Bournez",
"Gilles Dowek",
"Rémi Gilleron",
"Serge Grigorieff",
"Jean-Yves Marion",
"Simon Perdrix",
"Sophie Tison"],
"halId_s":"inria-00549416",
"docType_s":"COUV",
"producedDateY_i":2010},
{
"citationRef_s":"<i>IA Handbook</i>, Cépaduès, pp.1-63, 2010",
"citationFull_s":"Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. <i>IA Handbook</i>, Cépaduès, pp.1-63, 2010. <a target=\"_blank\" href=\"https://hal.science/hal-00999661\">⟨hal-00999661⟩</a>",
"title_s":["Décidabilité et Complexité"],
"authFullName_s":["Olivier Bournez",
"Gilles Dowek",
"Rémi Gilleron",
"Serge Grigorieff",
"Jean-Yves Marion",
"Simon Perdrix",
"Sophie Tison"],
"halId_s":"hal-00999661",
"docType_s":"COUV",
"producedDateY_i":2010},
{
"citationRef_s":"<i>Information and Computation</i>, 2009, 207 (11), pp.1181-1208. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2009.03.003\">⟨10.1016/j.ic.2009.03.003⟩</a>",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas. <i>Information and Computation</i>, 2009, 207 (11), pp.1181-1208. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.ic.2009.03.003\">⟨10.1016/j.ic.2009.03.003⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00366082v3\">⟨inria-00366082v3⟩</a>",
"title_s":["Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00366082",
"docType_s":"ART",
"producedDateY_i":2009},
{
"citationRef_s":"<i>EDBT 2009</i>, 2009, Saint Petersburg, Russia",
"citationFull_s":"Kong Lingbo, Rémi Gilleron, Aurélien Lemay. Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword Search. <i>EDBT 2009</i>, 2009, Saint Petersburg, Russia. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00433097\">⟨inria-00433097⟩</a>",
"title_s":["Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword Search"],
"authFullName_s":["Kong Lingbo",
"Rémi Gilleron",
"Aurélien Lemay"],
"halId_s":"inria-00433097",
"docType_s":"COMM",
"producedDateY_i":2009},
{
"citationRef_s":"<i>International Workshop on Web information and data managment</i>, Oct 2008, Napa, United States. pp.9-16",
"citationFull_s":"Marc Tommasi, Rémi Gilleron, Pierre Senellart, Avin Mittal, Daniel Muschick. Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge. <i>International Workshop on Web information and data managment</i>, Oct 2008, Napa, United States. pp.9-16. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00337098\">⟨inria-00337098⟩</a>",
"title_s":["Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge"],
"authFullName_s":["Marc Tommasi",
"Rémi Gilleron",
"Pierre Senellart",
"Avin Mittal",
"Daniel Muschick"],
"halId_s":"inria-00337098",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>9th International Colloquium on Grammatical Inference</i>, Sep 2008, Saint-Malo, France. pp.15-28, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-88009-7_2\">⟨10.1007/978-3-540-88009-7_2⟩</a>",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Schema-Guided Induction of Monadic Queries. <i>9th International Colloquium on Grammatical Inference</i>, Sep 2008, Saint-Malo, France. pp.15-28, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-540-88009-7_2\">⟨10.1007/978-3-540-88009-7_2⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00309408v2\">⟨inria-00309408v2⟩</a>",
"title_s":["Schema-Guided Induction of Monadic Queries"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00309408",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"<i>2nd International Conference on Language and Automata Theory and Applications</i>, Mar 2008, Tarragona, Spain. pp.184-195",
"citationFull_s":"Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. <i>2nd International Conference on Language and Automata Theory and Applications</i>, Mar 2008, Tarragona, Spain. pp.184-195. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00192329v6\">⟨inria-00192329v6⟩</a>",
"title_s":["Efficient Inclusion Checking for Deterministic Tree Automata and DTDs"],
"authFullName_s":["Jérôme Champavère",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00192329",
"docType_s":"COMM",
"producedDateY_i":2008},
{
"citationRef_s":"[Research Report] RR-6738, INRIA. 2008",
"citationFull_s":"Rémi Gilleron, Florent Jousse, Marc Tommasi, Isabelle Tellier. Conditional Random Fields for XML Applications. [Research Report] RR-6738, INRIA. 2008. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00342279\">⟨inria-00342279⟩</a>",
"title_s":["Conditional Random Fields for XML Applications"],
"authFullName_s":["Rémi Gilleron",
"Florent Jousse",
"Marc Tommasi",
"Isabelle Tellier"],
"halId_s":"inria-00342279",
"docType_s":"REPORT",
"producedDateY_i":2008},
{
"citationRef_s":"<i>NIPS Workshop on Representations and Inference on Probability Distributions</i>, Dec 2007, Whistler, Canada",
"citationFull_s":"François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert. On Probability Distributions for Trees: Representations, Inference and Learning. <i>NIPS Workshop on Representations and Inference on Probability Distributions</i>, Dec 2007, Whistler, Canada. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00294636\">⟨inria-00294636⟩</a>",
"title_s":["On Probability Distributions for Trees: Representations, Inference and Learning"],
"authFullName_s":["François Denis",
"Amaury Habrard",
"Rémi Gilleron",
"Marc Tommasi",
"Édouard Gilbert"],
"halId_s":"inria-00294636",
"docType_s":"COMM",
"producedDateY_i":2007},
{
"citationRef_s":"<i>Machine Learning</i>, 2007, Machine Learning, 66 (1), pp.33-67. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s10994-006-9613-8\">⟨10.1007/s10994-006-9613-8⟩</a>",
"citationFull_s":"Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Interactive Learning of Node Selecting Tree Transducers. <i>Machine Learning</i>, 2007, Machine Learning, 66 (1), pp.33-67. <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/s10994-006-9613-8\">⟨10.1007/s10994-006-9613-8⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00087226v5\">⟨inria-00087226v5⟩</a>",
"title_s":["Interactive Learning of Node Selecting Tree Transducers"],
"authFullName_s":["Julien Carme",
"Rémi Gilleron",
"Aurélien Lemay",
"Joachim Niehren"],
"halId_s":"inria-00087226",
"docType_s":"ART",
"producedDateY_i":2007},
{
"citationRef_s":"<i>Web Intelligence</i>, Dec 2006, Hong Kong, China",
"citationFull_s":"Rémi Gilleron, Patrick Marty, Fabien Torre, Marc Tommasi. Interactive Tuples Extraction from Semi-Structured Data. <i>Web Intelligence</i>, Dec 2006, Hong Kong, China. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00581253\">⟨inria-00581253⟩</a>",
"title_s":["Interactive Tuples Extraction from Semi-Structured Data"],
"authFullName_s":["Rémi Gilleron",
"Patrick Marty",
"Fabien Torre",
"Marc Tommasi"],
"halId_s":"inria-00581253",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>INEX 2006</i>, Dec 2006, Dagstuhl, Germany",
"citationFull_s":"Rémi Gilleron, Florent Jousse, Isabelle Tellier, Marc Tommasi. XML Document Transformation with Conditional Random Fields. <i>INEX 2006</i>, Dec 2006, Dagstuhl, Germany. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00147052\">⟨inria-00147052⟩</a>",
"title_s":["XML Document Transformation with Conditional Random Fields"],
"authFullName_s":["Rémi Gilleron",
"Florent Jousse",
"Isabelle Tellier",
"Marc Tommasi"],
"halId_s":"inria-00147052",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>8th International Colloquium on Grammatical Inference</i>, Sep 2006, Tokyo, Japan. pp.253-267",
"citationFull_s":"Aurélien Lemay, Joachim Niehren, Rémi Gilleron. Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples. <i>8th International Colloquium on Grammatical Inference</i>, Sep 2006, Tokyo, Japan. pp.253-267. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00088077v2\">⟨inria-00088077v2⟩</a>",
"title_s":["Learning n-ary Node Selecting Tree Transducers from Completely Annotated Examples"],
"authFullName_s":["Aurélien Lemay",
"Joachim Niehren",
"Rémi Gilleron"],
"halId_s":"inria-00088077",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>Workshop on Mining and Learning in Graphs</i>, Sep 2006, Berlin, Germany",
"citationFull_s":"Florent Jousse, Rémi Gilleron, Isabelle Tellier, Marc Tommasi. Conditional Random Fields for XML Trees. <i>Workshop on Mining and Learning in Graphs</i>, Sep 2006, Berlin, Germany. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00118761\">⟨inria-00118761⟩</a>",
"title_s":["Conditional Random Fields for XML Trees"],
"authFullName_s":["Florent Jousse",
"Rémi Gilleron",
"Isabelle Tellier",
"Marc Tommasi"],
"halId_s":"inria-00118761",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>CAp 2006</i>, May 2006, Trégastel, France",
"citationFull_s":"Florent Jousse, Rémi Gilleron, Isabelle Tellier, Marc Tommasi. Champs Conditionnels Aléatoires pour l'Annotation d'Arbres. <i>CAp 2006</i>, May 2006, Trégastel, France. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00117014\">⟨inria-00117014⟩</a>",
"title_s":["Champs Conditionnels Aléatoires pour l'Annotation d'Arbres"],
"authFullName_s":["Florent Jousse",
"Rémi Gilleron",
"Isabelle Tellier",
"Marc Tommasi"],
"halId_s":"inria-00117014",
"docType_s":"COMM",
"producedDateY_i":2006},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 2005, 348 (1), pp.70-83. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2005.09.007\">⟨10.1016/j.tcs.2005.09.007⟩</a>",
"citationFull_s":"François Denis, Rémi Gilleron, Fabien Letouzey. Learning from Positive and Unlabeled Examples. <i>Theoretical Computer Science</i>, 2005, 348 (1), pp.70-83. <a target=\"_blank\" href=\"https://dx.doi.org/10.1016/j.tcs.2005.09.007\">⟨10.1016/j.tcs.2005.09.007⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536692\">⟨inria-00536692⟩</a>",
"title_s":["Learning from Positive and Unlabeled Examples"],
"authFullName_s":["François Denis",
"Rémi Gilleron",
"Fabien Letouzey"],
"halId_s":"inria-00536692",
"docType_s":"ART",
"producedDateY_i":2005},
{
"citationRef_s":"<i>7th International Conference on Developments in Language Theory</i>, Jul 2003, Szeged, Hungary, Hungary. pp.171 -- 182",
"citationFull_s":"Julien Carme, Rémi Gilleron, Marc Tommasi, Alain Terlutte, Aurélien Lemay. Residual Finite Tree Automata. <i>7th International Conference on Developments in Language Theory</i>, Jul 2003, Szeged, Hungary, Hungary. pp.171 -- 182. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00091272v2\">⟨inria-00091272v2⟩</a>",
"title_s":["Residual Finite Tree Automata"],
"authFullName_s":["Julien Carme",
"Rémi Gilleron",
"Marc Tommasi",
"Alain Terlutte",
"Aurélien Lemay"],
"halId_s":"inria-00091272",
"docType_s":"COMM",
"producedDateY_i":2003},
{
"citationRef_s":"<i>International Conference on Machine Learning and Data Mining</i>, 2003, Leipzig, Georgia. pp.35-49",
"citationFull_s":"Françesco de Comite, Rémi Gilleron, Marc Tommasi. Learning Multi-label Alternating Decision Trees from Texts and Data. <i>International Conference on Machine Learning and Data Mining</i>, 2003, Leipzig, Georgia. pp.35-49. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00536733\">⟨inria-00536733⟩</a>",
"title_s":["Learning Multi-label Alternating Decision Trees from Texts and Data"],
"authFullName_s":["Françesco de Comite",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"inria-00536733",
"docType_s":"COMM",
"producedDateY_i":2003},
{
"citationRef_s":"<i>Proceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'02</i>, 2002, Grenoble, France. pp.1927--1934",
"citationFull_s":"François Denis, Rémi Gilleron, Marc Tommasi. Text Classification from Positive and Unlabeled Examples. <i>Proceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'02</i>, 2002, Grenoble, France. pp.1927--1934. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538889\">⟨inria-00538889⟩</a>",
"title_s":["Text Classification from Positive and Unlabeled Examples"],
"authFullName_s":["François Denis",
"Rémi Gilleron",
"Marc Tommasi"],
"halId_s":"inria-00538889",
"docType_s":"COMM",
"producedDateY_i":2002},
{
"citationRef_s":"<i>RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)</i>, 2001, 35 (2), pp.129--148",
"citationFull_s":"François Denis, Rémi Gilleron. PAC Learning under Helpful Distributions. <i>RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)</i>, 2001, 35 (2), pp.129--148. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538888\">⟨inria-00538888⟩</a>",
"title_s":["PAC Learning under Helpful Distributions"],
"authFullName_s":["François Denis",
"Rémi Gilleron"],
"halId_s":"inria-00538888",
"docType_s":"ART",
"producedDateY_i":2001},
{
"citationRef_s":"<i>Proceedings of the 11th International Conference on Algorithmic Learning Theory, ALT'00</i>, 2000, Sydney, Australia. pp.71--85",
"citationFull_s":"Fabien Letouzey, François Denis, Rémi Gilleron. Learning From Positive and Unlabeled examples. <i>Proceedings of the 11th International Conference on Algorithmic Learning Theory, ALT'00</i>, 2000, Sydney, Australia. pp.71--85. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538887\">⟨inria-00538887⟩</a>",
"title_s":["Learning From Positive and Unlabeled examples"],
"authFullName_s":["Fabien Letouzey",
"François Denis",
"Rémi Gilleron"],
"halId_s":"inria-00538887",
"docType_s":"COMM",
"producedDateY_i":2000},
{
"citationRef_s":"<i>Proceedings of the Tenth International Conference on Algorithmic Learning Theory, ALT'99</i>, 1999, Tokyo, Japan. pp.219--230",
"citationFull_s":"Françesco de Comité, François Denis, Rémi Gilleron, Fabien Letouzey. Positive and Unlabeled Examples Help Learning. <i>Proceedings of the Tenth International Conference on Algorithmic Learning Theory, ALT'99</i>, 1999, Tokyo, Japan. pp.219--230. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538885\">⟨inria-00538885⟩</a>",
"title_s":["Positive and Unlabeled Examples Help Learning"],
"authFullName_s":["Françesco de Comité",
"François Denis",
"Rémi Gilleron",
"Fabien Letouzey"],
"halId_s":"inria-00538885",
"docType_s":"COMM",
"producedDateY_i":1999},
{
"citationRef_s":"<i>Information and Computation</i>, 1999, 149 (1), pp.1--41",
"citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Set constraints and automata. <i>Information and Computation</i>, 1999, 149 (1), pp.1--41. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538886\">⟨inria-00538886⟩</a>",
"title_s":["Set constraints and automata"],
"authFullName_s":["Rémi Gilleron",
"Sophie Tison",
"Marc Tommasi"],
"halId_s":"inria-00538886",
"docType_s":"ART",
"producedDateY_i":1999},
{
"citationRef_s":"<i>Proceedings of the 8th International Conference on Algorithmic Learning Theory, ALT'97)</i>, 1997, Sendai, Japan. pp.132--145",
"citationFull_s":"François Denis, Rémi Gilleron. PAC learning under helpful distributions. <i>Proceedings of the 8th International Conference on Algorithmic Learning Theory, ALT'97)</i>, 1997, Sendai, Japan. pp.132--145. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538884\">⟨inria-00538884⟩</a>",
"title_s":["PAC learning under helpful distributions"],
"authFullName_s":["François Denis",
"Rémi Gilleron"],
"halId_s":"inria-00538884",
"docType_s":"COMM",
"producedDateY_i":1997},
{
"citationRef_s":"<i>13th Annual Symposium on Theoretical Aspects of Computer Science, STACS'96</i>, 1996, Munich, France. pp.231--242",
"citationFull_s":"François Denis, Cyrille Dhalluin, Rémi Gilleron. PAC Learning with Simple Examples. <i>13th Annual Symposium on Theoretical Aspects of Computer Science, STACS'96</i>, 1996, Munich, France. pp.231--242. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538883\">⟨inria-00538883⟩</a>",
"title_s":["PAC Learning with Simple Examples"],
"authFullName_s":["François Denis",
"Cyrille Dhalluin",
"Rémi Gilleron"],
"halId_s":"inria-00538883",
"docType_s":"COMM",
"producedDateY_i":1996},
{
"citationRef_s":"<i>Fundamenta Informaticae</i>, 1995, 24 (1/2), pp.157--176",
"citationFull_s":"Rémi Gilleron, Sophie Tison. Regular Tree Languages and Rewrite Systems. <i>Fundamenta Informaticae</i>, 1995, 24 (1/2), pp.157--176. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538882\">⟨inria-00538882⟩</a>",
"title_s":["Regular Tree Languages and Rewrite Systems"],
"authFullName_s":["Rémi Gilleron",
"Sophie Tison"],
"halId_s":"inria-00538882",
"docType_s":"ART",
"producedDateY_i":1995},
{
"citationRef_s":"<i>Proceedings of First International Conference on Constraints in Computational Logics, CCL'94</i>, 1994, Munich, Germany. pp.336--351",
"citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Some new Decidability Results on Positive and Negative Set Constraints. <i>Proceedings of First International Conference on Constraints in Computational Logics, CCL'94</i>, 1994, Munich, Germany. pp.336--351. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538880\">⟨inria-00538880⟩</a>",
"title_s":["Some new Decidability Results on Positive and Negative Set Constraints"],
"authFullName_s":["Rémi Gilleron",
"Sophie Tison",
"Marc Tommasi"],
"halId_s":"inria-00538880",
"docType_s":"COMM",
"producedDateY_i":1994},
{
"citationRef_s":"<i>Theoretical Computer Science</i>, 1994, 127 (1), pp.69--98",
"citationFull_s":"Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sandor Vágvölgyi. Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. <i>Theoretical Computer Science</i>, 1994, 127 (1), pp.69--98. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538881\">⟨inria-00538881⟩</a>",
"title_s":["Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems"],
"authFullName_s":["Jean-Luc Coquidé",
"Max Dauchet",
"Rémi Gilleron",
"Sandor Vágvölgyi"],
"halId_s":"inria-00538881",
"docType_s":"ART",
"producedDateY_i":1994},
{
"citationRef_s":"<i>Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93</i>, 1993, Würzburg, Germany. pp.505--514",
"citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints using Tree Automata. <i>Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93</i>, 1993, Würzburg, Germany. pp.505--514. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538878\">⟨inria-00538878⟩</a>",
"title_s":["Solving Systems of Set Constraints using Tree Automata"],
"authFullName_s":["Rémi Gilleron",
"Sophie Tison",
"Marc Tommasi"],
"halId_s":"inria-00538878",
"docType_s":"COMM",
"producedDateY_i":1993},
{
"citationRef_s":"<i>Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93</i>, 1993, Palo Alto California, United States. pp.372--380",
"citationFull_s":"Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. <i>Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93</i>, 1993, Palo Alto California, United States. pp.372--380. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538879\">⟨inria-00538879⟩</a>",
"title_s":["Solving Systems of Set Constraints with Negated Subset Relationships"],
"authFullName_s":["Rémi Gilleron",
"Sophie Tison",
"Marc Tommasi"],
"halId_s":"inria-00538879",
"docType_s":"COMM",
"producedDateY_i":1993},
{
"citationRef_s":"<i>Bulletin- European Association for Theoretical Computer Science</i>, 1992, 48, pp.197--209",
"citationFull_s":"Sandor Vágvölgyi, Rémi Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable.. <i>Bulletin- European Association for Theoretical Computer Science</i>, 1992, 48, pp.197--209. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538877\">⟨inria-00538877⟩</a>",
"title_s":["For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable."],
"authFullName_s":["Sandor Vágvölgyi",
"Rémi Gilleron"],
"halId_s":"inria-00538877",
"docType_s":"ART",
"producedDateY_i":1992},
{
"citationRef_s":"<i>Proceedings of the 4th International Conference on Rewriting Techniques and Applications, RTA'91</i>, 1991, Como, Italy. pp.287-298",
"citationFull_s":"Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sandor Vágvölgyi. Bottom-Up Tree Pushdown Automata and Rewrite Systems. <i>Proceedings of the 4th International Conference on Rewriting Techniques and Applications, RTA'91</i>, 1991, Como, Italy. pp.287-298. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538876\">⟨inria-00538876⟩</a>",
"title_s":["Bottom-Up Tree Pushdown Automata and Rewrite Systems"],
"authFullName_s":["Jean-Luc Coquidé",
"Max Dauchet",
"Rémi Gilleron",
"Sandor Vágvölgyi"],
"halId_s":"inria-00538876",
"docType_s":"COMM",
"producedDateY_i":1991},
{
"citationRef_s":"<i>Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, STACS 91</i>, 1991, Munich, Germany. pp.148--159",
"citationFull_s":"Rémi Gilleron. Decision Problems for Term Rewrite Systems and Recognizable Tree Languages. <i>Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, STACS 91</i>, 1991, Munich, Germany. pp.148--159. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538875\">⟨inria-00538875⟩</a>",
"title_s":["Decision Problems for Term Rewrite Systems and Recognizable Tree Languages"],
"authFullName_s":["Rémi Gilleron"],
"halId_s":"inria-00538875",
"docType_s":"COMM",
"producedDateY_i":1991},
{
"citationRef_s":"<i>Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, IMYCS'90</i>, 1990, Prag, Czech Republic. pp.120-129",
"citationFull_s":"Jean-Luc Coquidé, Rémi Gilleron. Proofs and reachability problem for ground rewrite systems. <i>Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, IMYCS'90</i>, 1990, Prag, Czech Republic. pp.120-129. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538874\">⟨inria-00538874⟩</a>",
"title_s":["Proofs and reachability problem for ground rewrite systems"],
"authFullName_s":["Jean-Luc Coquidé",
"Rémi Gilleron"],
"halId_s":"inria-00538874",
"docType_s":"COMM",
"producedDateY_i":1990},
{
"citationRef_s":"<i>Proceedings of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT, Vol.1</i>, 1989, Barcelona, Spain. pp.227-243",
"citationFull_s":"Aline Deruyver, Rémi Gilleron. The Reachability Problem for Ground TRS and Some Extensions. <i>Proceedings of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT, Vol.1</i>, 1989, Barcelona, Spain. pp.227-243. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00538873\">⟨inria-00538873⟩</a>",
"title_s":["The Reachability Problem for Ground TRS and Some Extensions"],
"authFullName_s":["Aline Deruyver",
"Rémi Gilleron"],
"halId_s":"inria-00538873",
"docType_s":"COMM",
"producedDateY_i":1989}]
}}