메뉴 건너뛰기




Volumn 22, Issue 2, 2007, Pages 140-147

A spectrum tree kernel

Author keywords

Glycans; Kernel methods; Spectrum kernels; Structured data; Tree kernels

Indexed keywords


EID: 34247483138     PISSN: 13460714     EISSN: 13468030     Source Type: Journal    
DOI: 10.1527/tjsai.22.140     Document Type: Article
Times cited : (14)

References (17)
  • 4
    • 4444231365 scopus 로고    scopus 로고
    • A survey of kernels for structured data
    • T. Gärtner: A survey of kernels for structured data, STGKDD Explorations 5, 49-58, 2003.
    • (2003) STGKDD Explorations , vol.5 , pp. 49-58
    • Gärtner, T.1
  • 9
    • 84988278426 scopus 로고
    • Two algorithms for approximate string matching in static ltexts
    • Proc. MFCS'91
    • P. Jokinen, and E. Ukkonen: Two algorithms for approximate string matching in static ltexts, Proc. MFCS'91, LNCS 520, 240-248, 1991.
    • (1991) LNCS , vol.520 , pp. 240-248
    • Jokinen, P.1    Ukkonen, E.2
  • 10
    • 34247528351 scopus 로고    scopus 로고
    • II. Kashima, and T. Koyanagi: Kernels for semi-structured data. ICML 02, 291-298, 2002.
    • II. Kashima, and T. Koyanagi: Kernels for semi-structured data. ICML 02, 291-298, 2002.
  • 11
    • 34247468680 scopus 로고    scopus 로고
    • A q-gram based distance measure for ordered labeled trees
    • T. Kuboyama, K. Hirata., N. Ohkura, and M. Harao: A q-gram based distance measure for ordered labeled trees, Proc. LLLL'06, 77-83, 2006.
    • (2006) Proc. LLLL'06 , pp. 77-83
    • Kuboyama, T.1    Hirata, K.2    Ohkura, N.3    Harao, M.4
  • 12
    • 0036358995 scopus 로고    scopus 로고
    • The spectrum kernel: A siring kernel for SVM protein classification
    • C. S. Leslie, E. Eskin, and W. S. Noble: The spectrum kernel: A siring kernel for SVM protein classification, Proc. PSB'02, 566 575, 2002.
    • (2002) Proc. PSB'02 , pp. 566-575
    • Leslie, C.S.1    Eskin, E.2    Noble, W.S.3
  • 13
    • 33745315005 scopus 로고    scopus 로고
    • The q-gram distance for ordered, unlabeled trees
    • Proc. DS'00
    • N. Ohkura, K. Hirata, T. Kuboyama, and M. Harao: The q-gram distance for ordered, unlabeled trees, Proc. DS'00, LNAI 3735, 189-202, 2005.
    • (2005) LNAI , vol.3735 , pp. 189-202
    • Ohkura, N.1    Hirata, K.2    Kuboyama, T.3    Harao, M.4
  • 16
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • E. Ukkonen: Approximate string-matching with q-grams and maximal matches, Theoret. Comput. Sci. 92, 191-211, 1993.
    • (1993) Theoret. Comput. Sci , vol.92 , pp. 191-211
    • Ukkonen, E.1
  • 17
    • 84898962121 scopus 로고    scopus 로고
    • Fast kernels for string and tree matching
    • S. V. N. Vishwanathan, and A. J. Smoka: Fast kernels for string and tree matching, Proc. NIPS 2002, 569-576, 2002.
    • (2002) Proc. NIPS 2002 , pp. 569-576
    • Vishwanathan, S.V.N.1    Smoka, A.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.