%-------------------------------------------------------------
% K-Nearest Neighbours demo
% Original Author: David Ross
% Modified by: Debajyoti Ray
%-------------------------------------------------------------
%% Parameters for training and testing data
X_MAX = 50;
Y_MAX = 50;
NUM_TRAIN = 130;
RANDOM_LABELS = 0;
%-------------------------------------------------------------
% Generate the test points, on a regular grid.
%-------------------------------------------------------------
[test_x, test_y] = meshgrid(1:X_MAX, 1:Y_MAX);
data_test = [test_x(:) test_y(:)]';
scatter(data_test(1,:), data_test(2,:), 'k.');
%-------------------------------------------------------------
% Generate random training points.
%-------------------------------------------------------------
data_train = zeros(2,NUM_TRAIN);
data_train(1,:) = rand(1,NUM_TRAIN)*X_MAX;
data_train(2,:) = rand(1,NUM_TRAIN)*Y_MAX;
if RANDOM_LABELS
label_train = (rand(1,NUM_TRAIN) >= 0.5);
else
% label the training points according to the following quadratic function
label_train = data_train(2,:) >= ((data_train(1,:) - X_MAX/2).^2 /4 + 3);
% add label noise
label_train = xor(label_train, (rand(size(label_train)) >= 0.8));
end
plot_train(data_train, label_train);
%-------------------------------------------------------------
% Run kNN for various values of k, plotting the results
%-------------------------------------------------------------
set(gcf,'doublebuffer', 'on');
for k = [1 3 5 7 9]
label_test = knn(k, data_train, label_train, data_test);
disp('press any key to continue'); pause;
clf;
title(sprintf('%d Nearest Neighbours', k));
plot_test(data_test, label_test);
plot_train(data_train, label_train);
hold on;
contour(reshape(label_test,[X_MAX Y_MAX]));
hold off;
end
knn.rar_K._k-d_k-d树
版权申诉
133 浏览量
2022-09-20
20:22:27
上传
评论
收藏 2KB RAR 举报
小贝德罗
- 粉丝: 69
- 资源: 1万+
最新资源
- pta题库答案c语言之排序4统计工龄.zip
- pta题库答案c语言之树结构7堆中的路径.zip
- pta题库答案c语言之树结构3TreeTraversalsAgain.zip
- pta题库答案c语言之树结构2ListLeaves.zip
- pta题库答案c语言之树结构1树的同构.zip
- 基于C++实现民航飞行与地图简易管理系统可执行程序+说明+详细注释.zip
- pta题库答案c语言之复杂度1最大子列和问题.zip
- 三维装箱问题(Three-Dimensional Bin Packing Problem,3D-BPP)是一个经典的组合优化问题
- 以下是一些关于Linux线程同步的基本概念和方法.txt
- 以下是一个简化的示例,它使用pygame库来模拟烟花动画的框架.txt
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈