hungarian_cc: Compute the hungarian matrix

In simonsays1980/finmix: An R package for Bayesian estimation of finite mixture distributions

Description

This function calls an implementation of the Hungarian algorithm by Munkres. The Hungarian algorithm solves a weighted assignment problem on a bipartite graph. Note, here this algorithm is used in the re-labeling algorithm by Stephens (1997b).

Usage

hungarian_cc(cost)

Arguments

cost	A matrix containing the costs for each row source and column target.

Value

An integer matrix defining the best solution to the assignment problem.

References

• Stephens, Matthew (1997b), "Dealing with Label-Switching in Mixture Models", Journal of the Royal Statistical Society Series B, 62(4)

See Also

• mcmcpermute() for the calling function

• mcmcestimate() for the function that uses the re-labeling algorithm by Stephens (1997b)

simonsays1980/finmix documentation built on Dec. 23, 2021, 2:25 a.m.