A mutual information kernel for sequences

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose a new kernel for strings which borrows ideas and techniques from information theory and data compression. This kernel can be used in combination with any kernel method, in particular Support Vector Machines for protein classification. By incorporating prior assumptions on the properties of the alphabet and using a Bayesian averaging framework, we compute the value of this kernel in linear time and space, benefiting from previous achievements proposed in the field of universal coding. Encouraging classification results are reported on a standard protein homology detection experiment.

Original languageEnglish
Title of host publication2004 IEEE International Joint Conference on Neural Networks - Proceedings
Pages1905-1910
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2004
Externally publishedYes
Event2004 IEEE International Joint Conference on Neural Networks - Proceedings - Budapest, Hungary
Duration: 25 Jul 200429 Jul 2004

Publication series

NameIEEE International Conference on Neural Networks - Conference Proceedings
Volume3
ISSN (Print)1098-7576

Conference

Conference2004 IEEE International Joint Conference on Neural Networks - Proceedings
Country/TerritoryHungary
CityBudapest
Period25/07/0429/07/04

Fingerprint

Dive into the research topics of 'A mutual information kernel for sequences'. Together they form a unique fingerprint.

Cite this