Publications about 'algorithm'
Books and proceedings
  1. M. Ducassé, editor. Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging, Saint Malo, France, May 1995. IRISA, Campus de Beaulieu, F-35042 Rennes cedex. Note: See [bibtex-entry]

Articles in journal or book chapters
  1. 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:] Keyword(s): Formal concept analysis, Knowledge graph, Semantic web, Graph homomorphism. [Abstract] [bibtex-entry]

  2. 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]

  3. 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]

  4. 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]

  5. 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]

  6. Sébastien Ferré and R. D. King. Finding Motifs in Protein Secondary Structure for Use in Function Prediction. Journal of Computational Biology, 13(3):719-731, 2006. Keyword(s): functional genomics, protein secondary structure, flexible motifs, dichotomic search algorithm. [bibtex-entry]

  7. 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]

  8. M. Ducassé and J. Noyé. Logic Programming Environments: Dynamic program analysis and debugging. The Journal of Logic Programming, 19/20:351-384, May/July 1994. Note: Anniversary issue: Ten years of Logic Programming. [WWW] [Abstract] [bibtex-entry]

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

Conference articles
  1. Francesco Bariatti, Peggy Cellier, and Sébastien Ferré. GraphMDL : sélection de motifs de graphes avec le principe MDL. In Extraction et Gestion des Connaissances (EGC), Bruxelles, Belgium, 2020. [WWW] [PDF] [Abstract] [bibtex-entry]

  2. Francesco Bariatti, Peggy Cellier, and Sébastien Ferré. GraphMDL Visualizer: Interactive Visualization of Graph Patterns. In Graph Embedding and Mining (GEM), an ECML-PKDD workshop, 2020. [WWW] Keyword(s): graph mining, graph pattern, MDL principle, visualization. [Abstract] [bibtex-entry]

  3. Francesco Bariatti, Peggy Cellier, and Sébastien Ferré. GraphMDL: Graph Pattern Selection based on Minimum Description Length. In Symposium on Intelligent Data Analysis (IDA), 2020. [WWW] [PDF] Keyword(s): Minimum Description Length, Graph Mining, Pattern Mining. [Abstract] [bibtex-entry]

  4. Sébastien Ferré. Answers Partitioning and Lazy Joins for Efficient Query Relaxation and Application to Similarity Search. In A. Gangemi and others, editors, Int. Conf. The Semantic Web (ESWC), LNCS 10843, pages 209-224, 2018. Springer. [WWW] [doi:10.1007/978-3-319-93417-4_14] Keyword(s): query relaxation, approximate answer, similarity search, semantic similarity, TDF, graph pattern, partition, join. [Abstract] [bibtex-entry]

  5. Sébastien Ferré. Concepts de plus proches voisins dans des graphes de connaissances. In 28es Journées francophones d'Ingénierie des Connaissances (IC), pages 163-174, 2017. [WWW] [PDF] Keyword(s): semantic web, knowledge graph, nearest neighbours, concept. [Abstract] [bibtex-entry]

  6. Clément Gautrais, René Quiniou, Peggy Cellier, Thomas Guyet, and Alexandre Termier. Purchase Signatures of Retail Customers. In Jinho Kim, Kyuseok Shim, Longbing Cao, Jae-Gil Lee, Xuemin Lin, and Yang-Sae Moon, editors, Advances in Knowledge Discovery and Data Mining, Cham, pages 110-121, 2017. Springer International Publishing. [WWW] [Abstract] [bibtex-entry]

  7. Sébastien Ferré and Peggy Cellier. Graph-FCA in Practice. In O. Haemmerlé, G. Stapleton, and C. Faron-Zucker, editors, Int. Conf. Conceptual Structures (ICCS) - Graph-Based Representation and Reasoning, LNCS 9717, pages 107-121, 2016. Springer. [WWW] [doi:10.1007/978-3-319-40985-6_9] Keyword(s): formal concept analysis, knowledge graph, graph pattern, algorithm. [Abstract] [bibtex-entry]

  8. 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]

  9. Peggy Cellier, Mireille Ducassé, Sébastien Ferré, and Olivier Ridoux. Multiple Fault Localization with Data Mining. In Int. Conf. on Software Engineering & Knowledge Engineering, pages 238-243, 2011. Knowledge Systems Institute Graduate School. Keyword(s): data mining, software engineering, debugging, association rules, formal concept analysis. [Abstract] [bibtex-entry]

  10. Denis Béchet and Annie Foret. (PPQ) : a pregroup parser using majority composition. In Proc. Parsing with Categorial Grammars, ESSLLI workshop, in Bordeaux, France, 2009. [PDF] Keyword(s): parser, pregroups, Lambek categorial grammars, parsing software, XML data. [Abstract] [bibtex-entry]

  11. D. Béchet and A. Foret. Fully Lexicalized Pregroup Grammars. In Proceedings of WOLLIC 2007, volume LNCS 4576, pages 12-25, 2007. Springer. [PDF] Keyword(s): Pregroups, Lambek Categorial Grammars, Simulation. [Abstract] [bibtex-entry]

  12. 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]

  13. Sébastien Ferré. The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. In S.O. Kuznetsov and S. Schmidt, editors, Int. Conf. Formal Concept Analysis, LNAI 4390, pages 98-113, 2007. Springer. Keyword(s): concept analysis, logic, string, suffix tree. [Abstract] [bibtex-entry]

  14. Peggy Cellier, Sébastien Ferré, Olivier Ridoux, and Mireille Ducassé. An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy. In S. Ben Yahia and E. Mephu Nguifo, editors, Int. Conf. Concept Lattices and Their Applications, LNAI 4932, pages 243-248, 2006. Springer. [PDF] Keyword(s): concept analysis, algorithm, taxonomy. [Abstract] [bibtex-entry]

  15. 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]

  16. 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]

  17. Sébastien Ferré. The Use of Associative Concepts for Fast Incremental Concept Formation in Sparse Contexts. In B. Ganter and A. de Moor, editors, Using Conceptual Structures -- Contributions to ICCS 2003, 2003. Shaker Verlag. [PDF] Keyword(s): concept analysis, associative concept, lattice, algorithm, sparse context. [bibtex-entry]

  18. S. Schoenig and M. Ducassé. A Backward Slicing Algorithm for Prolog. In R. Cousot and D.A. Schmidt, editors, Static Analysis Symposium, Aachen, pages 317-331, September 1996. Springer-Verlag, LNCS 1145. [WWW] [Abstract] [bibtex-entry]

  19. S. Schoenig and M. Ducassé. Slicing pour programmes Prolog. In Actes des journées GDR programmation'96, Orléans, Novembre 1996. Université de Bordeaux I. [WWW] [Abstract] [bibtex-entry]

  20. M. Ducassé. A pragmatic survey of automated debugging. In P. Fritzson, editor, Proceedings of the First Workshop on Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Sciences, Linkoeping, Sweden, May 1993. Springer-Verlag. [WWW] [Abstract] [bibtex-entry]

  21. M. Ducassé. Analysis of failing Prolog executions. In Actes des Journées Francophones sur la Programmation Logique, Mai 1992. [Abstract] [bibtex-entry]

Internal reports
  1. Sébastien Ferré and Olivier Ridoux. Logic Functors: A Toolbox of Components for Building Customized and Embeddable Logics. Research Report RR-5871, Irisa, March 2006. [WWW] Keyword(s): logic, components, modules and functors, theorem provers, type checking, application developpement. [Abstract] [bibtex-entry]

  2. Jean Goubault-Larrecq, Stéphane Demri, M. Ducassé, Ludovic Mé, Julien Olivain, Claudine Picaronny, Jean-Philippe Pouzol, Eric Totel, and Bernard Vivinis. Algorithmes de détection et langages de signatures. Livrable 3.3, Projet RNTL DICO,, Octobre 2003. [bibtex-entry]

  3. Sébastien Ferré. Incremental Concept Formation made More Efficient by the Use of Associative Concepts. Research Report RR-4569, Inria, Institut National de Recherche en Informatique et en Automatique, October 2002. [WWW] Keyword(s): context, concept lattice, Galois lattice, incremental algorithm, complexity. [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.

Last modified: Thu Apr 8 17:20:28 2021
Author: ferre.

This document was translated from BibTEX by bibtex2html