How to implement the Nearest Subspace algorithm

2 次查看（过去 30 天）
Idil Selin
Idil Selin 2013-6-7
Dear all, I am comparing the performance of different classifiers on the same train and test samples: the Nearest Neightbour (NN), Nearest Subspace (NS) and Support Vector Machine (SVM).
I implemented the NS simply # by projecting the test sample into the subpace # comparing the norms, and # assigning the test sample to the nearby subspace.
In pseudo-code:
winner_subspace=1;
proj_test=test'*subspace_1
for i=2: total_number_subspace
Calculate the subspace_i
proj_temp=test'*subspace_i
if norm(proj_temp)<norm(proj_test)
winner_subspace=i;
end
end
The obtained performance is too low ... where is the mistake? Thank you in advance, Idil

请先登录，再回答此问题。

回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Classification 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by