Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash (English)
- New search for: Tomoda, Ryota
- New search for: Koga, Hisashi
- New search for: Pedreira, Oscar
- Further information on Pedreira, Oscar:
- https://orcid.org/https://orcid.org/0000-0001-6176-4475
- New search for: Estivill-Castro, Vladimir
- Further information on Estivill-Castro, Vladimir:
- https://orcid.org/https://orcid.org/0000-0001-7775-0780
- New search for: Tomoda, Ryota
- New search for: Koga, Hisashi
In:
Similarity Search and Applications
: 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings
;
Chapter: 2
;
19-32
;
2023
- Article/Chapter (Book) / Electronic Resource
-
Title:Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash
-
Additional title:Lect.Notes Computer
-
Contributors:Pedreira, Oscar ( editor ) / Estivill-Castro, Vladimir ( editor ) / Tomoda, Ryota ( author ) / Koga, Hisashi ( author )
-
Conference:International Conference on Similarity Search and Applications ; 2023 ; Coruna, Spain
-
Published in:Similarity Search and Applications : 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings ; Chapter: 2 ; 19-32Lecture Notes in Computer Science ; 14289 ; 19-32
-
Publisher:
- New search for: Springer Nature Switzerland
-
Place of publication:Cham
-
Publication date:2023-10-27
-
Size:14 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Finding HSP Neighbors via an Exact, Hierarchical ApproachFoster, Cole / Chávez, Edgar / Kimia, Benjamin et al. | 2023
- 2
-
Approximate Similarity Search for Time Series Data Enhanced by Section Min-HashTomoda, Ryota / Koga, Hisashi et al. | 2023
- 3
-
Mutual k-Nearest Neighbor Graph for Data Analysis: Application to Metric Space ClusteringChavez, Edgar / Marchand-Maillet, Stephane / Quiroz, Adolfo J. et al. | 2023
- 4
-
An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity SearchThordsen, Erik / Schubert, Erich et al. | 2023
- 5
-
Unbiased Similarity Estimators Using SamplesMartínez, Conrado / Viola, Alfredo / Wang, Jun et al. | 2023
- 6
-
Retrieve-and-Rank End-to-End Summarization of Biomedical StudiesMoro, Gianluca / Ragazzi, Luca / Valgimigli, Lorenzo / Molfetta, Lorenzo et al. | 2023
- 7
-
Fine-Grained Categorization of Mobile Applications Through Semantic Similarity Techniques for Apps ClassificationFlondor, Elena / Frincu, Marc et al. | 2023
- 8
-
Runs of Side-Sharing Tandems in Rectangular ArraysMarcus, Shoshana / Sokol, Dina / Zelikovitz, Sarah et al. | 2023
- 9
-
Turbo Scan: Fast Sequential Nearest Neighbor Search in High DimensionsChavez, Edgar / Tellez, Eric S. et al. | 2023
- 10
-
Class Representatives Selection in Non-metric Spaces for Nearest Prototype ClassificationHlaváč, Jaroslav / Kopp, Martin / Kohout, Jan / Skopal, Tomá et al. | 2023
- 11
-
The Dataset-Similarity-Based Approach to Select Datasets for Evaluation in Similarity RetrievalMatiazzo, Matheus A. L. / de Castro-Silva, Vitor / Oyamada, Rafael S. / Kaster, Daniel S. et al. | 2023
- 12
-
Suitability of Nearest Neighbour Indexes for Multimedia Relevance FeedbackKhan, Omar Shahbaz / Aumüller, Martin / Jónsson, Björn Þór et al. | 2023
- 13
-
Accelerating k-Means Clustering with Cover TreesLang, Andreas / Schubert, Erich et al. | 2023
- 14
-
Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index QualityGuðmundsson, Gylfi Þór / Jónsson, Björn Þór et al. | 2023
- 15
-
Minwise-Independent Permutations with Insertion and Deletion of FeaturesPratap, Rameshwar / Kulkarni, Raghav et al. | 2023
- 16
-
SDOclust: Clustering with Sparse Data ObserversIglesias, Félix / Zseby, Tanja / Hartl, Alexander / Zimek, Arthur et al. | 2023
- 17
-
Solving k-Closest Pairs in High-Dimensional DataAumüller, Martin / Ceccarello, Matteo et al. | 2023
- 18
-
Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information RetrievalCarrara, Fabio / Gennaro, Claudio / Vadicamo, Lucia / Amato, Giuseppe et al. | 2023
- 19
-
Similarity Search with Multiple-Object QueriesConnor, Richard / Dearle, Alan / Morrison, David / Chávez, Edgar et al. | 2023
- 20
-
Diversity Similarity Join for Big DataSilva, Yasin N. / Martinez, Juan / Castro Cea, Pedro / Razente, Humberto / Nardini Barioni, Maria C. et al. | 2023
- 21
-
Overview of the SISAP 2023 Indexing ChallengeTellez, Eric S. / Aumüller, Martin / Chavez, Edgar et al. | 2023
- 22
-
Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch ExtractionRomild, Christoffer J. W. / Schauser, Thomas H. / Borup, Joachim Alexander et al. | 2023
- 23
-
General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyoOguri, Yutaro / Matsui, Yusuke et al. | 2023
- 24
-
SISAP 2023 Indexing Challenge – Learned Metric IndexSlanináková, Terèzia / Procházka, David / Antol, Matej / Olha, Jaroslav / Dohnal, Vlastislav et al. | 2023
- 25
-
Computational Enhancements of HNSW Targeted to Very Large DatasetsFoster, Cole / Kimia, Benjamin et al. | 2023
- 26
-
CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP VectorsMic, Vladimir / Sedmidubsky, Jan / Zezula, Pavel et al. | 2023