In order to solve the problem of low efficiency of the K-Nearset Neighbors(KNN) classification algorithm in face of massive text
a non-balanced local sensitive hash classification algorithm based on hyper-plane is proposed
which has a more significant effect than the traditional local sensitive hash algorithm on improving the accuracy and real-time performance. At the same time
in order to further reduce the execution time of the classification algorithm and improve the classification efficiency
an efficient parallel text classification system baseed on Hadoop is designed which combines the classification algorithm and the Spark parallel computing model. The experimental results show that such text classification system has a high classification speed and a high classification accuracy.
关键词
Keywords
references
Zhu P, Zhan X, Qiu W. Efficient k-Nearest Neighbors Search in High Dimensions Using MapReduce[C]//Big Data and Cloud Computing (BDCloud), 2015 IEEE Fifth International Conference on. IEEE, 2015: 23-30.
Datar M, Immorlica N, Indyk P, et al. Locality-sensitive hashing scheme based on p-stable distributions[C]//Proceedings of the twentieth annual symposium on Computational geometry. ACM, 2004: 253-262.
Yao B, Li F, Kumar P. K nearest neighbor queries and knn-joins in large relational databases (almost) for free[C]//Data engineering (ICDE), 2010 IEEE 26th international conference on. IEEE, 2010: 4-15.
Park Y, Hwang H, Lee S. A Fast k-Nearest Neighbor Search Using Query-Specific Signature Selection[C]//Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 2015: 1883-1886.
Beijing Gao Yanjie. Data Processing with Spark[M]. Beijing: China Machine Press, 2015.
Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality[C]//Proceedings of the thirtieth annual ACM symposium on Theory of computing. ACM, 1998: 604-613.
Jagadish H V, Ooi B C, Tan K L, et al. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search[J]. ACM Transactions on Database Systems (TODS), 2005, 30(2): 364-397. DOI: 364