String Kernels based on variable-length-don't-care patterns

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

研究成果: Conference contribution

抄録

We propose a new string kernel based on variable-length-don't-care patterns (VLDC patterns). A VLDC pattern is an element of (∑{∈})*, where ∑ is an alphabet and is the variable-length-don't-care symbol that matches any string in ∑ *. The number of VLDC patterns matching a given string s of length n is O(22n ). We present an O(n 5 ) 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.

本文言語English
ホスト出版物のタイトルDiscovery Science - 11th International Conference, DS 2008, Proceedings
出版社Springer Verlag
ページ308-318
ページ数11
ISBN(印刷版)3540884106, 9783540884101
DOI
出版ステータスPublished - 2008
イベント11th International Conference on Discovery Science, DS 2008 - Budapest, Hungary
継続期間: 2008 10月 132008 10月 16

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5255 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other11th International Conference on Discovery Science, DS 2008
国/地域Hungary
CityBudapest
Period08/10/1308/10/16

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「String Kernels based on variable-length-don't-care patterns」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル