流中的二进制编码
Binary Coding in Stream
摘要:
大数据正变得越来越无处不在,包括大量的视频存储库、文档语料库、图像集和互联网路由历史。邻近搜索和聚类是数据分析的两个基本算法,但在这些巨大的数据集上遭受“维数灾难”。一个流行的攻击这个问题是转换对象表示为短的二进制码字,同时近似保持近邻结构。然而,在通常适用于这种规模的数据的“流式传输”或“在线”设置中构建码字的研究有限,其中人们可能只对太大而无法容纳在本地存储器中的数据进行单次传递。在本文中,我们应用最新的进展,矩阵素描技术,以构建二进制码字在流和在线设置。我们的实验结果竞争优于几个最常用的算法,我们证明了理论上的保证,在流媒体设置的性能温和的假设下的数据和随机性的训练集。
英文摘要:
Big data is becoming ever more ubiquitous, ranging over massive video repositories, document corpuses, image sets and Internet routing history. Proximity search and clustering are two algorithmic primitives fundamental to data analysis, but suffer from the "curse of dimensionality" on these gigantic datasets. A popular attack for this problem is to convert object representations into short binary codewords, while approximately preserving near neighbor structure. However, there has been limited research on constructing codewords in the "streaming" or "online" settings often applicable to this scale of data, where one may only make a single pass over data too massive to fit in local memory. In this paper, we apply recent advances in matrix sketching techniques to construct binary codewords in both streaming and online setting. Our experimental results compete outperform several of the most popularly used algorithms, and we prove theoretical guarantees on performance in the streaming setting under mild assumptions on the data and randomness of the training set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。