Call for papers (to be updated soon)
Authors are encouraged to submit previously unpublished papers on their research in similarity search and applications.
Contributions to the conference should fall into the following categories:
| Full papers: || |
Basic techniques: general methods that apply to arbitrary metric spaces, nonmetric or (dis)similarity spaces, or high-dimensional vector spaces.
We strongly encourage that those be accompanied with an open-source implementation conforming the interface of the Web site and to be tested with a relevant subset of the spaces included in the Web site. This will favor uniform comparison and also permit comparing the technique with future developments.
Applied techniques: methods that apply to specific similarity search problems.
Those papers are also encouraged to contribute with the code and, especially, with the similarity computation function and the datasets related to the specific problem they address (if they are new), for the Web site .
| Posters: |
Domain-specific spaces and similarities: papers that challenge and motivate for searching in new spaces (i.e. domain-specific similarity search).
This type of contribution is expected to provide a thorough study of the non/metric space properties (e.g., its intrinsic dimension) or the similarity measure, and must include code for the similarity computation and datasets for the Web site . For this kind of paper a real-world domain-specific application of similarity search is expected (e.g., multimedia databases, (bio)chemical & medical databases, biometric databases, scientific & sensory databases, etc.).
| Demos: |
Similarity retrieval engines: papers that present prototypical non-commercial engine entirely devoted to similarity search applications.
The presentation should cover the domains of applicability (e.g., image retrieval system), the architecture, scalability, user interfaces, optional comparison with similar engines, etc. This type of contribution must include either an installation package of the demo application + database, or must be installed as a web application accessible to the SISAP PC.
The topics of interest include, but are not limited to:
- Range search
- knn search
- Limited-range knn search
- Reverse knn search
- New complex similarity query types
- Similarity joins
- Clustering (applied to indexing)
- Indexing based on hashing
- Parallelism & distributed algorithms
- Approximate searching
- Computation of intrinsic dimension
- Cost models
- Languages for similarity databases