Pairwise rational kernels obtained by automaton operations

A Roche-Lima, M Domaratzki, B Fristensky - … and Application of Automata …, 2014 - Springer
A Roche-Lima, M Domaratzki, B Fristensky
Implementation and Application of Automata: 19th International Conference …, 2014Springer
Abstract Pairwise Rational Kernels (PRKs) are the combination of pairwise kernels, which
handle similarities between two pairs of entities, and rational kernels, which are based on
finite-state transducer for manipulating sequence data. PRKs have been already used in
bioinformatics problems, such as metabolic network prediction, to reduce computational
costs in terms of storage and processing. In this paper, we propose new Pairwise Rational
Kernels based on automaton and transducer operations. In this case, we define new …
Abstract
Pairwise Rational Kernels (PRKs) are the combination of pairwise kernels, which handle similarities between two pairs of entities, and rational kernels, which are based on finite-state transducer for manipulating sequence data. PRKs have been already used in bioinformatics problems, such as metabolic network prediction, to reduce computational costs in terms of storage and processing.
In this paper, we propose new Pairwise Rational Kernels based on automaton and transducer operations. In this case, we define new operations over pairs of automata to obtain new rational kernels. We develop experiments using these new PRKs to predict metabolic networks. As a result, we obtain better accuracy and execution times when we compare them with previous kernels.
Springer
Showing the best result for this search. See all results