1. Peggy Cellier and Kurt Driessens, editors. Machine Learning and Knowledge Discovery in Databases - International Workshops of ECML PKDD 2019, Würzburg, Germany, September 16-20, 2019, Proceedings, Part I, volume 1167 of Communications in Computer and Information Science, 2020. Springer. [bibtex-entry]



2. Peggy Cellier and Kurt Driessens, editors. Machine Learning and Knowledge Discovery in Databases - International Workshops of ECML PKDD 2019, Würzburg, Germany, September 16-20, 2019, Proceedings, Part II, volume 1168 of Communications in Computer and Information Science, 2020. Springer. [bibtex-entry]



3. Peggy Cellier, Thierry Charnois, Andreas Hotho, Stan Matwin, Marie-Francine Moens, and Yannick Toussaint, editors. Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing, DMNLP 2017, co-located with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD 2017, Skopje, Macedonia, September 22, 2017, volume 1880 of CEUR Workshop Proceedings, 2017. CEUR-WS.org. [WWW] [bibtex-entry]



4. Peggy Cellier, Thierry Charnois, Andreas Hotho, Stan Matwin, Marie-Francine Moens, and Yannick Toussaint, editors. Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing, DMNLP 2016, co-located with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD 2016, Riva del Garda, Italy, September 23, 2016, volume 1646 of CEUR Workshop Proceedings, 2016. CEUR-WS.org. [WWW] [bibtex-entry]



5. Peggy Cellier, Thierry Charnois, Andreas Hotho, Stan Matwin, Marie-Francine Moens, and Yannick Toussaint, editors. Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing, DMNLP 2015, co-located with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD 2015, volume 1410 of CEUR Workshop Proceedings, 2015. CEUR-WS.org. [bibtex-entry]



6. Peggy Cellier, Thierry Charnois, Andreas Hotho, Stan Matwin, Marie-Francine Moens, and Yannick Toussaint, editors. Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing, DMNLP 2014, co-located with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD 2014, volume 1202 of CEUR Workshop Proceedings, 2014. CEUR-WS.org. [bibtex-entry]

1. Denis Béchet and Annie Foret. Incremental learning of iterated dependencies. Journal of Machine Learning, 2022. [doi:10.1007/s10994-021-05947-2] Keyword(s): Grammatical inference - Categorial grammar - Dependency grammar - Incremental learning - Iterated types - Treebanks. [Abstract] [bibtex-entry]



2. Sébastien Ferré. Application of Concepts of Neighbours to Knowledge Graph Completion. Data Science: Methods, Infrastructure, and Applications, 4:1-28, 2021. [doi:10.3233/DS-200030] Keyword(s): knowledge graph, link prediction, concepts of enighbours. [Abstract] [bibtex-entry]



3. Sébastien Ferré and Peggy Cellier. Graph-FCA: An extension of formal concept analysis to knowledge graphs. Discrete Applied Mathematics, 273(5):81-102, 2020. [WWW] [doi:https://doi.org/10.1016/j.dam.2019.03.003] Keyword(s): Formal concept analysis, Knowledge graph, Semantic web, Graph homomorphism. [Abstract] [bibtex-entry]



4. Annie Foret and Denis Béchet. On Categorial Grammatical Inference and Logical Information Systems. In Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Studies in Computational Intelligence. 2019. [WWW] [Abstract] [bibtex-entry]



5. Peggy Cellier, Sébastien Ferré, Olivier Ridoux, and Mireille Ducassé. A Parameterized Algorithm to Explore Formal Contexts with a Taxonomy. Int. J. Foundations of Computer Science (IJFCS), 19(2):319-343, 2008. Keyword(s): algorithm, concept lattice, taxonomy. [Abstract] [bibtex-entry]



6. D. Bechet, A. Foret, and I. Tellier. Learnability of Pregroup Grammars. Studia Logica, 87(2-3), 2007. Keyword(s): Learning from positive examples, Pregroup grammars, Computational linguistics, parsing, Categorial Grammars, constraints. [Abstract] [bibtex-entry]



7. D. Béchet, R. Bonato, A. Dikovsky, A. Foret, Y. Le Nir, E. Moreau, C. Retoré, and I. Tellier. Modèles algorithmiques de l'acquisition de la syntaxe : concepts et méthodes, résultats et problèmes. Recherches linguistiques de Vincennes, 2007. Note: Vol. 37, Presses Universitaires de Vincennes. [PDF] Keyword(s): Acquisition syntaxique, inférence grammaticale, grammaires catégorielles, modèle de Gold, ressources syntaxiques (syntax learning, grammatical inference, categorial grammars, Gold's model, syntactical resources). [Abstract] [bibtex-entry]



8. Denis Bechet and Annie Foret. k-Valued Non-Associative Lambek Grammars are learnable from Generalized Functor-Argument Structures. Journal of Theoretical Computer Science, 2006. Note: Vol. 355, 2 (extended version). [PDF] Keyword(s): Grammatical inference, Categorial grammars, Non-associative Lambek calculus, Learning from positive examples, Model of Gold. [Abstract] [bibtex-entry]



9. Sébastien Ferré and R. D. King. A dichotomic search algorithm for mining and learning in domain-specific logics. Fundamenta Informaticae -- Special Issue on Advances in Mining Graphs, Trees and Sequences, 66(1-2):1-32, 2005. [PDF] Keyword(s): machine learning, logic, concept analysis, data-mining, logic functors. [Abstract] [bibtex-entry]



10. D. Le Métayer, V.-A. Nicolas, and O. Ridoux. Programs, Properties, and Data: Exploring the Software Development Trilogy. IEEE Software, 15(6):75-81, November/December 1998. [WWW] Keyword(s): Software engineering, testing, verification, program analysis, program learning. [Abstract] [bibtex-entry]

1. Hugo Ayats, Peggy Cellier, and Sébastien Ferré. Extracting Relations in Texts with Concepts of Neighbours. In Agnès Braud, Aleksey Buzmakov, Tom Hanika, and Florence Le Ber, editors, Formal Concept Analysis, LNCS 12733, pages 155-171, 2021. Springer. [WWW] [doi:10.1007/978-3-030-77867-5_10] [Abstract] [bibtex-entry]



2. Sébastien Ferré. A Proposal for Extending Formal Concept Analysis to Knowledge Graphs. In J. Baixeries, C. Sacarea, and M. Ojeda-Aciego, editors, Int. Conf. Formal Concept Analysis (ICFCA), LNCS 9113, pages 271-286, 2015. Springer. Keyword(s): formal concept analysis, knowledge graph, Semantic Web, graph pattern, relation, projection. [Abstract] [bibtex-entry]



3. Denis Béchet, Alexandre Dikovsky, and Annie Foret. Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. In Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, volume 6807 of Lecture Notes in Computer Science, pages 42-52, 2011. Springer. [Abstract] [bibtex-entry]



4. Denis Béchet, Alexander Dikovsky, and Annie Foret. On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. In Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France, volume 6736 of Lecture Notes in Computer Science, pages 80-95, 2011. Springer. Keyword(s): Grammatical inference, Categorial grammar, Dependency grammar, Incremental learning, Iterated types.. [Abstract] [bibtex-entry]



5. D. Bechet, A. Dikovsky, and Annie Foret. Two models of learning iterated dependencies.. In Formal Grammar, LNCS, 2010. Springer. [Abstract] [bibtex-entry]



6. Peggy Cellier, Sébastien Ferré, Olivier Ridoux, and Mireille Ducassé. A Parameterized Algorithm for Exploring Concept Lattices. In S.O. Kuznetsov and S. Schmidt, editors, Int. Conf. Formal Concept Analysis, LNAI 4390, pages 114-129, 2007. Springer. Keyword(s): concept analysis, algorithm, taxonomy. [Abstract] [bibtex-entry]



7. Denis Bechet and Annie Foret. On Rigid NL Lambek Grammars Inference from Generalized Functor-Argument Data. In FGMOL'05, the tenth conference on Formal Grammar and the ninnth on the Mathematics of Language, Edinburgh, Scotland, 2005. Keyword(s): grammatical inference, categorial grammars, non- associative Lambek calculus, learning from positive examples, model of Gold. [Abstract] [bibtex-entry]



8. Denis Bechet and Annie Foret. k-Valued Non-Associative Lambek Grammars (without Product) Form a Strict Hierarchy of Languages. In Proceedings of the LACL 2005 Conference: Logical Aspects of Computational Linguistics, LNCS(LNAI) 3492, pages 1-17, 2005. springer. [PDF] [Abstract] [bibtex-entry]



9. T. Denmat, M. Ducassé, and O. Ridoux. Data mining and cross-checking of execution traces. A re-interpretation of Jones, Harrold and Stasko test information visualization. In T. Ellman and A. Zisman, editors, Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, November 2005. ACM Press. Note: See RR-5661 for a long version of this article. Keyword(s): Software Engineering, Debugging, Artificial Intelligence, Learning, Knowledge acquisition. [Abstract] [bibtex-entry]



10. D. Bechet, A. Dikovsky, A. Foret, and E. Moreau. On learning discontinuous dependencies from positive data. In Proceedings of the Formal Grammar Conference (FG 2004), August 2004. [bibtex-entry]



11. Sébastien Ferré and Olivier Ridoux. The Use of Associative Concepts in the Incremental Building of a Logical Context. In G. Angelova U. Priss, D. Corbett, editor, Int. Conf. Conceptual Structures, LNCS 2393, pages 299-313, 2002. Springer. Keyword(s): concept analysis, logic, information systems, learning, classification, context. [Abstract] [bibtex-entry]



12. Sébastien Ferré and Olivier Ridoux. Searching for Objects and Properties with Logical Concept Analysis. In Harry S. Delugach and Gerd Stumme, editors, International Conference on Conceptual Structures, LNCS 2120, pages 187-201, 2001. Springer. Keyword(s): concept analysis, navigation, knowledge discovery, logical information system. [Abstract] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html