An AkNN Algorithm for High-Dimensional Big Data
A new variant of k nearest neighbor queries,which called as all k-nearest neighbor queries(AkNN),is a process to search the k nearest neighbors of each object in a data set.An AkNN query algorithm for high-dimensional big data on the Hadoop system was proposed.Using the banding technique and the p-s...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Beijing Xintong Media Co., Ltd
2015-07-01
|
Series: | Dianxin kexue |
Subjects: | |
Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015171/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841529649065099264 |
---|---|
author | Zhongwei Wang Yefang Chen Siyou Xiao Jiangbo Qian |
author_facet | Zhongwei Wang Yefang Chen Siyou Xiao Jiangbo Qian |
author_sort | Zhongwei Wang |
collection | DOAJ |
description | A new variant of k nearest neighbor queries,which called as all k-nearest neighbor queries(AkNN),is a process to search the k nearest neighbors of each object in a data set.An AkNN query algorithm for high-dimensional big data on the Hadoop system was proposed.Using the banding technique and the p-stable LSH algorithm,dimensionality reduction was performed,then the data was embeded in a Z-order curve.The preprocessed data were continued to be treated on a MapReduce framework in a distributed parallel manner.Experimental results show that the proposed algorithm can efficiently handle AkNN queries for large-scale high-dimensional data. |
format | Article |
id | doaj-art-d0a95abbb6c448ba8756b5ff67e9f5f4 |
institution | Kabale University |
issn | 1000-0801 |
language | zho |
publishDate | 2015-07-01 |
publisher | Beijing Xintong Media Co., Ltd |
record_format | Article |
series | Dianxin kexue |
spelling | doaj-art-d0a95abbb6c448ba8756b5ff67e9f5f42025-01-15T03:17:00ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012015-07-0131526259614689An AkNN Algorithm for High-Dimensional Big DataZhongwei WangYefang ChenSiyou XiaoJiangbo QianA new variant of k nearest neighbor queries,which called as all k-nearest neighbor queries(AkNN),is a process to search the k nearest neighbors of each object in a data set.An AkNN query algorithm for high-dimensional big data on the Hadoop system was proposed.Using the banding technique and the p-stable LSH algorithm,dimensionality reduction was performed,then the data was embeded in a Z-order curve.The preprocessed data were continued to be treated on a MapReduce framework in a distributed parallel manner.Experimental results show that the proposed algorithm can efficiently handle AkNN queries for large-scale high-dimensional data.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015171/high-dimensionalAkNNMapReducebandinglocality sensitive hashingZ-order |
spellingShingle | Zhongwei Wang Yefang Chen Siyou Xiao Jiangbo Qian An AkNN Algorithm for High-Dimensional Big Data Dianxin kexue high-dimensional AkNN MapReduce banding locality sensitive hashing Z-order |
title | An AkNN Algorithm for High-Dimensional Big Data |
title_full | An AkNN Algorithm for High-Dimensional Big Data |
title_fullStr | An AkNN Algorithm for High-Dimensional Big Data |
title_full_unstemmed | An AkNN Algorithm for High-Dimensional Big Data |
title_short | An AkNN Algorithm for High-Dimensional Big Data |
title_sort | aknn algorithm for high dimensional big data |
topic | high-dimensional AkNN MapReduce banding locality sensitive hashing Z-order |
url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015171/ |
work_keys_str_mv | AT zhongweiwang anaknnalgorithmforhighdimensionalbigdata AT yefangchen anaknnalgorithmforhighdimensionalbigdata AT siyouxiao anaknnalgorithmforhighdimensionalbigdata AT jiangboqian anaknnalgorithmforhighdimensionalbigdata AT zhongweiwang aknnalgorithmforhighdimensionalbigdata AT yefangchen aknnalgorithmforhighdimensionalbigdata AT siyouxiao aknnalgorithmforhighdimensionalbigdata AT jiangboqian aknnalgorithmforhighdimensionalbigdata |