Learning determinantal point processes

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 419-427

  Kulesza, Alex ^a   Taskar, Ben ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; INFERENCE ENGINES; RANDOM VARIABLES;

EXTRACTIVE SUMMARIZATIONS; LABELED TRAINING DATA; LEARNING FORMULATION; MARGINAL PROBABILITY; MULTI-DOCUMENT SUMMARIZATION; RANDOM MATRIX THEORY; REPULSIVE POTENTIALS; TRACTABLE ALGORITHMS;

IMPORTANCE SAMPLING;

EID: 80053152925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Borodin. Determinantal point processes, 2009. URL http://arxiv.org/ abs/0911.1153.
2. A. Borodin and A. Soshnikov. Janossy densities. I. Determinantal ensembles. Journal of Statistical Physics, 113(3):595-610, 2003. (Pubitemid 38104189)
3. J. Carbonell and J. Goldstein. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proc. SIGIR, 1998.
4. J. Clarke and M. Lapata. Global inference for sentence compression: An integer linear programming approach. JAIR, 31(1):399-429, 2008. (Pubitemid 351761992)
5. J. Conroy, J. Schlesinger, J. Goldstein, and D. Oleary. Left-brain/right-brain multi-document summarization. In Proc. DUC, 2004.
6. D. Daley and D. Vere-Jones. An introduction to the theory of point processes: volume I: elementary theory and methods. Springer, 2003.
7. H. Dang. Overview of DUC 2005. In Proc. DUC, 2005.
8. G. Erkan and D. Radev. LexRank: Graph-based lexical centrality as salience in text summarization. JAIR, 22(1):457-479, 2004. ISSN 1076-9757. (Pubitemid 41525893)
9. P. Genest, G. Lapalme, and M. YousεMonod. Hextac: the creation of a manual extractive run. In Proc. Text Analysis Conference, 2010.
10. J. Hough, M. Krishnapur, Y. Peres, and B. Virág. Determinantal processes and independence. Probability Surveys, 3:206-229, 2006.
11. C. Ko, J. Lee, and M. Queyranne. An exact algorithm for maximum entropy sampling. Operations Research, 43(4):684-691, 1995. ISSN 0030-364X.
12. A. Krause and C. Guestrin. A Note on the Budgeted Maximization of Submodular Functions. 2005.
13. A. Kulesza and B. Taskar. Structured determinantal point processes. In Proc. NIPS, 2010.
14. C. Lin. Rouge: A package for automatic evaluation of summaries. In Proc. WAS, 2004.
15. H. Lin and J. Bilmes. Multi-document summarization via budgeted maximization of submodular functions. In Proc. NAACL/HLT, 2010.
16. O. Macchi. The coincidence approach to stochastic point processes. Advances in Applied Probability, 7 (1):83-122, 1975.
17. A. Martins and N. Smith. Summarization with a joint model for sentence extraction and compression. In Proc. Workshop on ILP for NLP, 2009.