paper-with-me

홈 › Papers

Topology Based Scalable Graph Kernels

2019-07-15 · Kin Sum Liu, Chien-Chun Ni, Yu-Yao Lin, Jie Gao

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.

📄 PDF Abstract BibTeX arXiv:1907.07129

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Classification

Similar Papers 제목 키워드 기반

Density of States Graph Kernels

2020-10-21 · Leo Huang, Andrew Graven, David Bindel

A fundamental problem on graph-structured data is that of quantifying similarity between graphs. Graph kernels are an established technique for such tasks; in particular, those based on random walks and return probabilit…

Metric Graph Kernels via the Tropical Torelli Map

2025-05-17 · Yueqi Cao, Anthea Monod

We propose new graph kernels grounded in the study of metric graphs via tropical algebraic geometry. In contrast to conventional graph kernels that are based on graph combinatorics such as nodes, edges, and subgraphs, ou…

Non-convolutional Graph Neural Networks

2024-07-31 · Yuanqing Wang, Kyunghyun Cho

Rethink convolution-based graph neural networks (GNN) -- they characteristically suffer from limited expressiveness, over-smoothing, and over-squashing, and require specialized sparse kernels for efficient computation. H…

Graph Learning

Faster Kernels for Graphs with Continuous Attributes via Hashing

2016-10-01 · Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel

While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome t…

Scalable kernels for graphs with continuous attributes

2013-12-01 · NeurIPS 2013 12 · Aasa Feragen, Niklas Kasenburg, Jens Petersen, Marleen de Bruijne 외

While graphs with continuous node attributes arise in many applications, state-of-the-art graph kernels for comparing continuous-attributed graphs suffer from a high runtime complexity; for instance, the popular shortest…

General Classification