Knowledge Discovery in Graphs Through Vertex Separation

Marc Sarfati (1, 2) , Marc Queudot (1) , Catherine Mancel (3) , Marie-Jean Meurs (1)

1 UQAM - Université du Québec à Montréal = University of Québec in Montréal
2 X - École polytechnique
3 ENAC - Ecole Nationale de l'Aviation Civile

This paper presents our ongoing work on the Vertex Separator Problem (VSP), and its application to knowledge discovery in graphs representing real data. The classic VSP is modeled as an integer linear program. We propose several variants to adapt this model to graphs with various properties. To evaluate the relevance of our approach on real data, we created two graphs of different size from the IMDb database. The model was applied to the separation of these graphs. The results demonstrate how the model is able to semantically separate graphs into clusters.

Mots clés: Graph partitioning; Knowledge discovery; Vertex Separator Problem

Domaines: Informatique [cs]; Base de données [cs.DB]

Marc Sarfati, Marc Queudot, Catherine Mancel, Marie-Jean Meurs. Knowledge Discovery in Graphs Through Vertex Separation. AI 2017, 30th Canadian Conference on Artificial Intelligence, May 2017, Edmonton, Canada. pp 203-214, ⟨10.1007/978-3-319-57351-9_25⟩. ⟨hal-01521890⟩