Rational kernels: theory and algorithms
From MaRDI portal
Recommendations
Cited in
(27)- Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering
- Generalization bounds for learning weighted automata
- Efficient geometric-based computation of the string subsequence kernel
- A review on distance based time series classification
- Component-based discriminative classification for hidden Markov models
- Speech recognition by composition of weighted finite automata
- Factor and Subsequence Kernels and Signatures of Rational Languages
- Learning weighted automata
- Large-scale training of SVMs with automata kernels
- Pairwise rational kernels obtained by automaton operations
- A dual coordinate descent algorithm for SVMs combined with rational kernels
- 3-Way Composition of Weighted Finite-State Transducers
- Versatile string kernels
- Kernels for sequentially ordered data
- Positive definite rational kernels.
- Learning from uncertain data.
- Kernel approximation methods for speech recognition
- Kernels, truth and satisfaction
- Learning Languages with Rational Kernels
- Learning with Kernels and Logical Representations
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS
- Cross-moments computation for stochastic context-free grammars
- Optimal approximate minimization of one-letter weighted finite automata
- Max-sliced Wasserstein concentration and uniform ratio bounds of empirical measures on RKHS
- A kernel trick for sequences applied to text-independent speaker verification systems
- Kernel methods for learning languages
- Learning state machine-based string edit kernels
This page was built for publication: Rational kernels: theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093213)
