Similarity Search and Applications: 16th International Conference, SISAP 2023, A Coruña, Spain, October 9–11, 2023, Proceedings: Lecture Notes in Computer Science, cartea 14289
Editat de Oscar Pedreira, Vladimir Estivill-Castroen Limba Engleză Paperback – 27 oct 2023
This book constitutes the refereed proceedings of the 16th International Conference on Similarity Search and Applications, SISAP 2023, held in A Coruña, Spain, during October 9–11, 2023.
The 16 full papers and 4 short papers included in this book were carefully reviewed and selected from 33 submissions. They were organized in topical sections as follows: similarity queries, similarity measures, indexing and retrieval, data management, feature extraction, intrinsic dimensionality, efficient algorithms, similarity in machine learning and data mining.
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 379.96 lei
Preț vechi: 474.96 lei
-20% Nou
Puncte Express: 570
Preț estimativ în valută:
72.72€ • 75.80$ • 60.54£
72.72€ • 75.80$ • 60.54£
Carte tipărită la comandă
Livrare economică 07-21 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031469930
ISBN-10: 3031469933
Pagini: 310
Ilustrații: XXI, 310 p. 103 illus., 92 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.47 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031469933
Pagini: 310
Ilustrații: XXI, 310 p. 103 illus., 92 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.47 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Keynotes.- From Intrinsic Dimensionality to Chaos and Control: Towards a Unified Theoretical View.- The Rise of HNSW: Understanding Key Factors Driving the Adoption.- Towards a Universal Similarity Function: the Information Contrast Model and its Application as Evaluation Metric in Artificial Intelligence Tasks.- Research Track.- Finding HSP Neighbors via an Exact, Hierarchical Approach.- Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash.- Mutual nearest neighbor graph for data analysis: Application to metric space clustering.- An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity Search.- Unbiased Similarity Estimators using Samples.- Retrieve-and-Rank End-to-End Summarization of Biomedical Studies.- Fine-grained Categorization of Mobile Applications through Semantic Similarity Techniques for Apps Classification.- Runs of Side-SharingTandems in Rectangular Arrays.- Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions.- Class Representatives Selection in Non-Metric Spaces for Nearest Prototype Classification.- The Dataset-similarity-based Approach to Select Datasets for Evaluation in Similarity Retrieval.- Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback.- Accelerating k-Means Clustering with Cover Trees.- Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index Quality.- Minwise-Independent Permutations with Insertion and Deletion of Features.- SDOclust: Clustering with Sparse Data Observers.- Solving k-Closest Pairs in High-Dimensional Data using Locality- Sensitive Hashing.- Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information Retrieval.- Similarity Search with Multiple-Object Queries.- Diversity Similarity Join for Big Data.- Indexing Challenge.- Overview of the SISAP 2023 Indexing Challenge.- Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, And Batch Extraction.- General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo.- SISAP 2023 Indexing Challenge – Learned Metric Index.- Computational Enhancements of HNSW Targeted to Very Large Datasets.- CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors.