.png){kind=icon}
返回
Graph embedding in vector spaces by node attribute statistics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2012.01.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graph embedding into vector spaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous node attributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases of graphs. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Structural pattern recognition
Graph embedding
Data clustering
Graph classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
A graph distance metric combining maximum common subgraph and minimum common supergraph结合最大公共子图和最小公共超图的图距离度量
PREAI
分享收藏
Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏分享收藏分享收藏
查看更多内容