arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.03032cs.IRcs.CV
收藏

近似k-NN图构造:一种通用的在线方法

Approximate k-NN Graph Construction: a Generic Online Approach

Fujian Key Laboratory of Sensing and Computing for Smart City, Xiamen University(厦门大学福建省智慧城市感知与计算重点实验室);City University of Hong Kong(香港城市大学)

Wan-Lei Zhao, Hui Wang, Chong-Wah Ngo

摘要:

最近邻搜索和k-最近邻图构造是多媒体信息检索、数据挖掘和机器学习等学科中的两个基本问题。随着近年来大数据在各个领域的涌现,这一问题变得越来越紧迫。本文提出了一种简单而有效的近似k-近邻搜索和近似k-近邻图构造方法。这两个问题在我们的解决方案中得到了共同解决。一方面,近似k-最近邻图的构造被视为一个搜索任务。每个样本及其k-最近邻通过在构造中的图上顺序地执行最近邻搜索而被加入到k-最近邻图中。另一方面,构建的k-最近邻图用于支持k-最近邻搜索。由于图形是在线构建的,因此支持图形上的动态更新,这在大多数现有解决方案中是不可能的。该解决方案适用于各种距离测量。在不同尺度、不同维度和不同度量下的不同类型数据上验证了其作为k-近邻构造和k-近邻搜索方法的有效性。

英文摘要:

Nearest neighbor search and k-nearest neighbor graph construction are two fundamental issues arise from many disciplines such as multimedia information retrieval, data-mining and machine learning. They become more and more imminent given the big data emerge in various fields in recent years. In this paper, a simple but effective solution both for approximate k-nearest neighbor search and approximate k-nearest neighbor graph construction is presented. These two issues are addressed jointly in our solution. On the one hand, the approximate k-nearest neighbor graph construction is treated as a search task. Each sample along with its k-nearest neighbors are joined into the k-nearest neighbor graph by performing the nearest neighbor search sequentially on the graph under construction. On the other hand, the built k-nearest neighbor graph is used to support k-nearest neighbor search. Since the graph is built online, the dynamic update on the graph, which is not possible from most of the existing solutions, is supported. This solution is feasible for various distance measures. Its effectiveness both as k-nearest neighbor construction and k-nearest neighbor search approaches is verified across different types of data in different scales, various dimensions and under different metrics.

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

↑