Max-sum diversification, monotone submodular functions and dynamic updates

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2012, Pages 155-166

  Borodin, Allan ^a   Lee, Hyun Chul ^b   Ye, Yuli ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b LINKEDIN CORPORATION   (United States)

Author keywords

approximation algorithm; diversification; dynamic update; greedy algorithm; information retrieval; local search; matroids; ranking; submodular functions

Indexed keywords

DIVERSIFICATION; DYNAMIC UPDATE; GREEDY ALGORITHMS; LOCAL SEARCH; RANKING; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS; INFORMATION RETRIEVAL; MATRIX ALGEBRA; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 84862620887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213556.2213580     Document Type: Conference Paper

References (44)

1. R. Agrawal, S. Gollapudi, A. Halverson, and S. Ieong. Diversifying search results. In WSDM, pages 5-14, 2009.
2. N. Bansal, K. Jain, A. Kazeykina, and J. Naor. Approximation algorithms for diversified search ranking. In ICALP (2), pages 273-284, 2010.
3. C. Brandt, T. Joachims, Y. Yue, and J. Bank. Dynamic ranked retrieval. In WSDM, pages 247-256, 2011.
4. R. A. Brualdi. Comments on bases in dependence structures. Bulletin of the Australian Mathematical Society, 1(02):161-167, 1969.
5. G. Cǎ;linescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6):1740-1766, 2011.
6. J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '98, pages 335-336, New York, NY, USA, 1998. ACM.
7. B. Chandra and M. M. Halldórsson. Facility dispersion and remote subgraphs. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, pages 53-65, London, UK, 1996. Springer-Verlag.
8. B. Chandra and M. M. Halldórsson. Approximation algorithms for dispersion problems. J. Algorithms, 38(2):438-465, 2001. (Pubitemid 33668345)
9. H. Chen and D. R. Karger. Less is more: probabilistic models for retrieving fewer relevant documents. In SIGIR, pages 429-436, 2006.
10. E. Demidova, P. Fankhauser, X. Zhou, and W. Nejdl. Divq: diversification for keyword search over structured databases. In Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval, SIGIR '10, pages 331-338. ACM, 2010.
11. Z. Dou, S. Hu, K. Chen, R. Song, and J.-R. Wen. Multi-dimensional search result diversification. In WSDM, pages 475-484, 2011.
12. M. Drosou and E. Pitoura. Diversity over continuous data. IEEE Data Eng. Bull., 32(4):49-56, 2009.
13. M. Drosou and E. Pitoura. Search result diversification. SIGMOD Record, 39(1):41-47, 2010.
14. J. Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1:127-136, 1971.
15. E. Erkut. The discrete p-dispersion problem. European Journal of Operational Research, 46(1):48-60, May 1990.
16. E. Erkut and S. Neuman. Analytical models for locating undesirable facilities. European Journal of Operational Research, 40(3):275-291, June 1989.
17. S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In World Wide Web Conference Series, pages 381-390, 2009.
18. M. M. Halldórsson, K. Iwano, N. Katoh, and T. Tokuyama. Finding subsets maximizing minimum structures. In Symposium on Discrete Algorithms, pages 150-159, 1995.
19. P. Hansen and I. D. Moon. Dispersion facilities on a network. Presentation at the TIMS/ORSA Joint National Meeting, Washington, D.C., 1988.
20. R. Hassin, S. Rubinstein, and A. Tamir. Approximation algorithms for maximum dispersion. Oper. Res. Lett., 21(3):133-137, 1997. (Pubitemid 127420349)
21. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '03, pages 137-146, 2003.
22. S. Khanna, R. Motwani, M. Sudan, and U. V. Vazirani. On syntactic versus computational views of approximability. Electronic Colloquium on Computational Complexity (ECCC), 2(23), 1995.
23. M. J. Kuby. Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems. Geographical Analysis, 19(4):315-329, 1987.
24. H. Lin and J. Bilmes. Multi-document summarization via budgeted maximization of submodular functions. In HLT-NAACL, pages 912-920, 2010.
25. H. Lin and J. Bilmes. A class of submodular functions for document summarization. In North American chapter of the Association for Computational Linguistics/Human Language Technology Conference (NAACL/HLT-2011), Portland, OR, June 2011. (long paper).
26. H. Lin, J. Bilmes, and S. Xie. Graph-based submodular selection for extractive summarization. In Proc. IEEE Automatic Speech Recognition and Understanding (ASRU), Merano, Italy, December 2009.
27. Z. Liu, P. Sun, and Y. Chen. Structured search result differentiation. PVLDB, 2(1):313-324, 2009.
28. E. Minack, W. Siberski, and W. Nejdl. Incremental diversification for very large sets: a streaming-based approach. In SIGIR, pages 585-594, 2011.
29. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 1978.
30. F. Radlinski, R. Kleinberg, and T. Joachims. Learning diverse rankings with multi-armed bandits. In ICML, pages 784-791, 2008.
31. R. Rado. A note on independence functios. Proceedings of the London Mathematical Society, 7:300-320, 1957.
32. D. Rafiei, K. Bharat, and A. Shukla. Diversifying web search results. In WWW, pages 781-790, 2010.
33. S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Operations Research, 42(2):299-310, March-April 1994.
34. R. L. T. Santos, C. Macdonald, and I. Ounis. Intent-aware search result diversification. In SIGIR, pages 595-604, 2011.
35. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
36. A. Slivkins, F. Radlinski, and S. Gollapudi. Learning optimally diverse rankings over large document collections. In ICML, pages 983-990, 2010.
37. M. R. Vieira, H. L. Razente, M. C. N. Barioni, M. Hadjieleftheriou, D. Srivastava, C. T. Jr., and V. J. Tsotras. Divdb: A system for diversifying query results. PVLDB, 4(12):1395-1398, 2011.
38. M. R. Vieira, H. L. Razente, M. C. N. Barioni, M. Hadjieleftheriou, D. Srivastava, C. T. Jr., and V. J. Tsotras. On query result diversification. In ICDE, pages 1163-1174, 2011.
39. D. W. Wang and Y.-S. Kuo. A study on two geometric location problems. Inf. Process. Lett., 28:281-286, August 1988.
40. C. Yu, L. Lakshmanan, and S. Amer-Yahia. It takes variety to make a world: diversification in recommender systems. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT '09, pages 368-378, 2009.
41. Y. Yue and T. Joachims. Predicting diverse subsets using structural svms. In ICML, pages 1224-1231, 2008.
42. C. Zhai, W. W. Cohen, and J. D. Lafferty. Beyond independent relevance: methods and evaluation metrics for subtopic retrieval. In SIGIR, pages 10-17, 2003.
43. F. Zhao, X. Zhang, A. K. H. Tung, and G. Chen. Broad: Diversified keyword search in databases. PVLDB, 4(12):1355-1358, 2011.
44. X. Zhu, A. B. Goldberg, J. V. Gael, and D. Andrzejewski. Improving diversity in ranking using absorbing random walks. In HLT-NAACL, pages 97-104, 2007.