K-plex cover pooling for graph neural networks

DOI10.1007/s10618-021-00779-zzbMath1483.68274OpenAlexW3125132074MaRDI QIDQ2238356

Davide Bacciu, Andrea Marino, Roberto Grossi, Francesco Landolfi, Alessio Conte

Publication date: 1 November 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-021-00779-z

zbMATH Keywords

graph covering\(k\)-plexgraph neural networkgraph poolingpseudo-clique

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

KPlexPool

Uses Software

• NetworkX
• AFGen
• PyTorch
• Algorithm 457
• TUDataset
• BRENDA
• Graclus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wavelets on graphs via spectral graph theory
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A note on the problem of reporting maximal cliques
• Neocognition: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position
• Fast Haar transforms for graph neural networks
• A gentle introduction to deep learning for graphs
• Large-scale clique cover of real-world networks
• Powers of tensors and fast matrix multiplication
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Convolutional Neural Network Architectures for Signals Supported on Graphs
• Fast unfolding of communities in large networks
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: K-plex cover pooling for graph neural networks