Search Results for author:
Found 2 papers, 0 papers with code
Efficient multivariate sequence classification
Typical kernel functions for sequences in these domains (e. g., bag-of-words, mismatch, or subsequence kernels) are restricted to {\em discrete univariate} (i. e. one-dimensional) string data, such as sequences of words in the text analysis, codeword sequences in the image analysis, or nucleotide or amino acid sequences in the DNA and protein sequence analysis.
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
