Accepted papers

• Full research papers
  • Sabina Khazari, Tanja Zseby and Felix Iglesias:
    Limits of Clustering Models Based on Distance Similarity: A Sensitivity Study of SDOclust
  • Naoya Higuchi, Yasunobu Imamura, Takeshi Shinohara, Kouichi Hirata and Tetsuji Kuboyama:
    Approximate Selection of Best Matching Unit for Large-Scale Self-Organizing Maps
  • Hafiz Saud Arshad, Muhammad Rajabinasab and Arthur Zimek:
    Towards Truly Unsupervised Evaluation of Feature Selection
  • Victor Reyes and Stephane Marchand-Maillet:
    Closeness, a natural notion of proximity
  • Philipp Röchner, Vladimir Mic and Ricardo Gabrielli Barreto Campello:
    Nearest Neighbors Need Better Neighborhoods (Position)
  • Yousif Elias, Patrick Marcel, Sophie Robert and Mostafa Bamha:
    Extending Drop-DTW for clustering multivariate timed sequences
  • Richard Connor, Alan Dearle, Ben Claydon and Kamyar Babazadeh:
    Polytopes, Bits and Hashes: Space-Efficient Construction for NN Graphs
  • Àlex Font, Conrado Martínez, Mahmudur Rahman Hera and David Koslicki:
    A Detailed Analysis of MaxGeomHash Sketches
  • Edgar Chavez, Marco Patella and Ilaria Bartolini:
    Calibrated Early Termination: Dataset-Independent PAC Bounds for Graph-Based Nearest Neighbor Search
  • Michael E. Houle:
    Local Intrinsic Dimensionality and Lyapunov Exponents in Fixed-Point Iteration
  • Fabrizio Angiulli, Francesco De Luca and Fabio Fassetti:
    ADoCL: Anomaly-Aware Dynamic Concept Maintenance for Reliable Continual Learning
  • Amsalu Fentie Jember and Mario Alessandro Bochicchio:
    QSet-Rank: Dispersion-Aware Question-Set Reranking for Robust Biomedical RAG
• Short research papers
  • Reon Uemura, Keito Kido and Daichi Amagata:
    Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search
  • Yuncong Yu, Tim Becker, Peter Schichtel, Wolfgang Aigner, Alexandru Telea and Michael Behrisch:
    NOOPS: Nonmyopic Feedback-Driven Pattern Search in Multivariate Time Series
  • David Procházka, Mirjam Bayer, Daniyal Kazempour, Maximilian Verwiebe, Peer Kröger and Vlastislav Dohnal:
    Capacity-Aware Cluster Rebalancing for Efficient R-Tree Indexing
  • Ben Claydon, Richard Connor and Alan Dearle:
    Cyclical Query Update: A Novel Query Algorithm for Locality-Sensitivity Based Similarity Search
  • Ryusuke Inami and Yusuke Matsui:
    Fast Construction of Learned Count-Min Sketch via Ternary Search
  • Muhammad Rajabinasab and Arthur Zimek:
    Feature Selection Granularity: An Empirical Study
  • Khaoula Abdenouri and Karima Echihabi:
    KTree: a Kernel-Based Index for Scalable Exact Similarity Search
  • Pablo Andretta Jaskowiak and Ivan Gesteira Costa Filho:
    Clustering Validation with The Area Under Precision-Recall Curve
  • Cole Foster, Kelly Lin, Edgar Chavez and Benjamin Kimia:
    Barycentric Charts for Geodesic Queries on Compressed Indices
  • Jakob Sturm, Lukas Ellinger, Andre Luckow and Georg Groh:
    Needle in a Knowledge Graph: Generating Scalable Long-Context Benchmarks for KG Question Answering
  • Sara Jarrad, Hubert Naacke and Stéphane Gançarski:
    Top-k on Sequences : A Generic Approach for Similarity Search
  • Khaoula Abdenouri and Karima Echihabi:
    CORA: Coreset-Based Probabilistic Stopping in Approximate Similarity Search
• Demo papers
  • Matúš Šikyňa, Pavol Poláček and Pavel Zezula:
    Interactive Personalised Image Search for Vector Databases
• Doctoral Symposium Papers
  • Kamyar Babazadeh:
    Querying Polyobjects
  • Preethi M:
    Approximate Nearest Neighbor Search over Distance Distributions in Probabilistic Metric Space
  • Victor Reyes:
    Curvature and border effect on dimensionality estimation
• Indexing Challenge papers
  • Aftab Ahmed Choudhry:
    Hardware-Sympathetic Optimization for High-Dimensional Vector Search
  • Ben Claydon, Kamyar Babazadeh, Richard Connor and Alan Dearle:
    Crusty Coders SISAP Challenge 2026
  • Linghan Zeng and Ninh Pham:
    SISAP Indexing Challenge 2025 Solution for Task 1 Using Random Projection Landmarks and NNdescent
  • Eneko Sabaté Iturgaiz:
    NMF-IVF: Learning Latent Semantic Topics for Approximate Retrieval
  • Kenneth Langedal and Henrik Reinstädtler:
    SISAP 2026 Indexing Challenge: Plain Local Search
  • David Procházka, Emma Sommerová, Jan Mach and Vlastislav Dohnal:
    Learned k-NN Graph Construction and Spherical Indexing for MIPS
  • Silvio Martinico, Franco Maria Nardini, Cosimo Rulli and Rossano Venturini:
    A Two-Stage Graph Index for Efficient Learned Sparse Retrieval with kANNolo
  • Luis Solsona Sánchez and Luis Fernando Chávez Quevedo:
    Memory-Bounded Approximate Nearest Neighbour Search for Dense, MIPS, and Sparse Vectors: SISAP 2026 Indexing Challenge
  • Sergi Guimerà Roig and Iván Sánchez Gala:
    PiPNN for k-NN Graph Construction: Inverse-Size Merging and Diversified Beam Search
  • Nico Hezel, Kai Uwe Barthel, Bruno Schilling, Konstantin Schall, Andre Moelle and Klaus Jung:
    Fast and Efficient Approximate Nearest Neighbor Search for High-Dimensional LLM Embeddings
  • Erik Thordsen and Erich Schubert:
    Maximum Inner Product Search with Decoupled Construction- and Query-Measures
  • Cole Foster, Benjamin Kimia and Edgar Chavez:
    Walsh--Hadamard Projections and Exact Rerank
  • Roger Canal:
    Static InvertedBlock Indexing and Parameterized Search for Approximate MIPS over Learned Sparse Representations
  • Tobias Rubel, Richard Wen, Guy Blelloch, Laxman Dhulipala, Lars Gottesbüren, Jakub Łącki and Vahab Mirrokni:
    Fast k-NN Graph Building with Quantized PiPNN and Filtering