Efficient computation of gapped substring kernels on large alphabets

MaRDI QIDQ3093300zbMATH OpenFDO

Authors Juho Rousu, John Shawe-Taylor

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v6/rousu05a.html

zbMATH Keywords

kernel methodssparse dynamic programmingstring kernelstext categorization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32) Dynamic programming (90C39)

Recommendations

• Fast string kernels using inexact matching for protein sequences
• Fast kernels for inexact string matching.
• Efficient geometric-based computation of the string subsequence kernel
• Versatile string kernels

Cited in

(8)

• Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering
• Efficient geometric-based computation of the string subsequence kernel
• Fast string kernels using inexact matching for protein sequences
• Discovering robust embeddings in (dis)similarity space for high-dimensional linguistic features
• Versatile string kernels
• Fast kernels for inexact string matching.
• Efficient List-Based Computation of the String Subsequence Kernel
• A sum-over-paths extension of edit distances accounting for all sequence alignments

This page was built for publication: Efficient computation of gapped substring kernels on large alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093300)