Efficient computation of gapped substring kernels on large alphabets (Q3093300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5957294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of gapped substring kernels on large alphabets |
scientific article; zbMATH DE number 5957294 |
Statements
12 October 2011
0 references
kernel methods
0 references
string kernels
0 references
text categorization
0 references
sparse dynamic programming
0 references
0.8334682583808899
0 references
0.8332274556159973
0 references
0.8163619041442871
0 references
0.8151832818984985
0 references
