arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.02062cs.IR
收藏

在数据流中钓鱼:无尽数据上的相似性搜索

Fishing in the Stream: Similarity Search over Endless Data

Naama Kraus, David Carmel, Idit Keidar

摘要:

相似性搜索是检索与给定查询相似的数据项的任务。在本文中,我们介绍了时间敏感的概念相似性搜索在无尽的数据流(SSDS),它考虑到数据的质量和时间特性,除了相似性。SSDS是具有挑战性的,因为它需要处理无限的数据,而计算资源是有限的。我们提出了流LSH,一个随机SSDS算法,根据其新鲜度,质量和动态流行属性保留项目的索引大小的界限。我们分析表明,流LSH增加的概率,找到类似的项目相比,使用相同的空间容量的替代方法。我们进一步使用真实世界的流数据集进行了实证研究,证实了我们的理论结果。

英文摘要:

Similarity search is the task of retrieving data items that are similar to a given query. In this paper, we introduce the time-sensitive notion of similarity search over endless data-streams (SSDS), which takes into account data quality and temporal characteristics in addition to similarity. SSDS is challenging as it needs to process unbounded data, while computation resources are bounded. We propose Stream-LSH, a randomized SSDS algorithm that bounds the index size by retaining items according to their freshness, quality, and dynamic popularity attributes. We analytically show that Stream-LSH increases the probability to find similar items compared to alternative approaches using the same space capacity. We further conduct an empirical study using real world stream datasets, which confirms our theoretical results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑