.png){kind=icon}
返回
Feature selection on node statistics based embedding of graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2012.03.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Representing a graph with a feature vector is a common way of making statistical machine learning algorithms applicable to the domain of graphs. Such a transition from graphs to vectors is known as graph embedding. A key issue in graph embedding is to select a proper set of features in order to make the vectorial representation of graphs as strong and discriminative as possible. In this article, we propose features that are constructed out of frequencies of node label representatives. We first build a large set of features and then select the most discriminative ones according to different ranking criteria and feature transformation algorithms. On different classification tasks, we experimentally show that only a small significant subset of these features is needed to achieve the same classification rates as competing to state-of-the-art methods. (c) 2012 Elsevier B.V. All rights reserved.
Keyword:
Structural pattern recognition
Graph embedding
Feature ranking
PCA
Graph classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
分享收藏Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks
OAAI
OAAI分享收藏Gene selection for cancer classification using support vector machines使用支持向量机进行癌症分类的基因选择.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容