Research

I’m interested in the discovery of knowledge in data. I mostly work with lattices and their n-dimensional generalisations, from the point of view of formal concept analysis. My main application focus is pattern mining in RDF data.

Pre-Prints and Submitted Works

  • A Triadic Generalisation of the Boolean Concept Lattice. Alexandre Bazin.
  • Polyadic Relational Concept Analysis. Alexandre Bazin, Jessie Galasso-Carbonnel, Giacomo Kahn. (pdf)
  • Discovery of Link Keys in RDF Datasets based on Pattern Structures. Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli.

Journals

  • Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Discrete Mathematics & Theoretical Computer Science, to be published. (Abstract) (pdf)
  • Condensed Representations of Association Rules in n-ary Relations. Alexandre Bazin, Nicolas Gros, Aurélie Bertaux, Christophe Nicolle. IEEE Transactions on Knowledge and Data Engineering 2022. (Abstract) (pdf)
  • A Novel Framework for Unification of Association Rule Mining, Online Analytical Processing and Statistical Reasoning. Rahul Sharma, Minakshi Kaushik, Sijo Arakkal Peious, Alexandre Bazin, Syed Attique Shahn, Iztok Fistern, Sadok Ben Yahia, Dirk Draheim. IEEE Access 2022. (Abstract) (pdf)
  • Steps Towards Causal Formal Concept Analysis. Alexandre Bazin, Miguel Couceiro, Marie-Dominique Devignes, Amedeo Napoli. International Journal of Approximate Reasoning 2022. (Abstract) (pdf)
  • On Implication Bases in n-Lattices. Alexandre Bazin. Discrete Applied Mathematics 2020. (Abstract) (pdf)
  • A De Novo Robust Clustering Approach for Amplicon-Based Sequence Data. Alexandre Bazin, Didier Debroas, Engelbert Mephu Nguifo. Journal Of Computational Biology 2018. (Abstract) (pdf)
  • A Depth-first Search Algorithm for Computing Pseudo-closed Sets. Alexandre Bazin. Discrete Applied Mathematics 2018. (Abstract) (pdf)
  • Computing the Duquenne-Guigues Basis : An Algorithm for Choosing the Order. Alexandre Bazin and Jean-Gabriel Ganascia. International Journal of General Systems 2016. (Abstract) (pdf)

Conferences & Workshops

  • A Study of the Discovery and Redundancy of Link Keys Between Two RDF Datasets Based on Partition Pattern Structures. Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli. CLA 2022. (Abstract) (pdf)
  • Non-Redundant Link Keys in RDF Data: Preliminary Steps. Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli. FCA4AI 2021. (Abstract) (pdf)
  • An Approach to Identifying the Most Predictive and Discriminant Features in Supervised Classification Problems. Alexandre Bazin, Miguel Couceiro, Marie-Dominique Devignes, Amedeo Napoli. ICCS 2021, short paper. (Abstract) (pdf)
  • Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice. Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli. ICFCA 2021, short paper. (Abstract) (pdf)
  • Explaining multicriteria decision making with formal concept analysis. Alexandre Bazin, Miguel Couceiro, Marie-Dominique Devignes and Amedeo Napoli. CLA 2020. (Abstract) (pdf)
  • On-Demand Relational Concept Analysis. Alexandre Bazin, Jessie Carbonnel, Marianne Huchard, Giacomo Kahn, Priscilla Keip, Amirouche Ouzerdine. ICFCA 2019. (Abstract) (pdf)
  • Reduction and Introducers in d-contexts. Alexandre Bazin and Giacomo Kahn. ICFCA 2019. (Abstract) (pdf)
  • Représentation condensée de règles d’association multidimensionnelles. Alexandre Bazin, Aurélie Bertaux, Christophe Nicolle. EGC 2019. (Abstract : English, Français) (pdf)
  • Du nombre maximum d’ensembles fermés en 3 dimensions. Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. EGC 2019. (Abstract : English, Français) (pdf)
  • Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. ICGT 2018. (Abstract) (pdf (journal version))
  • k-Partite Graphs as Contexts. Alexandre Bazin and Aurélie Bertaux. CLA 2018. (Abstract) (pdf)
  • Average Size of Implicational Bases. Giacomo Kahn and Alexandre Bazin. CLA 2018. (Abstract) (pdf)
  • A De Novo Robust Clustering Approach for Amplicon-Based Sequence Data.’ Alexandre Bazin, Didier Debroas, Engelbert Mephu Nguifo. BAI@IJCAI 2017. (Abstract) (pdf)
  • On-demand Generation of AOC-posets: Reducing the Complexity of Conceptual Navigation. Alexandre Bazin, Jessie Carbonnel, Giacomo Kahn. ISMIS 2017. (Abstract) (pdf)
  • Comparing Algorithms for Computing Lower Covers of Implication-closed Sets. Alexandre Bazin. CLA 2016. (Abstract) (pdf)
  • Depth-first Search for Pseudo-intents through Minimal Transversals. Alexandre Bazin. FCA&A@ICFCA 2015. (Abstract) (pdf)
  • Enumerating Pseudo-Intents in a Partial Order. Alexandre Bazin and Jean-Gabriel Ganascia. CLA 2013. (Abstract) (pdf)
  • Completing Terminological Axioms with Formal Concept Analysis. Alexandre Bazin and Jean-Gabriel Ganascia. ICFCA 2012. (Abstract) (pdf)

Thesis

  • On the Enumeration of Pseudo-Intents : Choosing the Order and Extending to Partial Implications. Alexandre Bazin. (Abstract : English, Français) (pdf)

Projects