Szczegóły publikacji

Opis bibliograficzny

Linear genetic programming for design graph neural networks for node classification / Maciej KRZYWDA, Szymon ŁUKASIK, Amir H. Gandomi // W: GECCO'25 Companion [Dokument elektroniczny] : proceedings of the 2025 Genetic and Evolutionary Computation Conference Companion : July 14–18, 2025, Málaga, Spain. — Wersja do Windows. — Dane tekstowe. — New York : Association for Computing Machinery, 2025. — e-ISBN: 979-8-4007-1464-1. — S. 2167– 2171. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 2169–2171, Abstr. — Publikacja dostępna online od: 2025-08-11. — Sz. Łukasik - dod. afiliacje: Systems Research Institute, Polish Academy of Sciences, Warsaw ; NASK National Research Institute, Warsaw

Autorzy (3)

Słowa kluczowe

node classificationlinear genetic programmingclassificationGraph Neural Networksevolutionary algorithmsgenetic programming

Dane bibliometryczne

ID BaDAP161864
Data dodania do BaDAP2025-09-03
Tekst źródłowyURL
DOI10.1145/3712255.3734278
Rok publikacji2025
Typ publikacjimateriały konferencyjne (aut.)
Otwarty dostęptak
Creative Commons
WydawcaAssociation for Computing Machinery (ACM)
KonferencjaGenetic and Evolutionary Computations 2025

Abstract

In recent years, significant efforts have been made to address graph node classification tasks by applying graph neural networks and methods based on label propagation. Despite the progress achieved by these approaches, their success often hinges on complex architectures and algorithms, sometimes leading to the oversight of crucial technical details. One crucial aspect of the innovative approach in designing artificial neural networks is suggesting a novel neural architecture. Currently used architectures have primarily been developed manually by human experts, which is time-consuming and error-prone. That is why adopting more sophisticated semiautomatic methods, such as Neural Architecture Search, has become commonplace. This paper introduces and assesses a Linear Genetic Programming approach for designing graph neural networks in the context of Node Classification. Our approach aims to systematically define the GCN parameter space, drawing inspiration from recent research on design principles. By doing so, our method seeks to balance achieving satisfactory performance and optimizing memory and computation resources, thus offering a more efficient alternative to conventional approaches from the neural architecture search area.

Publikacje, które mogą Cię zainteresować

fragment książki
#161866Data dodania: 3.9.2025
Unveiling the search space of simple contrastive graph clustering with Cartesian Genetic Programming / Maciej KRZYWDA, Yue Liu, Szymon ŁUKASIK, Amir H. Gandomi // W: GECCO'25 Companion [Dokument elektroniczny] : proceedings of the 2025 Genetic and Evolutionary Computation Conference Companion : July 14–18, 2025, Málaga, Spain. — Wersja do Windows. — Dane tekstowe. — New York : Association for Computing Machinery, 2025. — e-ISBN: 979-8-4007-1464-1. — S. 2380–2383. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 2382, Abstr. — Publikacja dostępna online od: 2025-08-11. — Sz. Łukasik - dod. afiliacje: Systems Research Institute, Polish Academy of Sciences, Warsaw ; NASK National Research Institute, Warsaw
fragment książki
#159335Data dodania: 16.5.2025
Designing Graph-Kolmogorov-Arnold networks for node classification with Cartesian Genetic Programming / Maciej KRZYWDA, Chenqing Hua, Szymon ŁUKASIK, Amir H. Gandomi // W: KU KDM 2025 [Dokument elektroniczny] : seventeenth ACC Cyfronet AGH HPC users' conference : Zakopane, 2-4 April 2025 : proceedings / eds. Marek Magryś, Marian Bubak, Robert Pająk, Andrzej Zemła. — Wersja do Windows. — Dane tekstowe. — Kraków : Academic Computer Centre Cyfronet AGH, 2025. — e-ISBN: 978-83-61433-48-4. — S. 47-48. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://events.plgrid.pl/event/70/attachments/143/364/PROCEED... [2025-04-11]. — Bibliogr. s. 48. — Sz. Łukasik - dod. afiliacja: Systems Research Institute, Polish Academy of Sciences