title: Graph classification by means of Lipschitz embedding.
abstract: In pattern recognition and related fields, graph-based representations offer a versatile alternative to the widely used feature vectors. Therefore, an emerging trend of representing objects by graphs can be observed. This trend is intensified by the development of novel approaches in graph-based machine learning, such as graph kernels or graph-embedding techniques. These procedures overcome a major drawback of graphs, which consists of a serious lack of algorithms for classification. This paper is inspired by the idea of representing graphs through dissimilarities and extends our previous work to the more general setting of Lipschitz embeddings. In an experimental evaluation, we empirically confirm that classifiers that rely on the original graph distances can be outperformed by a classification system using the Lipschitz embedded graphs.
authors.affiliation: Institute of Computer Science and Applied Mathematics, University of Bern, Bern, Switzerland. riesen@iam.unibe.ch
authors.forename: Kaspar
authors.initials: K
authors.lastname: Riesen
authors.forename: Horst
authors.initials: H
authors.lastname: Bunke