Efficient List-Based Computation of the String Subsequence Kernel

DOI10.1007/978-3-319-04921-2_11MaRDI QIDQ5404907zbMATH OpenOpenAlexFDO

Authors Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi

Publication date 31 March 2014

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04921-2_11

zbMATH Keywords

computational geometryrange querystring kernellayered range tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient geometric-based computation of the string subsequence kernel
• Efficient computation of gapped substring kernels on large alphabets
• Efficient Computation of Substring Equivalence Classes with Suffix Arrays
• Efficient computation of substring equivalence classes with suffix arrays
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings
• Faster subsequence recognition in compressed strings

Cited in

(2)

• 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

This page was built for publication: Efficient List-Based Computation of the String Subsequence Kernel

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