4.6 Article

Efficient kNN classification algorithm for big data

期刊

NEUROCOMPUTING
卷 195, 期 -, 页码 143-148

出版社

ELSEVIER
DOI: 10.1016/j.neucom.2015.08.112

关键词

Classification; kNN; Big data; Data cluster; Cluster center

资金

  1. China 973 Program [2013CB329404]
  2. National Natural Science Foundation of China [61450001, 61263035, 61573270]
  3. Guangxi Natural Science Foundation [2012GXNSFGA060004, 2015GXNSFCB139011]
  4. China Postdoctoral Science Foundation [2015M57570837]
  5. Guangxi 100 Plan
  6. Guangxi Collaborative Innovation Center of Multi-Source Information Integration and Intelligent Processing
  7. Guangxi Bagui Scholar Teams for Innovation and Research Project

向作者/读者索取更多资源

K nearest neighbors (kNN) is an efficient lazy learning algorithm and has successfully been developed in real applications. It is natural to scale the kNN method to the large scale datasets. In this paper, we propose to first conduct a k-means clustering to separate the whole dataset into several parts, each of which is then conducted kNN classification. We conduct sets of experiments on big data and medical imaging data. The experimental results show that the proposed kNN classification works well in terms of accuracy and efficiency. (C) 2016 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据