Home

The research interests of the DIG team are focused on the computational aspects of data science, machine learning and artificial intelligence. The objectives are to make knowledge easy to extract, especially from textual sources, in order to store, process, query, and be understood by machines.
More specifically, the DIG team’s research activity covers the following topics:
• Database theory,
• Graph mining,
• Machine learning,
• Natural language processing,
• Knowledge bases,
• Machine reasoning,
• Collective intelligence.

The DIG team has strong industrial collaborations:


                  

The DIG team is a proud signer of the TCS4F pledge for sustainable research in theoretical computer science.  A large majority of DIG members are signers of the No free view? No review! pledge in favor of open access:

Theoretical Computer Scientists for Future No free view? No review!

Research

Knowledge Bases

A knowledge base is a computer-processable collection of knowledge about the world. We construct and mine such knowledge bases.

Graph Mining

Graphs are a near-universal way to represent data. We are concerned with mining graphs for patterns and properties. Our particular focus is on the scalability of such approaches.

  • Logo of scikit-networkscikit-network: scikit-network is a Python package for the analysis of large graphs (clustering, embedding, classification, ranking).

Social Web

The Web has evolved more and more into a social Web: content is produced and shared by users. In the DIG team, we follow and anticipate developments in this area.

  • Community detection: We are investigating means to detect and distinguish social communities on the Web.
  • Social Relations: We investigate the optimal investment in social relations from a theoretical point of view.

Language and Relevance

Computer science is not just about computers. In this area of research, we investigate how humans reason, and what this implies for machines.

  • Simplicity Theory: Simplicity theory seeks to explain the relevance of situations or events to human minds. See http://www.simplicitytheory.science
  • Relevance in natural language: The point is to retro-engineer methods to achieve meaningful and relevant speech from our understanding of human performance. Read this paper. Read more on this.
  • Communication as social signalling: We apply game theory and social simulation to explore conditions in which providing valuable (i.e. relevant) information is a profitable strategy. Read this paper. Read more on this.

Machine Learning for Data Streams

We investigate how to do machine learning in real time, contributing to new open source tools:

  • River: a Python library for online Machine Learning
  • MOA: Massive Online Analytics, a framework for mining data streams (in Java)
  • Apache SAMOA: Scalable Advanced Massive Online Analytics, an open source framework for data stream mining on the Hadoop Ecosystem

People

Talel Abdessalem Mehwish Alam Albert Bifet Thomas Bonald Jean-Louis Dessalles
Nils Holzenberger Louis Jachiet Van-Tam Nguyen Nikola Simidjievski Fabian Suchanek

Faculty

Research engineer

Post-docs

  • Peter Fratrik
  • Fajrian Yunus
  • Alaa Mazouz

PhD candidates

  • Bérénice Jaulmes. Advisors: Mehwish Alam and Fabian Suchanek
  • Van Chien Nguyen. Advisors: Samuel Tardieu  and Van-Tam Nguyen
  • Le Trung Nguyen. Advisors: Enzo Tartaglione and Van-Tam Nguyen
  • Yinghao Wang. Advisors: Enzo Tartaglione and Van-Tam Nguyen
  • Zhu Liao. Advisors: Enzo Tartaglione and Van-Tam Nguyen
  • Rémi Nahon. Advisors: Enzo Tartaglione and Van-Tam Nguyen
  • Ael Quelennec. Advisors: Enzo Tartaglione, Pavlo Mozharovsky and Van-Tam Nguyen
  • Ali Tarhini. Advisors: Paul Chollet  and Van-Tam Nguyen
  • Long-Tuan Vo. Advisors: Mehwish Alam, Pavlo Mozharovsky and Van-Tam Nguyen
  • Zakari Ait Ouazzou. Advisors: Talel Abdessalem and Albert Bifet
  • François Amat. Advisor: Fabian Suchanek
  • Tom Calamai. Advisors: Fabian M. Suchanek and Oana Balalau
  • Simon Coumes. Advisor: Fabian M. Suchanek
  • Pierre Epron. Advisors: Mehwish Alam and Adrien Coulet
  • Rajaa El Hamdani. Advisosr: Thomas Bonald & Fragkiskos Malliaros
  • Yiwen Peng. Advisors: Thomas Bonald and Mehwish Alam
  • Roman Plaud. Advisors: Thomas Bonald, Mathieu Labeau and Antoine Saillenfest
  • Samuel Reyd. Advisors: Ada Diaconescu and Jean-Louis Dessalles
  • Zacchary Sadeddine. Advisor: Fabian Suchanek
  • Samy Haffoudhi. Advisors: Fabian Suchanek and Nils Holzenberger

Interns

  • Yixing Yang. Advisors: Mehwish Alam and Pierre-Henri Paris

Former members

News

An open position of Assistant / Associate Professor is available in the team!

Posted on

Tuesday, June 17, 2025, 11:45, 4A301

Adrien Coulet (INRIA) Data- and knowledge-driven approaches for step-by-step guidance to differential diagnosis Diagnosis guidelines provide recommendations based on expert consensus that cover the majority of the population, but often overlook patients with uncommon conditions or multiple morbidities. We will present and compare two alternative approaches that provide a step-by-step guidance to the differential diagnosis …

Continue reading “Tuesday, June 17, 2025, 11:45, 4A301”

Posted on

Tuesday, May 27, 2025, 11:45, 4A301

Maximilian Egger Robust Knowledge Graph Cleaning Data quality is needed to properly and reliably use the information represented in the dataset. The increasing volume of data renders data preparation and cleaning increasingly difficult. Additionally, more diverse types of data structures for databases, like graphs, get used and need to be handled differently. This leads to …

Continue reading “Tuesday, May 27, 2025, 11:45, 4A301”

Posted on

Tuesday, May 13, 2025, 11:45, 4A301

Nikola Simidjievski Synthesis & Augmentation of Tabular Data In the Age of Foundation Models Foundation models – large pre-trained performant models – have shown remarkable success in applications that predominately focus on vision, language, and sound data. On the other hand, tabular data – one of the most prevalent data modalities in many critical domains …

Continue reading “Tuesday, May 13, 2025, 11:45, 4A301”