메뉴 건너뛰기




Volumn , Issue , 2007, Pages 125-128

Subtree mining for relation extraction from Wikipedia

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS;

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

References (10)
  • 3
    • 36349000646 scopus 로고    scopus 로고
    • Extracting relations from text: From word sequences to dependency paths
    • Anne Kao and Steve Poteet, editors
    • R.C. Bunescu and R.J. Mooney. 2006. Extracting relations from text: From word sequences to dependency paths. In Anne Kao and Steve Poteet, editors, Text Mining and Natural Language Processing.
    • (2006) Text Mining and Natural Language Processing
    • Bunescu, R.C.1    Mooney, R.J.2
  • 5
    • 84858373635 scopus 로고    scopus 로고
    • Integrating probabilistic extraction models and data mining to discover relations and patterns in text
    • A. Culotta, A. McCallum, and J. Betz. 2006. Integrating probabilistic extraction models and data mining to discover relations and patterns in text. In Proceedings of the HLT-NAACL-2006.
    • (2006) Proceedings of the HLT-NAACL-2006
    • Culotta, A.1    McCallum, A.2    Betz, J.3
  • 6
    • 0002714543 scopus 로고    scopus 로고
    • Making large-scale svm learning practical
    • B. Schölkopf, C. Burges, and A. Smola, editors, MIT-Press
    • T. Joachims. 1999. Making large-scale svm learning practical. In B. Schölkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods - Support Vector Learning. MIT-Press.
    • (1999) Advances in Kernel Methods - Support Vector Learning
    • Joachims, T.1
  • 9
    • 84978127045 scopus 로고    scopus 로고
    • Learning surface text patterns for a question answering system
    • D. Ravichandran and E. Hovy. 2002. Learning surface text patterns for a question answering system. In Proceedings of the ACL-2002, pages 41-47.
    • (2002) Proceedings of the ACL-2002 , pp. 41-47
    • Ravichandran, D.1    Hovy, E.2
  • 10
    • 0242709382 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest
    • M.J. Zaki. 2002. Efficiently mining frequent trees in a forest. In Proceedings of 8th ACM SIGKDD.
    • (2002) Proceedings of 8th ACM SIGKDD
    • Zaki, M.J.1


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