AFGen

swMATH6325MaRDI QIDQ18455FDOQ18455

Author name not available (Why is that?)

Cited In (23)

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

This page was built for software: AFGen