Conference papers
Knowledge Discovery in Graphs Through Vertex Separation
Abstract : 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.
Cited literature [14 references]
https://hal-enac.archives-ouvertes.fr/hal-01521890
Contributor : Laurence Porte <>
Submitted on : Thursday, May 18, 2017 - 11:53:23 AM
Last modification on : Monday, August 24, 2020 - 10:27:17 AM
Contributor : Laurence Porte <>
Submitted on : Thursday, May 18, 2017 - 11:53:23 AM
Last modification on : Monday, August 24, 2020 - 10:27:17 AM
File
vsp-cai2017.pdf
Files produced by the author(s)