Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th SISAP 2021: Dortmund, Germany
- Nora Reyes
, Richard Connor, Nils M. Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen:
Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings. Lecture Notes in Computer Science 13058, Springer 2021, ISBN 978-3-030-89656-0
Similarity Search and Retrieval
- Miriama Jánosová, David Procházka, Vlastislav Dohnal:
Organizing Similarity Spaces Using Metric Hulls. 3-16 - Fabian Fier, Johann-Christoph Freytag:
Scaling Up Set Similarity Joins Using a Cost-Based Distributed-Parallel Framework. 17-31 - Erich Schubert:
A Triangle Inequality for Cosine Similarity. 32-44 - Felix Borutta, Peer Kröger, Matthias Renz:
A Cost Model for Reverse Nearest Neighbor Query Processing on R-Trees Using Self Pruning. 45-53 - Jakub Lokoc, Tomás Soucek:
How Many Neighbours for Known-Item Search? 54-65 - Lucia Vadicamo, Claudio Gennaro, Giuseppe Amato:
On Generalizing Permutation-Based Representations for Approximate Search. 66-80 - Terézia Slanináková, Matej Antol, Jaroslav Olha, Vojtech Kana, Vlastislav Dohnal:
Data-Driven Learned Metric Index: An Unsupervised Approach. 81-94 - Maximilian Hünemörder, Peer Kröger, Matthias Renz:
Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing. 95-103 - Tomás Skopal, David Bernhauer, Petr Skoda, Jakub Klímek, Martin Necaský:
Similarity vs. Relevance: From Simple Searches to Complex Discovery. 104-117 - Jonatan Møller Nuutinen Gøttcke, Arthur Zimek, Ricardo J. G. B. Campello:
Non-parametric Semi-supervised Learning by Bayesian Label Distribution Propagation. 118-132 - Omid Jafari, Preeti Maurya, Khandker Mushfiqul Islam, Parth Nagarkar:
Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+-Trees. 133-147 - Magnus Lie Hetland, Halvard Hummel:
Fairest Neighbors - Tradeoffs Between Metric Queries. 148-156
Intrinsic Dimensionality
- Milos Savic, Vladimir Kurbalija, Milos Radovanovic:
Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding Algorithms. 159-172 - Stéphane Marchand-Maillet, Oscar Pedreira, Edgar Chávez:
Structural Intrinsic Dimensionality. 173-185 - James Bailey, Michael E. Houle, Xingjun Ma:
Relationships Between Local Intrinsic Dimensionality and Tail Entropy. 186-200 - Michael E. Houle, Ken-ichi Kawarabayashi:
The Effect of Random Projection on Local Intrinsic Dimensionality. 201-214
Clustering and Classification
- Erich Schubert, Andreas Lang, Gloria Feher:
Accelerating Spherical k-Means. 217-231 - Erik Thordsen, Erich Schubert:
MESS: Manifold Embedding Motivated Super Sampling. 232-246 - Jonatan Møller Nuutinen Gøttcke, Arthur Zimek:
Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior Probabilities. 247-261
Applications of Similarity Search
- Vladimir Mic, Tomás Racek, Ales Krenek, Pavel Zezula:
Similarity Search for an Extreme Application: Experience and Implementation. 265-279 - Maciej Gawinecki, Wojciech Szmyd, Urszula Zuchowicz, Marcin Walas:
What Makes a Good Movie Recommendation? Feature Selection for Content-Based Filtering. 280-294 - Fernando Luque-Suárez, Jorge L. López-López, Edgar Chávez:
Indexed Polygon Matching Under Similarities. 295-306 - Ahmed Askar, Andreas Züfle:
Clustering Adverse Events of COVID-19 Vaccines Across the United States. 307-320
Similarity Search in Graph-Structured Data
- Franka Bause, David B. Blumenthal, Erich Schubert, Nils M. Kriege:
Metric Indexing for Graph Similarity Search. 323-336 - Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal:
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. 337-351 - Mathias Fuchs, Kaspar Riesen:
Graph Embedding in Vector Spaces Using Matching-Graphs. 352-363 - Benjamin Paaßen:
An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs. 364-371 - Jakub Peschel, Michal Batko, Jakub Valcík, Jan Sedmidubský, Pavel Zezula:
FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search. 372-383
Doctoral Symposium
- Marco Postiglione:
Towards an Italian Healthcare Knowledge Graph. 387-394 - Luca Zecchini:
Progressive Query-Driven Entity Resolution. 395-401 - Fabrizio Scarrone:
Discovering Latent Information from Noisy Sources in the Cultural Heritage Domain. 402-408
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-28 22:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
