메뉴 건너뛰기




Volumn 1, Issue , 2014, Pages 839-849

Distant supervision for relation extraction with matrix completion

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; EXTRACTION;

EID: 84906923110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p14-1079     Document Type: Conference Paper
Times cited : (52)

References (28)
  • 5
  • 8
    • 0033290514 scopus 로고    scopus 로고
    • Constructing biological knowledge bases by extracting information from text sources
    • Mark Craven and Johan Kumlien. 1999. Constructing biological knowledge bases by extracting information from text sources. In ISMB, volume 1999, pages 77-86.
    • (1999) ISMB , vol.1999 , pp. 77-86
    • Craven, M.1    Kumlien, J.2
  • 9
    • 0034853839 scopus 로고    scopus 로고
    • A rank minimization heuristic with application to minimum order system approximation
    • IEEE
    • Maryam Fazel, Haitham Hindi, and Stephen P Boyd. 2001. A rank minimization heuristic with application to minimum order system approximation. In American Control Conference, 2001. Proceedings of the 2001, volume 6, pages 4734-4739. IEEE.
    • (2001) American Control Conference, 2001. Proceedings of the 2001 , vol.6 , pp. 4734-4739
    • Fazel, M.1    Hindi, H.2    Boyd, S.P.3
  • 11
    • 79952483985 scopus 로고    scopus 로고
    • Convergence of fixed-point continuation algorithms for matrix rank minimization
    • Donald Goldfarb and Shiqian Ma. 2011. Convergence of fixed-point continuation algorithms for matrix rank minimization. Foundations of Computational Mathematics, 11(2):183-210.
    • (2011) Foundations of Computational Mathematics , vol.11 , Issue.2 , pp. 183-210
    • Goldfarb, D.1    Ma, S.2
  • 16
    • 79957957723 scopus 로고    scopus 로고
    • Fixed point and bregman iterative methods for matrix rank minimization
    • Shiqian Ma, Donald Goldfarb, and Lifeng Chen. 2011. Fixed point and bregman iterative methods for matrix rank minimization. Mathematical Programming, 128(1-2):321-353.
    • (2011) Mathematical Programming , vol.128 , Issue.1-2 , pp. 321-353
    • Ma, S.1    Goldfarb, D.2    Chen, L.3


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