메뉴 건너뛰기




Volumn 227, Issue , 2007, Pages 649-656

Fast and effective kernels for relational learning from texts

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; DYNAMIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; SUPPORT VECTOR MACHINES;

EID: 34547970260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273578     Document Type: Conference Paper
Times cited : (37)

References (18)
  • 4
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Seattle, Washington, USA
    • Charniak, E. (2000). A maximum-entropy-inspired parser. Proc. of the 1st NAACL. Seattle, Washington, USA.
    • (2000) Proc. of the 1st NAACL
    • Charniak, E.1
  • 5
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Morristown, NJ, USA
    • Collins, M., & Duffy, N. (2002). New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. Proceedings of ACL02. Morristown, NJ, USA.
    • (2002) Proceedings of ACL02
    • Collins, M.1    Duffy, N.2
  • 7
    • 1942485292 scopus 로고    scopus 로고
    • Kernel methods for relational learning
    • Washington, DC, USA
    • Cumby, C., & Roth, D. (2003). Kernel methods for relational learning. Proceedings of ICML 2003. Washington, DC, USA.
    • (2003) Proceedings of ICML 2003
    • Cumby, C.1    Roth, D.2
  • 9
    • 26944448224 scopus 로고    scopus 로고
    • Tutorial on statistical relational learning
    • Getoor, L. (2005). Tutorial on statistical relational learning. ILP (p. 415).
    • (2005) ILP , pp. 415
    • Getoor, L.1
  • 10
    • 17144429687 scopus 로고    scopus 로고
    • Feature space interpretation of SVMs with indefinite kernels
    • Haasdonk, B. (2005). Feature space interpretation of SVMs with indefinite kernels. IEEE Trans Pattern Anal Mach Intell, 27.
    • (2005) IEEE Trans Pattern Anal Mach Intell , vol.27
    • Haasdonk, B.1
  • 13
    • 34547975798 scopus 로고    scopus 로고
    • Efficient convolution kernels for dependency and constituent syntactic trees
    • Berlin, Germany
    • Moschitti, A. (2006). Efficient convolution kernels for dependency and constituent syntactic trees. Proceedings of ECML, Berlin, Germany.
    • (2006) Proceedings of ECML
    • Moschitti, A.1
  • 15
    • 0032268440 scopus 로고    scopus 로고
    • A language modeling approach to information retrieval
    • New York, NY, USA
    • Ponte, J. M., & Croft, W. B. (1998). A language modeling approach to information retrieval. Proceedings of SIGIR '98. New York, NY, USA.
    • (1998) Proceedings of SIGIR '98
    • Ponte, J.M.1    Croft, W.B.2
  • 16
    • 33745182869 scopus 로고    scopus 로고
    • Overview of TREC 2003
    • Voorhees, E. M. (2003). Overview of TREC 2003. TREC.
    • (2003) TREC
    • Voorhees, E.M.1
  • 17
    • 84860508612 scopus 로고    scopus 로고
    • Automatic learning of textual entailments with cross-pair similarities
    • Sydney, Australia
    • Zanzotto, F. M., & Moschitti, A. (2006). Automatic learning of textual entailments with cross-pair similarities. Proceedings of the 21st Coling and 44th ACL. Sydney, Australia.
    • (2006) Proceedings of the 21st Coling and 44th ACL
    • Zanzotto, F.M.1    Moschitti, A.2


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