Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study

Zoltán Tasnádi, Noémi Gaskó. Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study. In Giuseppe Nicosia, Varun Ojha 0001, Emanuele La Malfa, Gabriele La Malfa, Panos M. Pardalos, Renato Umeton, editors, Machine Learning, Optimization, and Data Science - 9th International Conference, LOD 2023, Grasmere, UK, September 22-26, 2023, Revised Selected Papers, Part II. Volume 14506 of Lecture Notes in Computer Science, pages 140-148, Springer, 2023. [doi]

Abstract

Abstract is missing.