Two-point-based binary search trees for accelerating big data classification using KNN
Sign Up to like & getrecommendations! Published in 2018 at "PLoS ONE"
DOI: 10.1371/journal.pone.0207772
Abstract: Big data classification is very slow when using traditional machine learning classifiers, particularly when using a lazy and slow-by-nature classifier such as the k-nearest neighbors algorithm (KNN). This paper proposes a new approach which is… read more here.
Keywords: big data; classification; using knn; data classification ... See more keywords