Invariant embedding for graph classification
Learning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that fast representation of graphs is known if we require the representation to be both invariant to nodes permutation and able to discriminate two-isomorphic graphs. Most graph representations explored so far require to be invariant. We explore new graph representations by relaxing this constraint. We present a generic embedding of graphs relying on spectral graph theory calledInvariant Graph Embedding (IGE). We show that for a large family of graphs, our embedding is still invariant. To evaluate the quality and utility of our IGE, we apply them to the graph classification problem and show that IGE reaches thestate-of-the-art on benchmark datasets.
Code (1)
Tasks
ClassificationGeneral ClassificationGraph ClassificationGraph EmbeddingSimilar Papers 제목 키워드 기반
Graph Homomorphism Convolution
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F…
General ClassificationGraph ClassificationGeometric instability of graph neural networks on large graphs
We analyse the geometric instability of embeddings produced by graph neural networks (GNNs). Existing methods are only applicable for small graphs and lack context in the graph domain. We propose a simple, efficient and …
Link PredictionNode ClassificationTranslationPremise Selection for Theorem Proving by Deep Graph Embedding
We propose a deep learning-based approach to the problem of premise selection: selecting mathematical statements relevant for proving a given conjecture. We represent a higher-order logic formula as a graph that is invar…
Automated Theorem ProvingGeneral ClassificationGraph EmbeddingPINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions
Graph node embedding aims at learning a vector representation for all nodes given a graph. It is a central problem in many machine learning tasks (e.g., node classification, recommendation, community detection). The key …
Community DetectionGraph EmbeddingNode ClassificationGraphIFE: Rethinking Graph Imbalance Node Classification via Invariant Learning
The class imbalance problem refers to the disproportionate distribution of samples across different classes within a dataset, where the minority classes are significantly underrepresented. This issue is also prevalent in…
Node Classification