{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T21:05:00Z","timestamp":1762981500275,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1942913","2007935"],"award-info":[{"award-number":["1942913","2007935"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1814595"],"award-info":[{"award-number":["1814595"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2118458"],"award-info":[{"award-number":["2118458"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N000141812838","N000142112966"],"award-info":[{"award-number":["N000141812838","N000142112966"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00778-022-00770-0","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T19:03:05Z","timestamp":1669662185000},"page":"737-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A generic framework for efficient computation of top-k diverse results"],"prefix":"10.1007","volume":"32","author":[{"given":"Md Mouinul","family":"Islam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Asadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Senjuti Basu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"key":"770_CR1","doi-asserted-by":"crossref","unstructured":"Abbar, S., et al.: Diverse near neighbor problem. In: SoCG pp. 207\u2013214 (2013)","DOI":"10.1145\/2462356.2462401"},{"key":"770_CR2","doi-asserted-by":"crossref","unstructured":"Abbar, S., et al.: Real-time recommendation of diverse related articles. WWW pp. 1\u201312 (2013)","DOI":"10.1145\/2488388.2488390"},{"key":"770_CR3","doi-asserted-by":"crossref","unstructured":"Abbassi, Z., et\u00a0al.: Diversity maximization under matroid constraints. In: SIGKDD (2013)","DOI":"10.1145\/2487575.2487636"},{"key":"770_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., et al.: Efficient indexes for diverse top-k range queries. PODS pp. 213\u2013227 (2020)","DOI":"10.1145\/3375395.3387667"},{"key":"770_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Diversifying search results. WSDM 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"},{"key":"770_CR6","doi-asserted-by":"crossref","unstructured":"Angel, A., Koudas, N.: Efficient diversity-aware search. SIGMOD pp. 781\u2013792 (2011)","DOI":"10.1145\/1989323.1989405"},{"key":"770_CR7","doi-asserted-by":"crossref","unstructured":"Balog, K., et\u00a0al.: Transparent, scrutable and explainable user models for personalized recommendation. SIGIR (2019)","DOI":"10.1145\/3331184.3331211"},{"key":"770_CR8","doi-asserted-by":"crossref","unstructured":"Bayer, R.: The universal b-tree for multidimensional indexing: General concepts. In: ICWCA, Springer, pp 198\u2013209 (1997)","DOI":"10.1007\/3-540-63343-X_48"},{"key":"770_CR9","doi-asserted-by":"crossref","unstructured":"Beckmann, N., et\u00a0al.: The r*-tree: An efficient and robust access method for points and rectangles. SIGMOD, pp 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"770_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"770_CR11","unstructured":"Berchtold, S., et\u00a0al.: The x-tree: An efficient and robust access method for points and rectangles. VLDB, pp 28\u201339 (1996)"},{"key":"770_CR12","doi-asserted-by":"crossref","unstructured":"Beygelzimer. A., et\u00a0al.: Cover trees for nearest neighbor. ICML (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"770_CR13","doi-asserted-by":"crossref","unstructured":"Cai, Z., et al.: Diversified spatial keyword search on rdf data. The VLDB Journal pp. 1\u201319 (2020)","DOI":"10.1007\/s00778-020-00610-z"},{"key":"770_CR14","doi-asserted-by":"crossref","unstructured":"Carbonell, J., et\u00a0al.: The use of mmr, diversity-based reranking for reordering documents and producing summaries. SIGIR pp. 335\u2013336 (1998)","DOI":"10.1145\/290941.291025"},{"key":"770_CR15","first-page":"426","volume":"97","author":"P Ciaccia","year":"1997","unstructured":"Ciaccia, P., et al.: M-tree: An efficient access method for similarity search in metric spaces. Vldb 97, 426\u2013435 (1997)","journal-title":"Vldb"},{"key":"770_CR16","unstructured":"Cormen, T.H., et\u00a0al.: Introduction to algorithms. MIT press (2009)"},{"issue":"4","key":"770_CR17","first-page":"49","volume":"32","author":"M Drosou","year":"2009","unstructured":"Drosou, M., et al.: Diversity over continuous data. IEEE Data Eng Bull 32(4), 49\u201356 (2009)","journal-title":"IEEE Data Eng Bull"},{"key":"770_CR18","doi-asserted-by":"crossref","unstructured":"Drosou, M., et\u00a0al.: Disc diversity: result diversification based on dissimilarity and coverage (2012). arXiv preprint arXiv:1208.3533","DOI":"10.14778\/2428536.2428538"},{"key":"770_CR19","doi-asserted-by":"crossref","unstructured":"Drosou, M., et\u00a0al.: Diverse set selection over dynamic data. TKDE 26 (2013)","DOI":"10.1109\/TKDE.2013.44"},{"key":"770_CR20","doi-asserted-by":"crossref","unstructured":"Esfandiari, M., et\u00a0al.: Multi-session diversity to improve user satisfaction in web applications. TWC, pp 1928\u20131936 (2021)","DOI":"10.1145\/3442381.3450046"},{"key":"770_CR21","doi-asserted-by":"crossref","unstructured":"Fraternali, P., et\u00a0al.: Top-k bounded diversification. SIGMOD, pp 421\u2013432 (2012)","DOI":"10.1145\/2213836.2213884"},{"key":"770_CR22","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., et\u00a0al.: An axiomatic approach for result diversification. WWW pp. 381\u2013390 (2009)","DOI":"10.1145\/1526709.1526761"},{"key":"770_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. TCS 38, 293\u2013306 (1985)","journal-title":"TCS"},{"key":"770_CR24","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching, ACM 14(2), (1984)","DOI":"10.1145\/971697.602266"},{"issue":"4","key":"770_CR25","first-page":"83","volume":"5","author":"J Han","year":"2011","unstructured":"Han, J., et al.: Data mining concepts and techniques third edition. Morgan Kaufmann Series 5(4), 83\u2013124 (2011)","journal-title":"Morgan Kaufmann Series"},{"key":"770_CR26","doi-asserted-by":"crossref","unstructured":"Hope, T., et\u00a0al.: Accelerating innovation through analogy mining. SIGKDD (2017)","DOI":"10.1145\/3097983.3098038"},{"issue":"2","key":"770_CR27","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/253262.253347","volume":"26","author":"N Katayama","year":"1997","unstructured":"Katayama, N., et al.: The sr-tree: An index structure for high-dimensional nearest neighbor queries. Sigmod Record 26(2), 369\u2013380 (1997)","journal-title":"Sigmod Record"},{"key":"770_CR28","unstructured":"Knuth, D.E.: The Art of Computer Programming, Fundamental Algorithms, vol\u00a01, 3rd edn. Addison Wesley Longman Publishing Co., Inc., (book) (1998)"},{"key":"770_CR29","doi-asserted-by":"crossref","unstructured":"Kumar, N., et\u00a0al.: What is a good nearest neighbors algorithm for finding similar patches in images? In: European conference on computer vision, Springer, pp 364\u2013378 (2008)","DOI":"10.1007\/978-3-540-88688-4_27"},{"key":"770_CR30","doi-asserted-by":"crossref","unstructured":"Mafrur, R., et\u00a0al.: Dive: diversifying view recommendation for visual data exploration. CIKM pp. 1123\u20131132 (2018)","DOI":"10.1145\/3269206.3271744"},{"key":"770_CR31","doi-asserted-by":"crossref","unstructured":"Maropaki, S., et\u00a0al.: Diversifying top-k point-of-interest queries via collective social reach. In: CIKM pp. 2149\u20132152 (2020)","DOI":"10.1145\/3340531.3412097"},{"key":"770_CR32","doi-asserted-by":"crossref","unstructured":"Mouratidis, K.: Geometric aspects and auxiliary features to top-k processing. In: MDM (2016)","DOI":"10.1109\/MDM.2016.79"},{"key":"770_CR33","doi-asserted-by":"crossref","unstructured":"Nikookar, S., et\u00a0al.: Diversifying recommendations on sequences of sets. VLDB Journal (2022)","DOI":"10.1007\/s00778-022-00740-6"},{"issue":"2","key":"770_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ejor.2020.07.053","volume":"289","author":"F Parre\u00f1o","year":"2021","unstructured":"Parre\u00f1o, F., et al.: Measuring diversity. a review and an empirical analysis. EJOR 289(2), 515\u2013532 (2021)","journal-title":"EJOR"},{"key":"770_CR35","doi-asserted-by":"crossref","unstructured":"Puthiya\u00a0Parambath, S.A., et\u00a0al.: A coverage-based approach to recommendation diversity on similarity graph. In: RecSys pp. 15\u201322 (2016)","DOI":"10.1145\/2959100.2959149"},{"key":"770_CR36","doi-asserted-by":"crossref","unstructured":"Qin, L., et\u00a0al.: Diversifying top-k results (2012). arXiv preprint arXiv:1208.0076","DOI":"10.14778\/2350229.2350233"},{"key":"770_CR37","doi-asserted-by":"crossref","unstructured":"Ren, P., et\u00a0al.: Leveraging contextual sentence relations for extractive summarization using a neural attention model. SIGIR, pp 95\u2013104 (2017)","DOI":"10.1145\/3077136.3080792"},{"key":"770_CR38","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The kdb-tree: a search structure for large multidimensional dynamic indexes. SIGMOD, pp 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"770_CR39","doi-asserted-by":"crossref","unstructured":"Singh, A., et\u00a0al.: Fairness of exposure in rankings. In: SIGKDD pp. 2219\u20132228 (2018)","DOI":"10.1145\/3219819.3220088"},{"key":"770_CR40","doi-asserted-by":"crossref","unstructured":"Tsai, C.H., et\u00a0al.: Beyond the ranked list: User-driven exploration and diversification of social recommendation. In: 23rd ICIUI pp 239\u2013250 (2018)","DOI":"10.1145\/3172944.3172959"},{"key":"770_CR41","doi-asserted-by":"crossref","unstructured":"Vargas, S., et\u00a0al.: Rank and relevance in novelty and diversity metrics for recommender systems. RecSys (2011)","DOI":"10.1145\/2043932.2043955"},{"key":"770_CR42","doi-asserted-by":"crossref","unstructured":"Vargas, S., et\u00a0al.: Coverage, redundancy and size-awareness in genre diversity for recommender systems. RecSys pp. 209\u2013216 (2014)","DOI":"10.1145\/2645710.2645743"},{"key":"770_CR43","doi-asserted-by":"crossref","unstructured":"Wang, D., et\u00a0al.: Sequence-based context-aware music recommendation. Information Retrieval Journal pp. 230\u2013252 (2018)","DOI":"10.1007\/s10791-017-9317-7"},{"key":"770_CR44","unstructured":"Wang, L., et\u00a0al.: Diversified and scalable service recommendation with accuracy guarantee. IEEE TCSS (2020)"},{"key":"770_CR45","unstructured":"White, D.A., et\u00a0al.: Similarity indexing with the ss-tree. In: ICDE pp. 516\u2013523 (1996)"},{"issue":"3","key":"770_CR46","first-page":"237","volume":"28","author":"W Wu","year":"2018","unstructured":"Wu, W., et al.: Personalizing recommendation diversity based on user personality. UMUAI 28(3), 237\u2013276 (2018)","journal-title":"UMUAI"},{"key":"770_CR47","doi-asserted-by":"crossref","unstructured":"Wu, Y., et\u00a0al.: Beyond greedy search: pruned exhaustive search for diversified result ranking. SIGIR, pp 99\u2013106 (2018b)","DOI":"10.1145\/3234944.3234967"},{"issue":"2","key":"770_CR48","first-page":"297","volume":"53","author":"Y Jg","year":"2017","unstructured":"Jg, Y., et al.: Recent advances in document summarization. KIS 53(2), 297\u2013336 (2017)","journal-title":"KIS"},{"key":"770_CR49","doi-asserted-by":"crossref","unstructured":"Yu, C., et\u00a0al.: It takes variety to make a world: diversification in recommender systems. EDBT pp. 368\u2013378 (2009)","DOI":"10.1145\/1516360.1516404"},{"key":"770_CR50","doi-asserted-by":"crossref","unstructured":"Zanitti, M., et\u00a0al.: A user-centric diversity by design recommender system for the movie application domain. In: Companion Proceedings of WWW, pp 1381\u20131389 (2018)","DOI":"10.1145\/3184558.3191580"},{"key":"770_CR51","doi-asserted-by":"crossref","unstructured":"Zehlike, M., et\u00a0al.: Fa* ir: A fair top-k ranking algorithm. In: CIKM pp. 1569\u20131578 (2017)","DOI":"10.1145\/3132847.3132938"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00770-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00770-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00770-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T02:03:16Z","timestamp":1685325796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00770-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00770-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"18 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}