Efficient geometric-based computation of the string subsequence kernel

DOI10.1007/s10618-017-0545-7zbMath1411.68094arXiv1502.07776OpenAlexW2962745435MaRDI QIDQ1741246

Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07776

zbMATH Keywords

computational geometryrange querylayered range treerange sumstring subsequence kernel

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering
• Fractional cascading. I: A data structuring technique
• 10.1162/153244303322533197
• 10.1162/153244302760200687
• Efficient List-Based Computation of the String Subsequence Kernel

This page was built for publication: Efficient geometric-based computation of the string subsequence kernel