Graph embedding using multi-layer adjacent point merging model

2020-10-28 · Jianming Huang, Hiroyuki Kasai

For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs. These methods have achieved great success on resolving graph isomorphism problems. However, in some classification problems, the graph class depends on not only the topological similarity of the whole graph, but also constituent subgraph patterns. To this end, we propose a novel graph embedding method using a multi-layer adjacent point merging model. This embedding method allows us to extract different subgraph patterns from train-data. Then we present a flexible loss function for feature selection which enhances the robustness of our method for different classification problems. Finally, numerical evaluations demonstrate that our proposed method outperforms many state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2010.14773

Code (0)

등록된 구현이 없습니다.

Tasks

Classificationfeature selectionGeneral Classification Graph Classification Graph Embedding

Methods 이 논문이 사용한 방법론

Feature Selection Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables,…

Content Augmented Graph Neural Networks

2023-11-21 · Fatemeh Gholamzadeh Nasrabadi, AmirHossein Kashani, Pegah Zahedi, Mostafa Haghir Chehreghani

In recent years, graph neural networks (GNNs) have become a popular tool for solving various problems over graphs. In these models, the link structure of the graph is typically exploited and nodes' embeddings are iterati…

Hierarchical Attention Learning of Scene Flow in 3D Point Clouds

2020-10-12 · Guangming Wang, Xinrui Wu, Zhe Liu, Hesheng Wang

Scene flow represents the 3D motion of every point in the dynamic environments. Like the optical flow that represents the motion of pixels in 2D images, 3D motion representation of scene flow benefits many applications, …

Autonomous Driving Optical Flow Estimation Scene Flow Estimation

Demand Forecasting from Spatiotemporal Data with Graph Networks and Temporal-Guided Embedding

2019-05-26 · Doyup Lee, Suehun Jung, Yeongjae Cheon, Dongil Kim 외

Short-term demand forecasting models commonly combine convolutional and recurrent layers to extract complex spatiotemporal patterns in data. Long-term histories are also used to consider periodicity and seasonality patte…

Demand Forecasting Time Series Time Series Analysis

Learning random points from geometric graphs or orderings

2018-09-26 · Josep Diaz, Colin McDiarmid, Dieter Mitsche

Suppose that there is a family of $n$ random points $X_v$ for $v \in V$, independently and uniformly distributed in the square $\left[-\sqrt{n}/2,\sqrt{n}/2\right]^2$ of area $n$. We do not see these points, but learn ab…

Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation

2026-05-08 · Md Sazzad Hossen, Avimanyu Sahoo arxiv

Graphs with heterophily, where adjacent nodes carry different labels, are prevalent in real-world applications, from social networks to molecular interactions. However, existing spectral Graph Neural Network (GNN) approa…

Graph Classification Graph Neural Network Node Classification