The International Conference on Similarity Search andApplications (SISAP) is an annual forum for researchers andapplication developers in the area of similarity data management. Itaims at the technological problems shared by numerous applicationdomains, such as data mining, information retrieval, multimediaretrieval, computer vision, pattern recognition, computationalbiology, geography, biometrics, machine learning, and many others thatmake use of similarity search as a necessary supporting service. Fromits roots in metric indexing, SISAP has expanded to become the onlyinternational conference entirely devoted to all issues surroundingthe theory, design, analysis, practice, and application ofcontent-based and feature-based similarity search. Since 2021, SISAPhas been a CORE Rank B conference.

SISAP traditionally allows for research papers (full and short),application papers (full and short), as well as demo (short), vision(short), and position (short) papers.

The conference proceedings are published by Springer as a volume inthe Lecture Notes in Computer Science (LNCS) series. A small selectionof the best papers presented at the conference will be recommended forinclusion in a special issue of Information Systems. These extendedversions will be subject to a second round of peer review at thejournal. Best papers will be awarded along with a monetary prize.

Important Additional Scholarly Activities at SISAP

• Fourth Doctoral Symposium on Similarity Search and Applications
• SISAP Indexing Challenge (https://sisap-challenges.github.io/)

(Confirmed) Invited Speakers

• Michael Houle, New Jersey Institute of Technology, Newark, USA
• Yury Malkov, VerSe Innovation, Bangalore, India
• Julio Gonzalo,  UNED (Universidad Nacional de Educación a Distancia), Madrid, Spain

Submission Guidelines

All papers must be original and not simultaneously submitted to another journal or conference. The following paper categories are welcome:

• Similarity
  • Similarity queries (k-NN, range, reverse NN, top-k, approximate, etc.)
  • Similarity measures (graph, structural, time series, complex data, tensors, secondary similarity, etc.)
  • Similarity operations (joins, ranking, classification, categorization, filtering, etc.)
• Scalability
  • Indexing and access methods for similarity-based processing
  • High-performance/large-scale similarity search (distributed, parallel, etc.)
  • Data management (transaction support, dynamic maintenance, etc.)
• Theory
  • Languages for similarity databases
  • Models of similarity
  • Intrinsic dimensionality
  • Discriminability and contrast
  • Manifolds and subspaces
• Analytics, Learning, Artificial Intelligence
  • Visual analytics for similarity-based operations
  • Feature selection and extraction for similarity search
  • Representations learning for feature extraction
  • Merging/combining multiple similarity modalities
  • Learning/adaptive similarity measures
  • Similarity in learning and mining
• Evaluation
  • Evaluation techniques for similarity queries and operations
  • Cost models and analysis for similarity data processing
  • Performance studies and comparisons
  • Test collections and benchmarks
• Applications
  • Multimedia retrieval systems
  • Applications of similarity-based operations
  • Industrial applications and case studies
  • Similarity for forensics and security
  • Similarity search cloud services
  • Security and privacy of in similarity search

Committees

Program Committee

• Giuseppe Amato, ISTI-CNR, Italy
• Laurent Amsaleg, CNRS-IRISA, France
• Fabrizio Angiulli, DIMES, University of Calabria, Italy
• Ilaria Bartolini, University of Bologna, Italy
• Michal Batko, Masaryk University, Czech Republic
• Panagiotis Bouros, Johannes Gutenberg University Mainz, Germany
• Benjamin Bustos, University of Chile, Chile
• K. Selcuk Candan, Arizona State University, USA
• Edgar Chavez, CICESE, Mexico
• Mario G.C.A. Cimino, University of Pisa, Italy
• Richard Connor, University of St. Andrews, UK
• Alan Dearle , University of St. Andrews, UK
• Vlastislav Dohnal, Masaryk University, Czech Republic
• Vlad Estivill-Castro, Universitat Pompeu Fabra, Spain
• Rolf Fagerberg, University of Southern Denmark, Denmark
• Fabrizio Falchi, ISTI-CNR, Italy
• Karina Figueroa, UMSNH, Mexico
• Qiang Gao, Southwestern University of Finance and Economics, China
• Yunjun Gao, Zhejiang University, China
• Claudio Gennaro, ISTI - CNR, Italy
• Thi Thao Nguyen Ho, Aalborg University, Denmark
• Akihiro Inokuchi, Kwansei Gakuin University, Japan
• Björn Þór Jónsson, Reykjavik University, Iceland
• Peer Kröger, Christian-Albrechts-University Kiel, Germany
• Stéphane Marchand-Maillet, University of Geneva, Switzerland
• Vladimir Mic, Masaryk university, Czech Republic
• Lia Morra, Politecnico di Torino, Italy
• Vincent Oria, NJIT, USAMarco Patella, University of Bologna, Italy
• Oscar Pedreira, University of A Coruña, Spain
• Miloš Radovanović, University of Novi Sad, Serbia
• Marcela Ribeiro, Federal University of São Carlos, Brazil
• Kunihiko Sadakane, The University of Tokyo, Japan
• Erich Schubert, TU Dortmund University, Germany
• Jan Sedmidubsky, Masaryk University, Czech Republic
• Tetsuo Shibuya, The University of Tokyo, Japan
• Caetano Traina-Junior, University of São Paulo, Brazil
• Lucia Vadicamo, ISTI- CNR, Italy
• Takashi Washio, Osaka University, Japan
• Pavel Zezula, Masaryk University, Czech Republic
• Kaiping Zheng National, University of Singapore, Singapore
• Arthur Zimek, University of Southern Denmark, Denmark

Organizing committee

• Oscar Pedreira, Universidade da Coruña, Spain (General Chair, Program Committee Co-Chair)
• Vladimir Estivill-Castro, Universitat Pompeu Fabra, Spain (Program Committee Co-Chair)
• Amalia Duch-Brown, Universitat Politècnica de Catalunya, Spain (Doctoral Symposium Chair)
• Conrado Martinez, Universitat Politècnica de Catalunya, Spain (Publicity Chair)
• Cole Foster, Brown University, USA (Publicity Chair)
• Eric S. Tellez, CICESE-INFOTEC-CONACyT, Mexico (SISAP Indexing Challenge Chair)
• Martin Aumüller, ITU Copenhagen, Denmark (SISAP Indexing Challenge Chair)