Posters at SISAP 2021

Every accepted paper must present a poster at two of the three online poster sessions, to allow for informal discussion of the results. Additionally, each poster is presented once on Zoom stage, at the time given in the conference program.

Posters are enumerated using this presentation time for your convenience:

Zoom presentation at Wednesday

  1. Organizing Similarity Spaces using Metric Hulls
    Miriama Jánošová, David Procházka and Vlastislav Dohnal Wed Thu
  2. Scaling Up Set Similarity Joins Using A Cost-Based Distributed-Parallel Framework
    Fabian Fier and Johann-Christoph Freytag Wed Thu
  3. A Triangle Inequality for Cosine Similarity
    Erich Schubert Wed Thu Fri
  4. A Cost Model for Reverse Nearest Neighbor Query Processing on R-trees Using Self Pruning
    Felix Borutta, Peer Kröger and Matthias Renz
  5. Local Intrinsic Dimensionality and Graphs: Towards LID-aware Graph Embedding Algorithms
    Miloš Savić, Vladimir Kurbalija and Miloš Radovanović
  6. Structural Intrinsic Dimensionality
    Stephane Marchand-Maillet, Oscar Pedreira and Edgar Chavez Wed Thu
  7. Relationships between Local Intrinsic Dimensionality and Tail Entropy
    James Bailey, Michael E. Houle and Xingjun Ma Thu Fri
  8. The Effect of Random Projection on Local Intrinsic Dimensionality
    Michael E. Houle and Ken-ichi Kawarabayashi
  9. Towards an Italian Healthcare Knowledge Graph
    Marco Postiglione Wed Thu
  10. Progressive Query-driven Entity Resolution
    Luca Zecchini Wed Thu Fri
  11. Discovering Latent Information from Noisy Sources in the Cultural Heritage Domain
    Fabrizio Scarrone Wed Thu

Zoom presentation on Thursday

  1. How Many Neighbours for Known-item Search?
    Jakub Lokoc and Tomáš Souček Thu
  2. On Generalizing Permutation-Based Representations for Approximate Search
    Lucia Vadicamo, Claudio Gennaro and Giuseppe Amato Wed Thu
  3. Data-driven Learned Metric Index: an Unsupervised Approach
    Terézia Slanináková, Matej Antol, Jaroslav Oľha, Vojtěch Kaňa and Vlastislav Dohnal Thu Fri
  4. Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing
    Maximilian Hünemörder, Peer Kröger and Matthias Renz Wed Thu
  5. Similarity vs. Relevance: From Simple Searches to Complex Discovery
    Tomas Skopal, David Bernhauer, Petr Skoda, Jakub Klimek and Martin Necasky Wed Thu
  6. Non-Parametric Semi-Supervised Learning by Bayesian Label Distribution Propagation
    Jonatan Møller Nuutinen Gøttcke, Arthur Zimek and Ricardo José Gabrielli Barreto Campello
  7. Optimizing Fair Approximate Nearest Neighbor Searches using Threaded B+-Trees
    Omid Jafari, Preeti Maurya, Khandker Mushfiqul Islam and Parth Nagarkar Wed Thu
  8. Fairest Neighbors: Tradeoffs Between Metric Queries
    Magnus Lie Hetland and Halvard Hummel Wed Thu
  9. Similarity Search for an Extreme Application: Experience & Implementation
    Vladimir Mic, Tomáš Raček, Aleš Křenek and Pavel Zezula Thu Fri
  10. What makes a good movie recommendation? Feature selection for Content-Based Filtering
    Maciej Gawinecki, Wojciech Szmyd, Urszula Żuchowicz and Marcin Walas Thu Fri
  11. Indexed Polygon Matching under Similarities
    Fernando Luque, Jorge L. López-López and Edgar Chavez Wed Fri
  12. Clustering Adverse Events of COVID-19 Vaccines across the United States
    Ahmed Askar and Andreas Züfle Wed Fri

Zoom presentation on Friday

  1. Accelerating Spherical k-Means
    Erich Schubert, Andreas Lang and Gloria Feher Wed Thu Fri
  2. MESS: Manifold Embedding Motivated Super Sampling
    Erik Thordsen and Erich Schubert Wed Thu
  3. Handling Class Imbalance in k-Nearest Neighbor Classification by Balancing Prior Probabilities
    Jonatan Møller Nuutinen Gøttcke and Arthur Zimek
  4. Metric Indexing for Graph Similarity Search
    Franka Bause, David B. Blumenthal, Erich Schubert and Nils M. Kriege Wed Thu
  5. The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections
    Lucas Gnecco Heredia, Nicolas Boria, Sébastien Bougleux, Florian Yger and David Blumenthal Wed Thu Fri
  6. Graph Embedding in Vector Spaces Using Matching-Graphs
    Mathias Fuchs and Kaspar Riesen Thu Fri
  7. An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
    Benjamin Paaßen Wed Thu
  8. FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search
    Jakub Peschel, Michal Batko, Jakub Valcik, Jan Sedmidubsky and Pavel Zezula Wed Thu