Similarity Search and Applications

1. Front Matter

   Pages I-XI

   PDF

2. Approximate Similarity Search

   1. Front Matter

      Pages 1-1

      PDF

   2. The Power of Distance Distributions: Cost Models and Scheduling Policies for Quality-Controlled Similarity Queries

      • Paolo Ciaccia, Marco Patella

      Pages 3-16

   3. Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries

      • Filip Nalepa, Michal Batko, Pavel Zezula

      Pages 17-33

   4. ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

      • Martin Aumüller, Erik Bernhardsson, Alexander Faithfull

      Pages 34-49

3. Improving Similarity Search Methods and Applications

   1. Front Matter

      Pages 51-51

      PDF

   2. Sketches with Unbalanced Bits for Similarity Search

      • Vladimir Mic, David Novak, Pavel Zezula

      Pages 53-63

   3. Local Intrinsic Dimensionality I: An Extreme-Value-Theoretic Foundation for Similarity Applications

      • Michael E. Houle

      Pages 64-79

   4. Local Intrinsic Dimensionality II: Multivariate Analysis and Distributional Support

      • Michael E. Houle

      Pages 80-95

   5. High-Dimensional Simplexes for Supermetric Search

      • Richard Connor, Lucia Vadicamo, Fausto Rabitti

      Pages 96-109

   6. Improving k-NN Graph Accuracy Using Local Intrinsic Dimensionality

      • Michael E. Houle, Vincent Oria, Arwa M. Wali

      Pages 110-124

4. Distances for Complex Objects

   1. Front Matter

      Pages 125-125

      PDF

   2. Dynamic Time Warping and the (Windowed) Dog-Keeper Distance

      • Jörg P. Bachmann, Johann-Christoph Freytag

      Pages 127-140

   3. Fast Similarity Search with the Earth Mover’s Distance via Feasible Initialization and Pruning

      • Merih Seran Uysal, Kai Driessen, Tobias Brockhoff, Thomas Seidl

      Pages 141-155

   4. A New Perspective on the Tree Edit Distance

      • Stefan Schwarz, Mateusz Pawlik, Nikolaus Augsten

      Pages 156-170Open Access

5. Outlier Detection

   1. Front Matter

      Pages 171-171

      PDF

   2. Good and Bad Neighborhood Approximations for Outlier Detection Ensembles

      • Evelyn Kirner, Erich Schubert, Arthur Zimek

      Pages 173-187

   3. Intrinsic t-Stochastic Neighbor Embedding for Visualization and Outlier Detection

      • Erich Schubert, Michael Gertz

      Pages 188-203

6. Indexing and Applications

   1. Front Matter

      Pages 205-205

      PDF

   2. Scalable Similarity Search for Molecular Descriptors

      • Yasuo Tabei, Simon J. Puglisi

      Pages 207-219

This book constitutes the refereed proceedings of the 10th International Conference on Similarity Search and Applications, SISAP 2017, held in Munich, Germany, in October 2017.


The 23 full papers presented were carefully reviewed and selected from 53 submissions. The papers deal with issues surrounding the theory, design, analysis, practice, and application of content-based and feature-based similarity search. They are organized in the following topical sections: approximate similarity search; improving similarity search methods and applications; distances for complex objects; outlier detection; indexing and applications; and applications and specific domains.


The paper 'A New Perspective on the Tree Edit Distance' is published open access under a CC BY 4.0 license at link.springer.com.

• applications
• approximate similarity search
• artificial intelligence
• classification
• data mining
• databases
• feature selection
• finite element method
• image processing
• indexing (of information)
• information retrieval
• learning systems
• pattern recognition
• probability
• query languages
• query processing
• search engines
• similarity search
• software engineering
• telecommunication networks

• Fraunhofer Institute for Applied Information Technology, Sankt Augustin, Germany

  Christian Beecks

• Ludwig-Maximilians-Universität München, Munich, Germany

  Felix Borutta, Peer Kröger, Thomas Seidl

Policies and ethics