mlsanityData to 14 Oct 2026

An Evolution Kernel Method for Graph Classification through Heat Diffusion Dynamics

arXiv 2306.14688 ↗First posted 26 Jun 2023cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Autonomous individuals establish a structural complex system through pairwise connections and interactions. Notably, the evolution reflects the dynamic nature of each complex system since it recodes a series of temporal changes from the past, the present into the future. Different systems follow distinct evolutionary trajectories, which can serve as distinguishing traits for system classification. However, modeling a complex system's evolution is challenging for the graph model because the graph is typically a snapshot of the static status of a system, and thereby hard to manifest the long-term evolutionary traits of a system entirely. To address this challenge, we suggest utilizing a heat-driven method to generate temporal graph augmentation. This approach incorporates the physics-based heat kernel and DropNode technique to transform each static graph into a sequence of temporal ones. This approach effectively describes the evolutional behaviours of the system, including the retention or disappearance of elements at each time point based on the distributed heat on each node. Additionally, we propose a dynamic time-wrapping distance GDTW to quantitatively measure the distance between pairwise evolutionary systems through optimal matching. The resulting approach, called the Evolution Kernel method, has been successfully applied to classification problems in real-world structural graph datasets. The results yield significant improvements in supervised classification accuracy over a series of baseline methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 42 references that are in the map. First posted on arXiv 26 Jun 2023.

Builds on

13 of 42 references.

References · 13

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  3. 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
  4. 2016Learning Convolutional Neural Networks for Graphscited by 314
  5. 2017graph2vec: Learning Distributed Representations of Graphscited by 230
  6. 2019Learning metrics for persistence-based summaries and applications for graph classificationcited by 57
  7. 2018Anonymous Walk Embeddingscited by 46
  8. 2018Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagramscited by 33
  9. 2014Heat kernel based community detectioncited by 30
  10. 2021Learning subtree pattern importance for Weisfeiler-Lehmanbased graph kernelscited by 8
  11. 2019Fast Polynomial Approximation of Heat Kernel Convolution on Manifolds and Its Application to Brain Sulcal and Gyral Graph Pattern Analysiscited by 6
  12. 2020Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphscited by 6
1 more
  1. 2020Animal social networks: an introduction for complex systems scientistscited by 2

Built on by

Not cited yet.