Data arrangement and dimensional compression using Vivaldi for similarity search on structured peer-to-peer network
Data arrangement and dimensional compression using Vivaldi for similarity search on structured peer-to-peer network
复制标题
DOI：
10.1109/icce-tw.2015.7216959
复制
发表时间：
2015-06
期刊：
影响因子：
--
通讯作者：
Yoshihiro Sugaya;K. Motoyama;S. Omachi
中科院分区：
文献类型：
--
作者：
Yoshihiro Sugaya;K. Motoyama;S. Omachi
P2P系统是一个很有前途的解决方案，以管理大量的数据，但在P2P网络的相似性搜索有限的消息是一个具有挑战性的问题。可以执行相似性搜索的现有方法仅对低维数据起作用。我们提出了一种方法来转换非常高维的数据到低维向量，以执行相似性搜索。
Peer-to-peer system is a promising solution to manage a large amount of data, but similarity search on peer-to-peer network with a restricted small number of messages is a challenging problem. Existing methods that can perform similarity search work only with low-dimensional data. We propose a method to transform the very high-dimensional data into low-dimensional vectors in order to perform similarity search.