[18] F. M. Harper and J. A. Konstan. The MovieLens Datasets: History and Context. 5(4), dec 2015.
[19] P. Indyk, S. Mahabadi, S. O. Gharan, and A. Rezaei. Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'20), pages 1675-1694. SIAM, 2020.
[20] P. Indyk, S. Mahabadi, M. Mahdian, and V. S. Mirrokni. Composable core-sets for Diversity and Coverage Maximization. In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 100–108, 2014.
[21] A. Jain, P. Sarda, and J. R. Haritsa. Providing Diversity in K-Nearest Neighbor Query Results. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 404–413. Springer, 2004.
[22] B. Kim, H. Kim, and G. Kim. Abstractive Summarization of Reddit Posts with Multi-level Memory Networks. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), Minneapolis, Minnesota, June 2019. Association for Computational Linguistics.
[23] Y. Liu, M. Ott, N. guoyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, and V. Stoyanov. RoBERTa: A Robustly Optimized BERT Pretraining Approach. arXiv preprint arXiv:1907.11692, 2019.
[24] S. Mahabadi, P. Indyk, S. O. Gharan, and A. Rezaei. Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. In International Conference on Machine Learning (ICML'19), pages 4254–4263. PMLR, 2019.
[25] S. Mahabadi and S. Narayanan. Improved diversity maximization algorithms for matching and pseudoforest. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2023.
[26] S. Mahabadi and T.-D. Vuong. Composable coresets for constrained determinant maximization and beyond. arXiv preprint arXiv:2211.00289, 2022.
[27] V. Mirrokni and M. Zadimoghaddam. Randomized Composable Core-sets for Distributed Submodular Maximization. In Proceedings of the forty-seventh annual ACM Symposium on Theory of Computing (STOC'15), pages 153–162, 2015.
[28] Z. Moumoulidou, A. Mc Gregor, and A. Meliou. Diverse Data Selection under Fairness Constraints. arXiv preprint arXiv:2010.09141, 2020.
[29] J. Ni, G. Hernandez Abrego, N. Constant, J. Ma, K. Hall, D. Cer, and Y. Yang. SentenceT5: Scalable Sentence Encoders from Pre-trained Text-to-Text Models. In Findings of the Association for Computational Linguistics: ACL 2022, Dublin, Ireland, May 2022. Association for Computational Linguistics.
[30] A. Nikolov. Randomized Rounding for the Largest Simplex Problem. In Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (STOC'15), pages 861-870, 2015.
[31] A. Nikolov and M. Singh. Maximizing Determinants under Partition Constraints. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (STOC'16), pages 192-201, 2016.
[32] J. Pennington, R. Socher, and C. D. Manning. GloVe: Global Vectors for Word Representation. In Empirical Methods in Natural Language Processing (EMNLP), pages 1532–1543, 2014.
[33] S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Facility dispersion problems: Heuristics and special cases. In Workshop on Algorithms and Data Structures, pages 355-366. Springer, 1991.
[34] N. Reimers and I. Gurevych. Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP). Association for Computational Linguistics, 11 2019.