Publications

For links to PDFs and up to date list see my publications in HAL.

International Journals

  • M. Dauchet, S. Tison, and M. Tommasi. Recognizable tree languages and non-linear morphisms. Theoretical Computer Science, 281:219–234, 2002. Selected papers in honour of Maurice Nivat.
  • R. Gilleron, S. Tison, and M. Tommasi. Set constraints and automata. Information and Computation, 149:1 – 41,1999.
  • F. Seynhaeve, S. Tison, M. Tommasi, and R. Treinen. Grid structures and undecidable constraint theories. Theoretical Computer Science, 258:453–490, 2001.

Book Chapters

  • Isabelle Tellier and Marc Tommasi. Champs Markoviens Conditionnels pour l’extraction d’information. In Eric Gaussier and Francois Yvon, editors, Modèles probabilistes pour l’accès à l’information textuelle, pages 223–267. Hermès, 2011.

International conferences

  • Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Spectral Learning on Binary Relations over Sets. In proceedings of ECML/PKDD 2014
  • David Chatel, Pascal Denis, Marc Tommasi. Fast Gaussian Pairwise Constrained Spectral Clustering. In proceedings of ECML/PKDD 2014.
  • Antonino Freno, Mikaela Keller, Marc Tommasi. Fiedler Random Fields: A Large-Scale Spectral Approach to Statistical Network Modeling. In proceedings of NIPS 2012.
  • Antonino Freno, Mikaela Keller, Gemma C. Garriga, Marc Tommasi. Spectral Estimation of Conditional Random Graph Models for Large-Scale Network data. In UAI 2012 - 28th Conference on Uncertainty in Artificial Intelligence, 2012.
  • Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, and Marc Tommasi. Normalization of Sequential Top-Down Tree-to-Word Transducers. In 5th International Conference on Language Automata Theory and Appliciations, LNCS, Tarragona, Spain, 2011. Springer.
  • François Denis, Edouard Gilbert, Amaury Habrard, Faïssal Ouardi, and Marc Tommasi. Relevant Representations for the Inference of Rational Stochastic Tree Languages. In Francois Coste, Alexander Clark, and Laurent Miclet, editors, Proceedings of the 9th International Colloquium on Grammatical Inference, volume 5278 of Lecture Notes in Artificial Intelligence, pages 57–70, St Malo, France, 2008. Springer Verlag.
  • Marc Tommasi, Rémi Gilleron, Pierre Senellart, Avin Mittal, and Daniel Muschick. Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge. In Web information and data managment, pages 9–16, Napa, United States, 2008. ACM.
  • Francois Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, and Édouard Gilbert. On Probability Distributions for Trees: Representations, Inference and Learning. In NIPS Workshop on Representations and Inference on Probability Distributions, Whistler, Canada, 2007.
  • Rémi Gilleron, Florent Jousse, Isabelle Tellier, and Marc Tommasi. XML Document Transformation with Conditional Random Fields. In INEX 2006, volume 4518 of LNCS, Dagstuhl, Germany, December 2006. http://www.springerlink.com/.
  • Rémi Gilleron, Patrick Marty, Fabien Torre, and Marc Tommasi. Interactive Tuples Extraction from Semi-Structured Data. In Web Intelligence, Hong Kong, China, 2006.
  • Florent Jousse, Rémi Gilleron, Isabelle Tellier, and Marc Tommasi. Conditional Random Fields for XML Trees. In Workshop on Mining and Learning in Graphs, Berlin, Germany, 2006.
  • Julien Carme, Joachim Niehren, and Marc Tommasi. Querying Unranked Trees with Stepwise Tree Automata. In Vincent van Oostrom, editor, 19th International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 105–118, Aachen, Georgia, 2004. Springer.
  • F. Denis, R. Gilleron, A. Laurent, and M. Tommasi. Text classification and co-training from positive and unlabeled examples. In Proceedings of the ICML Workshop: the Continuum from Labeled Data to Unlabeled Data in Machine Learning and Data Mining, pages 80 – 87, 2003.
  • Julien Carme, Rémi Gilleron, Marc Tommasi, Alain Terlutte, and Aurélien Lemay. Residual Finite Tree Automata. In 7th International Conference on Developments in Language Theory, volume 2710, pages 171 – 182, Szeged, Hungary, Hungary, July 2003. Springer Verlag.
  • Francesco De Comite, Rémi Gilleron, and Marc Tommasi. Learning Multi-label Alternating Decision Trees from Texts and Data. In Azriel Rosenfeld Petra Perner, editor, International Conference on Machine Learning and Data Mining, Lecture Notes in Artificial Intelligence, pages 35–49, Leipzig, Georgia, 2003. Springer.
  • D. Dudau-Sofronie, I. Tellier, and M. Tommasi. A learnable class of classical categorial grammars from typed examples. In 8th Conference on Formal Grammar, pages 77–88, 2003.
  • F. Denis, R. Gilleron, and M. Tommasi. Text classification from positive and unlabeled examples. In IPMU‘02, 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 1927–1934, 2002.
  • D. Dudau-Sofronie, I. Tellier, and M. Tommasi. A tool for language learning based on categorial grammars and semantic information. In proceedings of ICGI‘2002, International Colloquium on Grammatical Inference (demo session), volume 2484 of Lecture Notes in Artificial Intelligence, pages 303–305. Springer Verlag, 2002.
  • D. Dudau-Sofronie, I. Tellier, and M. Tommasi. From logic to grammars via types. In proceedings of LLL 2001, Learning Language in Logic, pages 35–46, 2001.
  • D. Dudau-Sofronie, I. Tellier, and M. Tommasi. Learning categorial grammars from semantic types. In proceedings of the 13th Amsterdam Colloquium, pages 79–84, 2001.
  • F. Seynhaeve, S. Tison, and M. Tommasi. Homomorphisms and concurrent term rewriting. In G. Ciobanu and G. Paun, editors, Proceedings of the twelfth International Conference on Fundamentals of Computation theory, number 1684 in Lecture Notes in Computer Science, pages 475–487, Iasi, Romania, 1999. Springer Verlag.
  • A.-C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the satisfiability of quantifier free formulae on one-step rewriting. In P. Narendran and M. Rusinowitch, editors, Proceedings of the tenth International Conference on Rewriting Techniques and Applications, number 1631 in Lecture Notes in Computer Science, pages 103–117, Trento, Italy, 1999. Springer Verlag.
  • R. Gilleron, S. Tison, and M. Tommasi. Some new decidability results on positive and negative set constraints. In Proceedings, First International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 336–351, Springer Verlag, 1994.
  • R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In 10th Annual Symposium on Theoretical Aspects of Computer Science pages 505–514, 1993.
  • R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proceedings of the :math:`34^{th}` Symp. on Foundations of Computer Science, pages 372–380, 1993.

Other publications

  • Édouard Gilbert, Rémi Gilleron, and Marc Tommasi. Series, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees. Research Report RR-7200, INRIA, February 2010.
  • Rémi Gilleron, Florent Jousse, Marc Tommasi, and Isabelle Tellier. Conditional Random Fields for XML Applications. Research Report RR-6738, INRIA, 2008.
  • Marc Tommasi. Structures arborescentes et apprentissage automatique. Hdr, Université Charles de Gaulle - Lille III, November 2006.
  • Florent Jousse, Rémi Gilleron, Isabelle Tellier, and Marc Tommasi. Champs Conditionnels Aléatoires pour l’Annotation d’Arbres. In CAp 2006, Trégastel, France, 2006.
  • F. De Comité, R. Gilleron, and M. Tommasi. Learning multi-label alternating decision trees and applications. In Gilles Bisson, editor, Proceedings of CAP‘01 : Conférence en Apprentissage Automatique, pages 195–210, 2001.
  • H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
  • M. Tommasi. Automates et contraintes ensemblistes. PhD thesis, Laboratoire d’Informatique Fondamentale de Lille, 1994.
  • M. Tommasi. Automates d’arbres avec tests d’égalité entre cousins germains. Mémoire de DEA, Univ. Lille I, 1992.