Distribution kernels based on moments of counts

10 years 27 days ago
Distribution kernels based on moments of counts
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational kernels, to extend kernel methods to the analysis of such variable-length sequences or more generally weighted automata. These kernels are efficient to compute and have been successfully used in applications such as spoken-dialog classification using Support Vector Machines. However, the rational kernels previously introduced do not fully encompass distributions over alternate sequences. Prior similarity measures between two weighted automata are based only on the expected counts of cooccurring subsequences and ignore similarities (or dissimilarities) in higher order moments of the distributions of these counts. In this paper, we introduce a new family of rational kernels, moment kernels, that precisely exploit this additional information. These kernels are distribution kernels based on moments of counts of stri...
Corinna Cortes, Mehryar Mohri
Added 17 Nov 2009
Updated 17 Nov 2009
Type Conference
Year 2004
Where ICML
Authors Corinna Cortes, Mehryar Mohri
Comments (0)