超级会员免费看
本文介绍了实例基分类器中的最近邻分类器，包括K-最近邻(KNN)的基本原理和操作步骤。KNN算法需要存储训练记录、定义距离度量并选择K值。分类未知记录时，计算其与其他训练记录的距离，选取K个最近邻，通过多数投票确定类别。讨论了选择K值的影响，以及高维数据下欧氏距离的问题和解决方案。此外，提到了PEBLS系统，一种处理连续和名义特征的并行示例学习系统。
Instance Based Classifiers
Examples:
-
Rote-learner
Memorizes entire training data and performs classification only if attributes of record match one of the training examples exactly.
-
Nearest neighbor
Uses k “closest” points(nearest neighbors) for performing classification.
Nearest Neighbor Classifiers
Requires three things
- The set of stored records.
- Distance Metric to compute distance between records.
- The value of k, the number of nearest neighbors to retrieve.
To classify an unknown record
- Compute distance to
订阅专栏 解锁全文
扫一扫
1170
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
