Mapping locations of similar rows in two matrices

Question

Patrick Mboma 2014-11-1

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/160889-mapping-locations-of-similar-rows-in-two-matrices

评论： Patrick Mboma 2014-11-1

Dear all,

I have two matrices A and B of respective sizes [na,m] and [nb,m], with na>=nb. Both matrices have the same number of columns. All the rows in B are unique while the rows in A can be duplicated, but are all members of B. I would like to create a mapping between A and B and one very inefficient way to do that is as follows:

out=nan(na,1);
for ii=1:na
    % for each row of A, I search its location in B
    out(ii)=find(all(bsxfun(@minus,A(ii,:),B),2)==0);
end

This works well but becomes prohibitively expensive for large na and nb. And so my question is whether there is a way of getting rid of the for loop and/or creating this mapping differently.

Thanks,

P.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

Answer 1

Guillaume 2014-11-1

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/160889-mapping-locations-of-similar-rows-in-two-matrices#answer_157326

在 MATLAB Online 中打开

This is exactly what ismember is for. The 2nd output argument will give you the locations:

[~, out] = ismember(A, B, 'rows');

4 个评论
显示 2更早的评论隐藏 2更早的评论

Guillaume 2014-11-1

For that specialised function to be any faster than ismember you would have to write it as a mex file.

And if ismember(..., 'rows') is implemented efficiently, it's possible the only saving you could get would be to skip the parsing of the 'rows' argument

Patrick Mboma 2014-11-1