About me

I am Isseïnie Sinouvassane (formerly Calviac), a PhD student in computer science at IRISA, in Rennes, France. I am supervised by Luis Galárraga and Alexandre Termier in the LACODAM team. My PhD is about How-Provenance Polynomials for Efficient and Greener Rule Mining.

I was formely a student at the École Normale Supérieure de Rennes, where I obtained my Master's and my Magistère Degree in Computer Science. Prior to that, I studied in preparatory classes (mathematics and physics specialization, computer science option) and I obtained my Bachelor's Degree at the ENS Rennes.

Resume in english Resume in french

News

July 10 - 12, 2024 : I participated in the PhD Forum of the ECML-PKDD conference

July 10 - 12, 2024 : I attended the SSDBM conference

June 26 - 28, 2024 : I presented a poster at the WomEncourage conference

September, 2023 : I started my PhD in LACODAM team

May 29 - June 2, 2023 : I was a student volunteer at the AAMAS conference and presented my full paper

Research

I am interested in algorithmics, machine learning and data mining. I also like to study complexity theory.

Experience

  • How-Provenance Polynomials for Efficient and Greener Rule Mining
    PhD
    September 2023 - now
    Supervised by Luis Galárraga and Alexandre Termier in the LACODAM team (IRISA, Rennes).
  • How-Provenance Polynomials for Efficient and Greener Rule Mining
    Research internship
    January - July 2023
    Supervised by Luis Galárraga and Alexandre Termier in the LACODAM team (INRIA, Rennes).
  • Learning abstractions on large transition systems using graph neural networks
    Graph neural network architecture for bisimulation.
    Research internship
    May - July 2022
    Supervised by Guillermo A. Perez (Antwerpen University, Belgium).
  • Connected Multi-Agent Path Finding
    Design and implementation in C++ of a RRT-based algorithm solving the CMAPF problem.
    Research project
    September 2021 - May 2022
    Supervised by Ocan Sankur and François Schwarzentruber in the LogicA team (IRISA, Rennes).
  • Connected Multi-Agent Path Finding
    Design and implementation in Python of a divide and conquer algorithm solving the CMAPF problem.
    Study of CMAPF complexity.
    Research internship
    May - July 2021
    Supervised by François Schwarzentruber in the LogicA team (IRISA, Rennes).

Publications

  • Isseïnie Calviac, Ocan Sankur, and François Schwarzentruber. 2023. Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. In Proc. of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), London, United Kingdom, May 29 – June 2, 2023, IFAAMAS, 9 pages.

Teaching

Teaching Assistant at the Rennes University and the ENS Rennes (2023-2025)

  • Algorithmics and experimental complexity : practical sessions (Licence 1 ISTN) in 2023/24
  • Databases : tutorials and practical sessions (Licence 2 ISTN)
  • Symbolic data mining : tutorials and practical sessions (Master 2 MIAGE)
  • Algorithmics : tutorials (Licence 3 SIF at the ENS Rennes)
  • Semantic Web and Knowledge Representation : tutorials and practical sessions (Master 1 IA)

Other activities

Scientific mediation

  • 2020-21: Unplugged computer science (see here) activities with elementary school students
  • June 2024: Computer science activity during a discovery internship with high school students (MathC2+ organized by INSA Rennes)

Studies

  • Second year of Master's Degree

    2022-2023
    Ecole Normale Supérieure de Rennes
    Main courses: Supervised Machine Learning, Data Mining and Vizualisation, Advanced Probabilistic Data Analysis and Modeling.
    With honors

  • First year of Master's Degree

    2021-2022
    Ecole Normale Supérieure de Rennes
    Main courses: Complexity Theory, Logic and Knowledge Representation, Compilation, Modelisation and Formal Verification by Automata, Semantics.

  • Bachelor's Degree

    2020-2021
    Ecole Normale Supérieure de Rennes
    Main courses: Algorithms, Logic, Language Theory, Computability Theory, Distributed Algorithms Statistics, Algebra and Analysis for Computer Science.
    With honors