code for K Nearest Neighbor algorithm in java

K-Nearest Neighbor datamining code in java

k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of the key data of the multidimensi

使用java实现数据分类算法最近邻分算法knn，没有使用数据库，直接将数据存储在arraylist中-Using java nearest neighbor classification algorithm for data points algorithms knn, do not use a database, the data is stored directly in the arraylist