.png){kind=icon}
返回
Graph Classification via Heat Diffusion on Simplicial Complexes
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3050662.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the graph classification problem in vertex-labeled graphs. Our main goal is to classify graphs by comparing their higher-order structures thanks to heat diffusion on their simplices. We first represent vertex-labeled graphs as simplex-weighted super-graphs. We then define the diffusion Frechet function over their simplices to encode the higher-order network topology and finally reach our goal by combining the function values with machine learning algorithms. Our experiments on real-world bioinformatics networks show that using diffusion Frechet function on simplices is promising in graph classification and more effective than the baseline methods. To the best of our knowledge, this is the first study in the literature using heat diffusion on higher-dimensional simplices in a graph mining problem. We believe that our method can be extended to different graph mining domains, beyond the graph classification problem.
Keyword:
Graph classification
diffusion Frechet function
simplicial complex
simplicial Laplacian operator
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏分享收藏
查看更多内容