Identyfikatory
Warianty tytułu
Konferencja
Federated Conference on Computer Science and Information Systems (17 ; 04-07.09.2022 ; Sofia, Bulgaria)
Języki publikacji
Abstrakty
Due to the growing reliance of various scientific and industrial problems on graphs, one of the recent challenging tasks, especially when dealing with graphs equipped with a set of nodal attributes, is discovering subgraphs consisting of highly interacting nodes with respect to the number of edges and the attributes' similarities. This paper proposes an approach based on integer programming modeling and the graph neural network message-passing manner for efficiently extracting these subgraphs. The experiments illustrate the proposed method's privilege over some alternative algorithms known so far, utilizing several well-known instances.
Słowa kluczowe
Rocznik
Tom
Strony
569--576
Opis fizyczny
Bibliogr. 45 poz.
Twórcy
autor
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-fb2dce0d-ea94-4e05-918c-49b039c4a634