arXiv:1907.07129
Topology Based Scalable Graph Kernels
원문 초록
We propose a new graph kernel for graph classification and comparison using Ollivier Ricci curvature. The Ricci curvature of an edge in a graph describes the connectivity in the local neighborhood. An edge in a densely connected neighborhood has positive curvature and an edge serving as a local bridge has negative curvature. We use the edge curvature distribution to form a graph kernel which is then used to compare and cluster graphs. The curvature kernel uses purely the graph topology and thereby works for settings when node attributes are not available.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Density-aware Walks for Coordinated Campaign Detection
Positional Encoding meets Persistent Homology on Graphs
Improving the Effective Receptive Field of Message-Passing Neural Networks
Graph Style Transfer for Counterfactual Explainability
Scalable Graph Generative Modeling via Substructure Sequences
Addressing the Scarcity of Benchmarks for Graph XAI
토론
이 논문과 연결된 포럼 글이 아직 없습니다.