Nearest Neighbor Matching without Replacement
显示 更早的评论
Hello there,
I am looking to match data in two vectors, x and y, based on shortest Euclidean distance. Each match should be unique; that is, numbers in vectors x and y cannot be matched twice. I have looked into knnsearch, but have not found anything that suggests the function works without replacement. Thank you!
3 个评论
KSSV
2016-12-8
Well, it means for each point you want only one nearest neighbor and this neighbor should not be neighbor to any other point. Is it? If so you have to violate shortest Eucldean distance if neighbor repeats.
Phillip
2018-3-30
It does not violate the shortest distance if it is removed from the set once matched (what Al is referring too when he says " without Replacement").
Peng Li
2020-3-31
any update here? also was wondering if there is a way to do knn search without replacement.
回答（2 个）
neuroDuck
2022-2-25
A late response, but for anyone that might come across this in future, I think a brute force approach should work, with the following code, assuming you don't have too many comparisons to go through:
[cIdx] = unique(knnsearch(x,y));
% brute force knnsearch to do without replacements
startingK = 2;
while length(cIdx)<length(y)
[cIdx] = unique(knnsearch(x,y,'k',startingK));
startingK = startingK + 1;
end
If you have R2019a release
x=rand(1,10)
y=rand(1,10)
C=abs(x(:)-y(:).');
M = matchpairs(C,max(C(:)));
px = M(:,1);
xm = x(px)
d = abs(xm-y)
类别
在 帮助中心 和 File Exchange 中查找有关 Nearest Neighbors 的更多信息
2022-2-25
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
