Exportar Publicação
A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.
Yamaguchi, C., Stefenon, S., de Paz Santana, J. F. & Leithardt, V. (2025). Are graph neural networks better than standard classifiers?. In Daniel H. de la Iglesia, Juan F. de Paz Santana, Alfonso J. López Rivero (Ed.), Proceedings of the 5th Int. Conference on Disruptive Technologies, Tech Ethics and Artificial Intelligence (DiTTEt 2025). (pp. 36-47). Salamanca: Springer.
C. K. Yamaguchi et al., "Are graph neural networks better than standard classifiers?", in Proc. of the 5th Int. Conf. on Disruptive Technologies, Tech Ethics and Artificial Intelligence (DiTTEt 2025), Daniel H. de la Iglesia, Juan F. de Paz Santana, Alfonso J. López Rivero, Ed., Salamanca, Springer, 2025, pp. 36-47
@inproceedings{yamaguchi2025_1775627411560,
author = "Yamaguchi, C. and Stefenon, S. and de Paz Santana, J. F. and Leithardt, V.",
title = "Are graph neural networks better than standard classifiers?",
booktitle = "Proceedings of the 5th Int. Conference on Disruptive Technologies, Tech Ethics and Artificial Intelligence (DiTTEt 2025)",
year = "2025",
editor = "Daniel H. de la Iglesia, Juan F. de Paz Santana, Alfonso J. López Rivero",
volume = "",
number = "",
series = "",
doi = "10.1007/978-3-031-99474-6_4",
pages = "36-47",
publisher = "Springer",
address = "Salamanca",
organization = "",
url = "https://link.springer.com/book/10.1007/978-3-031-99474-6"
}
TY - CPAPER TI - Are graph neural networks better than standard classifiers? T2 - Proceedings of the 5th Int. Conference on Disruptive Technologies, Tech Ethics and Artificial Intelligence (DiTTEt 2025) AU - Yamaguchi, C. AU - Stefenon, S. AU - de Paz Santana, J. F. AU - Leithardt, V. PY - 2025 SP - 36-47 SN - 2194-5357 DO - 10.1007/978-3-031-99474-6_4 CY - Salamanca UR - https://link.springer.com/book/10.1007/978-3-031-99474-6 AB - Graph neural networks (GNNs) are becoming very popular these days due to their ability to perform classification and prediction depending on node connections. Since features of samples belonging to the same class can be related, graph-based models may perform classification better than other classifiers. The big challenge for this evaluation is to know if there is a sufficiently adequate relationship between the connections of the nodes to justify the use of these models, since connections to unrelated classes can reduce the capacity of these models. This paper proposes a thorough comparative evaluation between graph models and other well-established classifiers to assess the extent to which GNNs may be superior. This will be done by evaluating the relationships between the probability of connections between nodes and changing database features. The evaluation is performed using synthetic data, which is a task that can be evaluated in future work. The results show that when there are connections of classes different from the node under evaluation, the GNNs lose their advantages over other classifiers. ER -
English