AFGen
From MaRDI portal
Software:18455
No author found.
Related Items (23)
GTED: Graph Traversal Edit Distance ⋮ Graph coarsening: from scientific computing to machine learning ⋮ Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification ⋮ Propagation kernels: efficient graph kernels from propagated information ⋮ Bosonic Random Walk Neural Networks for Graph Learning ⋮ Polynomial-based graph convolutional neural networks for graph classification ⋮ Fast depth-based subgraph kernels for unattributed graphs ⋮ Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics ⋮ Effective feature construction by maximum common subgraph sampling ⋮ Depth-based complexity traces of graphs ⋮ The journey of graph kernels through two decades ⋮ gBoost: a mathematical programming approach to graph classification and regression ⋮ A unifying view of explicit and implicit feature maps of graph kernels ⋮ Supervised neighborhood graph construction for semi-supervised classification ⋮ K-plex cover pooling for graph neural networks ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Interpretable multi-scale graph descriptors via structural compression ⋮ Deep graph similarity learning: a survey ⋮ Discriminative frequent subgraph mining with optimality guarantees ⋮ Effective graph classification based on topological and label attributes ⋮ Scientific Data Mining ⋮ A gentle introduction to deep learning for graphs ⋮ Path integral based convolution and pooling for graph neural networks*
This page was built for software: AFGen
