{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:35:32Z","timestamp":1772908532138,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030609351","type":"print"},{"value":"9783030609368","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_11","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"140-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Some Branches May Bear Rotten Fruits: Diversity Browsing VP-Trees"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Jasbick","sequence":"first","affiliation":[]},{"given":"Lucio","family":"Santos","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"de Oliveira","sequence":"additional","affiliation":[]},{"given":"Marcos","family":"Bedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"C Aggarwal","year":"2015","unstructured":"Aggarwal, C.: Data Mining: The Textbook. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14142-8"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: ACM WSDM, pp. 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.: Searching in metric spaces. CSUR 33(3), 273\u2013321 (2001)","journal-title":"CSUR"},{"key":"11_CR4","unstructured":"Chen, L., Gao, Y., Song, X., Li, Z., Miao, X., Jensen, C.: Indexing metric spaces for exact similarity search. arXiv preprint arXiv:2005.03468 (2020)"},{"issue":"10","key":"11_CR5","first-page":"1058","volume":"10","author":"L Chen","year":"2017","unstructured":"Chen, L., Gao, Y., Zheng, B., Jensen, C., Yang, H., Yang, K.: Pivot-based metric indexing. PVLDB 10(10), 1058\u20131069 (2017)","journal-title":"PVLDB"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-24583-1_34","volume-title":"SPIRE","author":"V Costa","year":"2011","unstructured":"Costa, V., Santos, R., Maconald, C., Ounis, I.: Sparse spatial selection for novelty-based search result diversification. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 344\u2013355. Springer, Cham (2011). https:\/\/doi.org\/10.1007\/978-3-642-24583-1_34"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1089\/big.2016.0054","volume":"5","author":"M Drosou","year":"2017","unstructured":"Drosou, M., Jagadish, H., Pitoura, E., Stoyanovich, J.: Diversity in big data: a review. Big Data 5(2), 73\u201384 (2017)","journal-title":"Big Data"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699499","volume":"40","author":"M Drosou","year":"2015","unstructured":"Drosou, M., Pitoura, E.: Multiple radii disc diversity: result diversification based on dissimilarity and coverage. ACM TODS 40(1), 1\u201343 (2015)","journal-title":"ACM TODS"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-03625-5_9","volume-title":"Swarm Intelligence for Multi-objective Problems in Data Mining","author":"M Hetland","year":"2009","unstructured":"Hetland, M.: The basic principles of metric indexing. In: Coello, C.A.C., Dehuri, S., Ghosh, S. (eds.) Swarm Intelligence for Multi-objective Problems in Data Mining. LNCS, vol. 242, pp. 199\u2013232. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03625-5_9"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason, G., Samet, H.: Index-driven similarity search in metric spaces. TODS 28(4), 517\u2013580 (2003)","journal-title":"TODS"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-49214-7_2","volume-title":"Transaction on Large-Scale Data-and Knowledge-Centered System","author":"D Novak","year":"2016","unstructured":"Novak, D., Zezula, P.: PPP-codes for large-scale similarity searching. In: Hameurlain, A., K\u00fcng, J., Wagner, R., Decker, H., Lhotska, L., Link, S. (eds.) Transaction on Large-Scale Data-and Knowledge-Centered System. LNCS, vol. 9510, pp. 61\u201387. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-662-49214-7_2"},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21257-9","volume-title":"Operators for Similarity Search - Semantics, Techniques and Usage Scenarios","author":"D Padmanabhan","year":"2015","unstructured":"Padmanabhan, D., Deshpande, P.: Operators for Similarity Search - Semantics, Techniques and Usage Scenarios. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21257-9"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s00453-012-9638-2","volume":"66","author":"V Pestov","year":"2013","unstructured":"Pestov, V.: Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions. Algorithmica 66(2), 310\u2013328 (2013)","journal-title":"Algorithmica"},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1016\/j.cor.2004.09.033","volume":"33","author":"D Pisinger","year":"2006","unstructured":"Pisinger, D.: Upper bounds and exact algorithms for p-dispersion problems. Comput. Oper. Res. 33(5), 1380\u20131398 (2006)","journal-title":"Comput. Oper. Res."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Santos, L., Blanco, G., Oliveira, D., Traina, A., Traina Jr., C., Bedo, M.: Exploring diversified similarity with kundaha. In: ACM CIKM, pp. 1903\u20131906 (2018)","DOI":"10.1145\/3269206.3269220"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Santos, L., Oliveira, W., Ferreira, M., Traina, A., Traina Jr., C.: Parameter-free and domain-independent similarity search with diversity. In: SSDBM, pp. 1\u201312 (2013)","DOI":"10.1145\/2484838.2484854"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina Jr","year":"2007","unstructured":"Traina Jr., C., Santos, R., Traina, A., Vieira, M., Faloutsos, C.: The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4), 483\u2013505 (2007)","journal-title":"VLDB J."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Vieira, M., et al.: On query result diversification. In: IEEE ICDE, pp. 1163\u20131174. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"11_CR19","unstructured":"Yianilos, P.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM-SIAM SDA, pp. 311\u2013321. SIAM (1993)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-016-0990-4","volume":"51","author":"K Zheng","year":"2016","unstructured":"Zheng, K., Wang, H., Qi, Z., Li, J., Gao, H.: A survey of query result diversification. Knowl. Inf. Syst. 51(1), 1\u201336 (2016). https:\/\/doi.org\/10.1007\/s10115-016-0990-4","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:42:54Z","timestamp":1710250974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}