%0 Journal Article
%T 基于HBase和SimHash的大数据K-近邻算法<br>K-NN algorithm for big data based on HBase and SimHash
%A 王婷婷
%A 翟俊海
%A 张明阳
%A 郝璞&lt
%A br&gt
%A WANG Tingting
%A ZHAI Junhai
%A ZHANG Mingyang
%A HAO Pu
%J 山东大学学报（工学版）
%D 2018
%R 10.6040/j.issn.1672-3961.0.2017.414
%X 摘要： 针对大数据K-近邻(K-nearest neighbors, K-NN)计算复杂度高的问题,提出一种基于HBase和SimHash的大数据K-近邻分类算法。利用SimHash算法将大数据集从原空间映射到Hamming空间,得到哈希签名值集合;将样例的行键与值的二元对存储到HBase数据库中,行健(rowkey)为样例的哈希签名值,值(value)为样例的类别;对于测试样例,以其哈希签名值作为健rowkey,从HBase数据库中获取所有样例的value,通过对这些values进行多数投票,即可以得到测试样例的类别。与基于MapReduce的K-NN和基于Spark的K-NN在运行时间和测试精度两方面进行试验比较。试验结果显示,在保持分类能力的前提下,提出的算法的运行时间远远低于其他两种方法。<br>Abstract: Aiming at solving the problem of high computational complexity of K-NN(K-nearest neighbors)algorithm in big data scenarios, based on HBase and SimHash, a K-NN algorithm for big data classification was proposed. The big data sets were mapped from the original space into the Hamming space, and the sets of hash codes were obtained. The pairs of rowkeys and values were stored in HBase database; the rowkeys were the hash codes of instances; the values were the classes of instances. For testing instances, the values of instances which had same rowkeys were selected from HBase database, and the labels of testing instances were obtained by majority voting with the values. The proposed algorithm was experimentally compared with MapReduce-based K-NN and Spark-based K-NN on the running time and testing accuracy. The experimental results showed that the running time of the proposed algorithm was much lower than the times of the MapReduce-based K-NN and Spark-based K-NN in the case of classification performance preservation
%K 大数据
%K 分类算法
%K SimHash
%K &lt
%K i&gt
%K K&lt
%K /i&gt
%K -近邻
%K HBase
%K &lt
%K br&gt
%K big data
%K &lt
%K i&gt
%K K&lt
%K /i&gt
%K -nearest neighbors
%K HBase
%K SimHash
%K classification algorithms
%U http://gxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1672-3961.0.2017.414