图书简介
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.
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-Sharing Tandems 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.
Trade Policy 买家须知
- 关于产品：
- ● 正版保障：本网站隶属于中国国际图书贸易集团公司，确保所有图书都是100%正版。
- ● 环保纸张：进口图书大多使用的都是环保轻型张，颜色偏黄，重量比较轻。
- ● 毛边版：即书翻页的地方，故意做成了参差不齐的样子，一般为精装版，更具收藏价值。
关于退换货：- 由于预订产品的特殊性，采购订单正式发订后，买方不得无故取消全部或部分产品的订购。
- 由于进口图书的特殊性，发生以下情况的，请直接拒收货物，由快递返回：
- ● 外包装破损/发错货/少发货/图书外观破损/图书配件不全（例如：光盘等）
并请在工作日通过电话400-008-1110联系我们。
- 签收后，如发生以下情况，请在签收后的5个工作日内联系客服办理退换货：
- ● 缺页/错页/错印/脱线
关于发货时间：- 一般情况下：
- ●【现货】 下单后48小时内由北京（库房）发出快递。
- ●【预订】【预售】下单后国外发货，到货时间预计5-8周左右，店铺默认中通快递，如需顺丰快递邮费到付。
- ● 需要开具发票的客户，发货时间可能在上述基础上再延后1-2个工作日（紧急发票需求，请联系010-68433105/3213）；
- ● 如遇其他特殊原因，对发货时间有影响的，我们会第一时间在网站公告，敬请留意。
关于到货时间：- 由于进口图书入境入库后，都是委托第三方快递发货，所以我们只能保证在规定时间内发出，但无法为您保证确切的到货时间。
- ● 主要城市一般2-4天
- ● 偏远地区一般4-7天
关于接听咨询电话的时间：- 010-68433105/3213正常接听咨询电话的时间为：周一至周五上午8：30～下午5：00，周六、日及法定节假日休息，将无法接听来电，敬请谅解。
- 其它时间您也可以通过邮件联系我们：customer@readgo.cn,工作日会优先处理。
关于快递：- ● 已付款订单：主要由中通、宅急送负责派送，订单进度查询请拨打010-68433105/3213。
本书暂无推荐
本书暂无推荐
