| 2021 | A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self Pruning. Felix Borutta, Peer Kröger, Matthias Renz |
| 2021 | A Triangle Inequality for Cosine Similarity. Erich Schubert |
| 2021 | Accelerating Spherical k-Means. Erich Schubert, Andreas Lang, Gloria Feher |
| 2021 | An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs. Benjamin Paaßen |
| 2021 | Clustering Adverse Events of COVID-19 Vaccines Across the United States. Ahmed Askar, Andreas Züfle |
| 2021 | Data-Driven Learned Metric Index: An Unsupervised Approach. Terézia Slanináková, Matej Antol, Jaroslav Olha, Vojtech Kana, Vlastislav Dohnal |
| 2021 | Discovering Latent Information from Noisy Sources in the Cultural Heritage Domain. Fabrizio Scarrone |
| 2021 | FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search. Jakub Peschel, Michal Batko, Jakub Valcík, Jan Sedmidubský, Pavel Zezula |
| 2021 | Fairest Neighbors - Tradeoffs Between Metric Queries. Magnus Lie Hetland, Halvard Hummel |
| 2021 | Graph Embedding in Vector Spaces Using Matching-Graphs. Mathias Fuchs, Kaspar Riesen |
| 2021 | Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior Probabilities. Jonatan Møller Nuutinen Gøttcke, Arthur Zimek |
| 2021 | How Many Neighbours for Known-Item Search? Jakub Lokoc, Tomás Soucek |
| 2021 | Indexed Polygon Matching Under Similarities. Fernando Luque-Suárez, Jorge L. López-López, Edgar Chávez |
| 2021 | Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding Algorithms. Milos Savic, Vladimir Kurbalija, Milos Radovanovic |
| 2021 | MESS: Manifold Embedding Motivated Super Sampling. Erik Thordsen, Erich Schubert |
| 2021 | Metric Indexing for Graph Similarity Search. Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege |
| 2021 | Non-parametric Semi-supervised Learning by Bayesian Label Distribution Propagation. Jonatan Møller Nuutinen Gøttcke, Arthur Zimek, Ricardo J. G. B. Campello |
| 2021 | On Generalizing Permutation-Based Representations for Approximate Search. Lucia Vadicamo, Claudio Gennaro, Giuseppe Amato |
| 2021 | Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+-Trees. Omid Jafari, Preeti Maurya, Khandker Mushfiqul Islam, Parth Nagarkar |
| 2021 | Organizing Similarity Spaces Using Metric Hulls. Miriama Jánosová, David Procházka, Vlastislav Dohnal |
| 2021 | Progressive Query-Driven Entity Resolution. Luca Zecchini |
| 2021 | Relationships Between Local Intrinsic Dimensionality and Tail Entropy. James Bailey, Michael E. Houle, Xingjun Ma |
| 2021 | Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Parallel Framework. Fabian Fier, Johann-Christoph Freytag |
| 2021 | Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings Nora Reyes, Richard Connor, Nils M. Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen |
| 2021 | Similarity Search for an Extreme Application: Experience and Implementation. Vladimir Mic, Tomás Racek, Ales Krenek, Pavel Zezula |
| 2021 | Similarity vs. Relevance: From Simple Searches to Complex Discovery. Tomás Skopal, David Bernhauer, Petr Skoda, Jakub Klímek, Martin Necaský |
| 2021 | Structural Intrinsic Dimensionality. Stéphane Marchand-Maillet, Oscar Pedreira, Edgar Chávez |
| 2021 | The Effect of Random Projection on Local Intrinsic Dimensionality. Michael E. Houle, Ken-ichi Kawarabayashi |
| 2021 | The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal |
| 2021 | Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing. Maximilian Hünemörder, Peer Kröger, Matthias Renz |
| 2021 | Towards an Italian Healthcare Knowledge Graph. Marco Postiglione |
| 2021 | What Makes a Good Movie Recommendation? Feature Selection for Content-Based Filtering. Maciej Gawinecki, Wojciech Szmyd, Urszula Zuchowicz, Marcin Walas |