A spectrum tree kernel (論文特集:データマイニングと統計数理)
暂无分享,去创建一个
Hiroshi Yasuda | Hisashi Kashima | Tetsuji Kuboyama | Kouichi Hirata | F Aoki Kinoshita Kiyoko | H. Yasuda | Tetsuji Kuboyama | Kouichi Hirata | H. Kashima | F. Kiyoko
[1] Nello Cristianini,et al. Kernel Methods for Pattern Analysis , 2003, ICTAI.
[2] Esko Ukkonen,et al. Two Algorithms for Approximate String Matching in Static Texts , 1991, MFCS.
[3] Kouichi Hirata,et al. The q-Gram Distance for Ordered Unlabeled Trees , 2005, Discovery Science.
[4] Michael Collins,et al. Convolution Kernels for Natural Language , 2001, NIPS.
[5] Esko Ukkonen,et al. Approximate String Matching with q-grams and Maximal Matches , 1992, Theor. Comput. Sci..
[6] Susumu Goto,et al. GLYCAN: The Database of Carbohydrate Structures , 2003 .
[7] Yoshihiro Yamanishi,et al. Extraction of leukemia specific glycan motifs in humans by computational glycomics. , 2005, Carbohydrate research.
[8] Eleazar Eskin,et al. The Spectrum Kernel: A String Kernel for SVM Protein Classification , 2001, Pacific Symposium on Biocomputing.
[9] Thomas Gärtner,et al. A survey of kernels for structured data , 2003, SKDD.
[10] Alexander J. Smola,et al. Fast Kernels for String and Tree Matching , 2002, NIPS.
[11] David Haussler,et al. Convolution kernels on discrete structures , 1999 .
[12] Hiroki Arimura,et al. Efficient Substructure Discovery from Large Semi-Structured Data , 2001, IEICE Trans. Inf. Syst..
[13] Hisashi Kashima,et al. Kernels for Semi-Structured Data , 2002, ICML.