我们将要为我们的最近邻示例使用的数据集应该看起来非常熟悉—这个数据集就与我们在上一篇文章的分类示例中所用的相同。

The data set we'll use for our Nearest Neighbor example should look familiar - it's the same data set we used for our classification example in the previous article.

youdao

分类，如我们在前一篇文章的例子中看到的，使用每个数据实例来创建树，我们需要遍历此树才能找到答案。

Classification, as we saw from the example in the previous article, USES every data instance to create a tree, which we would traverse to find our answer.

youdao

已有多篇有关向后兼容的变更与不向后兼容的变更的分类主题的论文发表(请参阅参考资料)。

Several papers have been published on the subject of classification of backward compatible versus backward incompatible changes (See Resources).

youdao