메뉴 건너뛰기




Volumn , Issue , 2011, Pages 124-133

A study on dependency tree kernels for automatic extraction of protein-protein interaction

Author keywords

[No Author keywords available]

Indexed keywords

EXTRACTION; FORESTRY; NATURAL LANGUAGE PROCESSING SYSTEMS; TREES (MATHEMATICS);

EID: 85084287330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (26)
  • 9
    • 4944228528 scopus 로고    scopus 로고
    • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
    • CW Hsu, CC Chang, and CJ Lin, 2003. A practical guide to support vector classification. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan.
    • (2003) A practical guide to support vector classification
    • Hsu, CW1    Chang, CC2    Lin, CJ3
  • 10
    • 0002714543 scopus 로고    scopus 로고
    • Making large-scale support vector machine learning practical
    • MIT Press, Cambridge, MA, USA
    • T Joachims. 1999. Making large-scale support vector machine learning practical. In Advances in kernel methods: support vector learning, pages 169-184. MIT Press, Cambridge, MA, USA.
    • (1999) Advances in kernel methods: support vector learning , pp. 169-184
    • Joachims, T1
  • 11
    • 77951201715 scopus 로고    scopus 로고
    • Walk-weighted subsequence kernels for protein-protein interaction extraction
    • S Kim, J Yoon, J Yang, and S Park. 2010. Walk-weighted subsequence kernels for protein-protein interaction extraction. BMC Bioinformatics, 11(1).
    • (2010) BMC Bioinformatics , vol.11 , Issue.1
    • Kim, S1    Yoon, J2    Yang, J3    Park, S4
  • 15
    • 33750333944 scopus 로고    scopus 로고
    • Efficient convolution kernels for dependency and constituent syntactic trees
    • Johannes Fürnkranz, Tobias Scheffer, and Myra Spiliopoulou, editors, pages Springer Berlin/Heidelberg
    • A Moschitti. 2006. Efficient convolution kernels for dependency and constituent syntactic trees. In Johannes Fürnkranz, Tobias Scheffer, and Myra Spiliopoulou, editors, Machine Learning: ECML 2006, volume 4212 of Lecture Notes in Computer Science, pages 318-329. Springer Berlin/Heidelberg.
    • (2006) Machine Learning: ECML 2006, volume 4212 of Lecture Notes in Computer Science , pp. 318-329
    • Moschitti, A1
  • 21
  • 22
    • 78049245506 scopus 로고    scopus 로고
    • A Comprehensive Benchmark of Kernel Methods to Extract Protein-Protein Interactions from Literature
    • July
    • D Tikk, P Thomas, P Palaga, J Hakenberg, and U Leser. 2010. A Comprehensive Benchmark of Kernel Methods to Extract Protein-Protein Interactions from Literature. PLoS Computational Biology, 6(7), July.
    • (2010) PLoS Computational Biology , vol.6 , Issue.7
    • Tikk, D1    Thomas, P2    Palaga, P3    Hakenberg, J4    Leser, U5
  • 25
    • 33646008548 scopus 로고    scopus 로고
    • Discovering relations between named entities from a large raw corpus using tree similarity-based clustering
    • Robert Dale, Kam-Fai Wong, Jian Su, and Oi Yee Kwong, editors, pages Springer Berlin/Heidelberg
    • M Zhang, J Su, D Wang, G Zhou, and CL Tan. 2005. Discovering relations between named entities from a large raw corpus using tree similarity-based clustering. In Robert Dale, Kam-Fai Wong, Jian Su, and Oi Yee Kwong, editors, Natural Language Processing IJC-NLP 2005, volume 3651 of Lecture Notes in Computer Science, pages 378-389. Springer Berlin/Heidelberg.
    • (2005) Natural Language Processing IJC-NLP 2005, volume 3651 of Lecture Notes in Computer Science , pp. 378-389
    • Zhang, M1    Su, J2    Wang, D3    Zhou, G4    Tan, CL5


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