论文信息 - String Kernels Based on Variable-Length-Don't-Care Patterns

String Kernels Based on Variable-Length-Don't-Care Patterns

We propose a new string kernel based on variable-length-don't-care patterns(VLDC patterns). A VLDC pattern is an element of (Σi¾? { i¾? })*, where Σis an alphabet and i¾? is the variable-length-don't-care symbol that matches any string in Σ*. The number of VLDC patterns matching a given string sof length nis O(22n). We present an O(n5 ) algorithm for computing the kernel value. We also propose variations of the kernel which modify the relative weights of each pattern. We evaluate our kernels using a support vector machine to classify spam data.

Hideo Bannai | Shunsuke Inenaga | Masayuki Takeda | Kohei Hatano | Kazuyuki Narisawa

[1] Nello Cristianini,et al. Classification using String Kernels , 2000 .

[2] Ayumi Shinohara,et al. Discovering Best Variable-Length-Don't-Care Patterns , 2002, Discovery Science.

[3] Mehryar Mohri,et al. Learning Languages with Rational Kernels , 2007, COLT.

[4] Hideo Bannai,et al. Unsupervised Spam Detection Based on String Alienness Measures , 2007, Discovery Science.

[5] Costas S. Iliopoulos,et al. Finding Patterns with Variable Length Gaps or Don't Cares , 2006, COCOON.

[6] Ayumi Shinohara,et al. Space-Economical Construction of Index Structures for All Suffixes of a String , 2002, MFCS.

[7] Patrícia Duarte de Lima Machado,et al. Unit Testing for CASL Architectural Specifications , 2002, MFCS.

[8] Mehryar Mohri,et al. Rational Kernels: Theory and Algorithms , 2004, J. Mach. Learn. Res..

[9] Bernhard E. Boser,et al. A training algorithm for optimal margin classifiers , 1992, COLT '92.

[10] Jason Weston,et al. Mismatch String Kernels for SVM Protein Classification , 2002, NIPS.

[11] Ayumi Shinohara,et al. The Minimum DAWG for All Suffixes of a String and Its Applications , 2002, CPM.

[12] Gonzalo Navarro,et al. Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching , 2003, J. Comput. Biol..