{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:42Z","timestamp":1740169422246,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Commission under the Horizon 2020 Program through the FALCON Project, Fight Against Large-Scale Corruption and Organized Crime Networks","award":["GA 101121281"],"award-info":[{"award-number":["GA 101121281"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3495531","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T18:43:33Z","timestamp":1731350613000},"page":"166923-166935","source":"Crossref","is-referenced-by-count":0,"title":["Mahalanobis Distance-Based Graph Attention Networks"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9188-0124","authenticated-orcid":false,"given":"Konstantina","family":"Mardani","sequence":"first","affiliation":[{"name":"Information Technologies Institute, Visual Computing Lab, Centre for Research and Technology Hellas, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3604-9685","authenticated-orcid":false,"given":"Nicholas","family":"Vretos","sequence":"additional","affiliation":[{"name":"Information Technologies Institute, Visual Computing Lab, Centre for Research and Technology Hellas, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3814-6710","authenticated-orcid":false,"given":"Petros","family":"Daras","sequence":"additional","affiliation":[{"name":"Information Technologies Institute, Visual Computing Lab, Centre for Research and Technology Hellas, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"8459","article-title":"Learning to simulate complex physics with graph networks","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","volume":"119","author":"Sanchez-Gonzalez"},{"key":"ref2","first-page":"1","article-title":"Protein interface prediction using graph convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Fout"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2020.3004143"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"issue":"20","key":"ref6","first-page":"48550","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"Stat"},{"key":"ref7","first-page":"1","article-title":"Gated graph sequence neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","volume":"22","author":"Yujia"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(99)00047-7"},{"key":"ref10","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Niepert"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_3"},{"key":"ref13","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"issue":"9","key":"ref14","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref16","first-page":"1","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Defferrard"},{"key":"ref17","first-page":"1","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Ying"},{"key":"ref18","article-title":"Towards sparse hierarchical graph classifiers","author":"Cangea","year":"2018","journal-title":"arXiv:1811.01287"},{"key":"ref19","first-page":"2083","article-title":"Graph U-Net","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gao"},{"key":"ref20","first-page":"1","article-title":"Capsule graph neural network","volume-title":"Int. Conf. Learn. Represent.","author":"Xinyi"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119045"},{"key":"ref22","article-title":"Are powerful graph neural nets necessary? A dissection on graph classification","author":"Chen","year":"2019","journal-title":"arXiv:1905.04579"},{"key":"ref23","first-page":"1","article-title":"Provably powerful graph networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Maron"},{"key":"ref24","first-page":"599","article-title":"Breaking the limits of message passing graph neural networks","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Balcilar"},{"key":"ref25","first-page":"1","article-title":"Learning metrics for persistence-based summaries and applications for graph classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Zhao"},{"key":"ref26","first-page":"236","article-title":"Quaternion graph neural networks","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Nguyen"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref28","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018","journal-title":"arXiv:1810.04805"},{"key":"ref29","article-title":"An image is worth 16\u00d716 words: Transformers for image recognition at scale","author":"Dosovitskiy","year":"2020","journal-title":"arXiv:2010.11929"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58452-8_13"},{"key":"ref31","first-page":"1","article-title":"Watch your step: Learning node embeddings via graph attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Abu-El-Haija"},{"key":"ref32","article-title":"Attention-based graph neural network for semi-supervised learning","author":"Thekumparampil","year":"2018","journal-title":"arXiv:1803.03735"},{"key":"ref33","article-title":"Gated graph sequence neural networks","author":"Li","year":"2015","journal-title":"arXiv:1511.05493"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00658"},{"key":"ref35","article-title":"Universal graph transformer self-attention networks","author":"Nguyen","year":"2019","journal-title":"arXiv:1909.11855"},{"key":"ref36","article-title":"Accurate learning of graph representations with graph multiset pooling","author":"Baek","year":"2021","journal-title":"arXiv:2102.11533"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58574-7_24"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg130"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref41","first-page":"1","article-title":"A structural smoothing framework for robust graph comparison","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Yanardag"},{"volume-title":"Graph classification with graph convolutional networks in PyTorch","year":"2018","author":"Knyazev","key":"ref42"},{"volume-title":"Graph-Neural-Networks-for-Graph-Classification","year":"2023","key":"ref43"},{"key":"ref44","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref45","first-page":"1","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref46","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref47","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10749806.pdf?arnumber=10749806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T14:36:30Z","timestamp":1732718190000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10749806\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3495531","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}