Welke, PascalPascalWelkeHorvath, TamasTamasHorvathWrobel, StefanStefanWrobel2022-03-132022-03-132016https://publica.fraunhofer.de/handle/publica/39591410.1007/978-3-319-39315-5_12We propose a new probabilistic graph kernel. It is defined by the set of frequent subtrees generated from a small random sample of spanning trees of the transaction graphs. In contrast to the ordinary frequent subgraph kernel it can be computed efficiently for any arbitrary graphs. Due to its probabilistic nature, the embedding function corresponding to our graph kernel is not always correct. Our empirical results on artificial and real-world chemical datasets, however, demonstrate that the graph kernel we propose is much faster than other frequent pattern based graph kernels, with only marginal loss in predictive accuracy.en005conference paper