| sinkhorn_to_assignment | R Documentation |
Convert a soft transport plan from sinkhorn() to a hard 1-to-1 assignment
using greedy rounding.
sinkhorn_to_assignment(result)
result |
Either a result from |
Greedy rounding iteratively assigns each row to its most probable column,
ensuring no column is assigned twice. This may not give the globally optimal
hard assignment; for that, use the transport plan as a cost matrix with
assignment().
Integer vector of column assignments (1-based), same format as
assignment().
sinkhorn()
cost <- matrix(c(1, 2, 3, 4, 5, 6, 7, 8, 9), nrow = 3, byrow = TRUE)
result <- sinkhorn(cost, lambda = 20)
hard_match <- sinkhorn_to_assignment(result)
print(hard_match)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.