.png){kind=icon}
返回
Graph classification based on skeleton and component features
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2021.107301.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most existing popular methods for learning graph embedding only consider fixed-order global structural features but lack hierarchical representation for structures. To address this weakness, we propose a novel graph embedding algorithm named GraphCSC that realizes classification leveraging skeleton information from anonymous random walks with fixed-order length, and component information derived from subgraphs with different sizes. Two graphs are similar if their skeletons and components are both similar. Thus in our model, we integrate both of them together into embeddings as graph homogeneity characterization. We demonstrate our model on different datasets in comparison with a comprehensive list of up-to-date state-of-the-art baselines, and experiments show that our work is superior in real-world graph classification tasks. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Graph representation
Graph classification
Feature learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容