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.
CITATION STYLE
Sarfati, M., Queudot, M., Mancel, C., & Meurs, M. J. (2017). Knowledge discovery in graphs through vertex separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10233 LNAI, pp. 203–214). Springer Verlag. https://doi.org/10.1007/978-3-319-57351-9_25
Mendeley helps you to discover research relevant for your work.