relabel_samples.m~

来自「一个用EM算法的源程序」· M~ 代码 · 共 34 行

function [bestMapping, errorProbability] = relabel_samples(aprioriSampleLabels, computedSampleLabels, subspaceDimensions)
%function [bestMapping, errorProbability, groupError] = relabel_samples(aprioriSampleLabels, computedSampleLabels, subspaceDimensions)
%
% Attempts to find a good mapping between two sets of sample labels based on their
% grouping alone. A valid permutation vector will be returned in all cases.
% 
% The function is restricted to only permute subspaces of equal dimensions.

groupCount = length(subspaceDimensions);
computedSampleFrequencies = histc(computedSampleLabels, 1:groupCount);
sampleCount = length(aprioriSampleLabels);
errorProbability = 1;
newSampleLabels = zeros(1,sampleCount);

% Generate all legal permutations. No cross permutation of different
% dimensions
for dimensionIndex=1:ambientDimension-1
    allPermutations = perms(1:groupCount);
end


embedded = groupCount*(computedSampleLabels - 1) + (aprioriSampleLabels - 1);
histogram = histc(embedded, 0:groupCount^2 - 1);
for permutationIndex = 1 : size(allPermutations, 1)
    correct = 0;
    mapping = allPermutations(permutationIndex, :);

    correct = sum(histogram(groupCount*(0:groupCount-1) + mapping)) / sampleCount;
    
    if (correct > 1 - errorProbability)
        errorProbability = 1 - correct;
        bestMapping = mapping;
    end
end