메뉴 건너뛰기




Volumn 1, Issue , 2013, Pages 196-206

Fast and robust compressive summarization with dual decomposition and multi-task learning

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING;

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

References (47)
  • 2
    • 0010012348 scopus 로고
    • Machine-made index for technical literature-an experiment
    • P. B. Baxendale. 1958. Machine-made index for technical literature-an experiment. IBM Journal of Research Development, 2(4):354-361.
    • (1958) IBM Journal of Research Development , vol.2 , Issue.4 , pp. 354-361
    • Baxendale, P.B.1
  • 5
    • 0032270694 scopus 로고    scopus 로고
    • The use of MMR, diversity-based reranking for reordering documents and producing summaries
    • J. Carbonell and J. Goldstein. 1998. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In SIGIR.
    • (1998) SIGIR
    • Carbonell, J.1    Goldstein, J.2
  • 8
    • 44449150380 scopus 로고    scopus 로고
    • Global inference for sentence compression an integer linear programming approach
    • J. Clarke and M. Lapata. 2008. Global Inference for Sentence Compression An Integer Linear Programming Approach. Journal of Artificial Intelligence Research, 31:399-429.
    • (2008) Journal of Artificial Intelligence Research , vol.31 , pp. 399-429
    • Clarke, J.1    Lapata, M.2
  • 9
    • 77956311551 scopus 로고    scopus 로고
    • Sentence compression beyond word deletion
    • T. Cohn and M. Lapata. 2008. Sentence compression beyond word deletion. In Proc. COLING.
    • (2008) Proc. COLING
    • Cohn, T.1    Lapata, M.2
  • 13
    • 84945708920 scopus 로고
    • New methods in automatic extracting
    • H. P. Edmundson. 1969. New methods in automatic extracting. Journal of the ACM, 16(2):264-285.
    • (1969) Journal of the ACM , vol.16 , Issue.2 , pp. 264-285
    • Edmundson, H.P.1
  • 19
    • 10644277499 scopus 로고    scopus 로고
    • Statistics-based summarization-step one: Sentence compression
    • K. Knight and D. Marcu. 2000. Statistics-based summarization-step one: Sentence compression. In AAAI/IAAI.
    • (2000) AAAI/IAAI
    • Knight, K.1    Marcu, D.2
  • 23
    • 84886074716 scopus 로고    scopus 로고
    • Learning mixtures of submodular shells with application to document summarization
    • H. Lin and J. Bilmes. 2012. Learning mixtures of submodular shells with application to document summarization. In Proc. of Uncertainty in Artificial Intelligence.
    • (2012) Proc. of Uncertainty in Artificial Intelligence
    • Lin, H.1    Bilmes, J.2
  • 25
    • 26944501715 scopus 로고    scopus 로고
    • Rouge: A package for automatic evaluation of summaries
    • Stan Szpakowicz Marie-Francine Moens, editor, Barcelona, Spain, July
    • Chin-Yew Lin. 2004. Rouge: A package for automatic evaluation of summaries. In Stan Szpakowicz Marie-Francine Moens, editor, Text Summarization Branches Out: Proceedings of the ACL-04 Workshop, pages 74-81, Barcelona, Spain, July.
    • (2004) Text Summarization Branches Out: Proceedings of the ACL-04 Workshop , pp. 74-81
    • Lin, C.1
  • 26
    • 0000880768 scopus 로고
    • The automatic creation of literature abstracts
    • H. P. Luhn. 1958. The automatic creation of literature abstracts. IBM Journal of Research Development, 2(2):159-165.
    • (1958) IBM Journal of Research Development , vol.2 , Issue.2 , pp. 159-165
    • Luhn, H.P.1
  • 32
    • 70349195158 scopus 로고    scopus 로고
    • A study of global inference algorithms in multi-document summarization
    • R. McDonald. 2007. A study of global inference algorithms in multi-document summarization. In ECIR.
    • (2007) ECIR
    • McDonald, R.1
  • 33
    • 85013202438 scopus 로고    scopus 로고
    • Evaluating content selection in summarization: The pyramid method
    • A. Nenkova and R. Passonneau. 2004. Evaluating content selection in summarization: The pyramid method. In Proceedings of NAACL, pages 145-152.
    • (2004) Proceedings of NAACL , pp. 145-152
    • Nenkova, A.1    Passonneau, R.2
  • 34
    • 0000859664 scopus 로고
    • An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
    • Panos M. Pardalos and Naina Kovoor. 1990. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Mathematical Programming, 46(1):321-328.
    • (1990) Mathematical Programming , vol.46 , Issue.1 , pp. 321-328
    • Pardalos, P.M.1    Kovoor, N.2
  • 35
    • 0012982009 scopus 로고    scopus 로고
    • Centroid-based summarization of multiple documents: Sentence extraction, utility-based evaluation, and user studies
    • D. R. Radev, H. Jing, and M. Budzikowska. 2000. Centroid-based summarization of multiple documents: sentence extraction, utility-based evaluation, and user studies. In the NAACL-ANLP Workshop on Automatic Summarization.
    • (2000) The NAACL-ANLP Workshop on Automatic Summarization
    • Radev, D.R.1    Jing, H.2    Budzikowska, M.3
  • 36
    • 84875138356 scopus 로고    scopus 로고
    • A tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing
    • A. M. Rush and M. Collins. 2012. A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing. Journal of Artificial Intelligence Research, 45:305-362.
    • (2012) Journal of Artificial Intelligence Research , vol.45 , pp. 305-362
    • Rush, A.M.1    Collins, M.2
  • 47
    • 84907354368 scopus 로고    scopus 로고
    • Sentence compression as a component of a multidocument summarization system
    • D. Zajic, B. Dorr, J. Lin, and R. Schwartz. 2006. Sentence compression as a component of a multidocument summarization system. In the ACL DUC Workshop.
    • (2006) The ACL DUC Workshop
    • Zajic, D.1    Dorr, B.2    Lin, J.3    Schwartz, R.4


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