Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

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

File

vsp-cai2017.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

404

Files downloads

729