期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
卷 22, 期 1, 页码 48-56出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2008.04.006
关键词
Graph-based representation; Graph kernel; Dissimilarity space embedding; Pattern classification; Dimensionality reduction
Graphs are a convenient representation formalism for structured objects, but they suffer from the fact that only a few algorithms for graph classification and clustering exist. In this paper a new approach to graph classification by dissimilarity space embedding is proposed. This approach, which is in fact a new graph kernel, allows us to apply advanced classification tools while retaining the high representational power of graphs. The basic idea of the proposed graph kernel is to view the edit distances of a given graph g to a set of training graphs as a vectorial description of g. Once a graph has been transformed into a vector, different dimensionality reduction algorithms are applied such that redundancies are eliminated. To this reduced vectorial data representation any pattern classification algorithms available for feature vectors can be applied. Through various experiments it is shown that the proposed dissimilarity space embedding graph kernel outperforms conventional classification algorithms applied in the original graph domain. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据