Abstract is missing.
- Organizing Similarity Spaces Using Metric HullsMiriama Jánosová, David Prochazka, Vlastislav Dohnal. 3-16 [doi]
- Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Parallel FrameworkFabian Fier, Johann Christoph Freytag. 17-31 [doi]
- A Triangle Inequality for Cosine SimilarityErich Schubert. 32-44 [doi]
- A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self PruningFelix Borutta, Peer Kröger, Matthias Renz. 45-53 [doi]
- How Many Neighbours for Known-Item Search?Jakub Lokoc, Tomás Soucek. 54-65 [doi]
- On Generalizing Permutation-Based Representations for Approximate SearchLucia Vadicamo, Claudio Gennaro, Giuseppe Amato. 66-80 [doi]
- Data-Driven Learned Metric Index: An Unsupervised ApproachTerézia Slanináková, Matej Antol, Jaroslav OIha, Vojtech Kana, Vlastislav Dohnal. 81-94 [doi]
- Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query ProcessingMaximilian Hünemörder, Peer Kröger, Matthias Renz. 95-103 [doi]
- Similarity vs. Relevance: From Simple Searches to Complex DiscoveryTomás Skopal, David Bernhauer, Petr Skoda 0001, Jakub Klímek, Martin Necaský. 104-117 [doi]
- Non-parametric Semi-supervised Learning by Bayesian Label Distribution PropagationJonatan Møller Nuutinen Gøttcke, Arthur Zimek, Ricardo J. G. B. Campello. 118-132 [doi]
- Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+-TreesOmid Jafari, Preeti Maurya, Khandker Mushfiqul Islam, Parth Nagarkar. 133-147 [doi]
- Fairest Neighbors - Tradeoffs Between Metric QueriesMagnus Lie Hetland, Halvard Hummel. 148-156 [doi]
- Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding AlgorithmsMilos Savic 0001, Vladimir Kurbalija, Milos Radovanovic. 159-172 [doi]
- Structural Intrinsic DimensionalityStéphane Marchand-Maillet, Oscar Pedreira, Edgar Chávez. 173-185 [doi]
- Relationships Between Local Intrinsic Dimensionality and Tail EntropyJames Bailey 0001, Michael E. Houle, Xingjun Ma. 186-200 [doi]
- The Effect of Random Projection on Local Intrinsic DimensionalityMichael E. Houle, Ken-ichi Kawarabayashi. 201-214 [doi]
- Accelerating Spherical k-MeansErich Schubert, Andreas Lang 0002, Gloria Feher. 217-231 [doi]
- MESS: Manifold Embedding Motivated Super SamplingErik Thordsen, Erich Schubert. 232-246 [doi]
- Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior ProbabilitiesJonatan Møller Nuutinen Gøttcke, Arthur Zimek. 247-261 [doi]
- Similarity Search for an Extreme Application: Experience and ImplementationVladimir Mic, Tomás Racek, Ales Krenek, Pavel Zezula. 265-279 [doi]
- What Makes a Good Movie Recommendation? Feature Selection for Content-Based FilteringMaciej Gawinecki, Wojciech Szmyd, Urszula Zuchowicz, Marcin Walas. 280-294 [doi]
- Indexed Polygon Matching Under SimilaritiesFernando Luque-Suárez, Jorge L. López-López, Edgar Chávez. 295-306 [doi]
- Clustering Adverse Events of COVID-19 Vaccines Across the United StatesAhmed Askar, Andreas Züfle. 307-320 [doi]
- Metric Indexing for Graph Similarity SearchFranka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege. 323-336 [doi]
- The Minimum Edit Arborescence Problem and Its Use in Compressing Graph CollectionsLucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal. 337-351 [doi]
- Graph Embedding in Vector Spaces Using Matching-GraphsMathias Fuchs, Kaspar Riesen. 352-363 [doi]
- An A*-algorithm for the Unordered Tree Edit Distance with Custom CostsBenjamin Paaßen. 364-371 [doi]
- FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity SearchJakub Peschel, Michal Batko, Jakub Valcík, Jan Sedmidubský, Pavel Zezula. 372-383 [doi]
- Towards an Italian Healthcare Knowledge GraphMarco Postiglione. 387-394 [doi]
- Progressive Query-Driven Entity ResolutionLuca Zecchini. 395-401 [doi]
- Discovering Latent Information from Noisy Sources in the Cultural Heritage DomainFabrizio Scarrone. 402-408 [doi]