Random shuffling while reduce the identical pairs

Question

J T 2020-3-3

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/508829-random-shuffling-while-reduce-the-identical-pairs

评论： Walter Roberson 2020-3-3

采纳的回答： Walter Roberson

在 MATLAB Online 中打开

Hello,

I have a 50-by-1 array like this:

P = [4	5	5	5	5	5	5	5	5	9	9	9	9	9	9	9	27	27	27	35	40	40	40	40	4      5	5	5	5	5	5	5	5	5	9	9	9	9	9	9	27	27	27	35	35	40	40	40	27	9]';

P should be split into two 25-by-1 arrays A and B after shuffling, and, I want to efficiently shuffle P such that the two children arrays, A and B, consider pairing A(i) and B(i) for i = 1:25, there is the least amout of A(i) == B(i).

Could someone help me out here? Thank you very much!

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

请先登录，再进行评论。

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

Answer 1

Walter Roberson 2020-3-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/508829-random-shuffling-while-reduce-the-identical-pairs#answer_418347

在 MATLAB Online 中打开

tries = 1000;
NB = length(B);
[~,perms] = sort(rand(tries, NB),2);
matchcounts = sum(A == B(perms),2);
bestidx = find(matchcounts == min(matchcounts));
best_shuffles = B(perms(bestidx,:));

You could also sort on matchcounts and take however many that you need.

In my test, I got 11 permutations with only a single match each.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Image Analyst 2020-3-3

Why do you want to do this? What is the use case?

Walter Roberson 2020-3-3

在 MATLAB Online 中打开

sP = sort(P(:).');
A = sP(1:end/2);
B = sp(end/2+1:end);
tries = 1000;
NB = length(B);
[~,perms] = sort(rand(tries, NB),2);
matchcounts = sum(A == B(perms),2);
bestidx = find(matchcounts == min(matchcounts));
best_shuffles = B(perms(bestidx,:));

61 entries with overlap 0 in my test.

The above algorithm is not fool-proof. A better algorithm would be to select the value that occurs most often and put all of the copies of it into A, and then to select the second most common value and put all the copies into B, then put all copies of the third most common into A, and so on back and forth, partitioning into non-overlapping sets as much as possible. Ideally you would get A and B that had no overlapping values, in which case every permutation of B would be a total mismatch with every permutation of A.

请先登录，再进行评论。