基于欧式距离的最近邻改进算法

Improved kNN Algorithm Based on Euclidean Distance

依托欧拉距离,使用杂合距离算法改进Minkowski距离公式,使得最近邻算法能够针对不同实际需要计算两事例距离,适用到属性是混合型的情形,也能避免时序列中出现的错误计算问题。

Based on Euclidean distance,a hybrid method was employed by making k Nearest Neighbor（kNN） algorithm available to calculate the distance between two instances.The proposed method can be applied for the case with all kinds of data and avoid the mistake computation in the time series data.