Search Results for author:
Found 1 papers, 0 papers with code
Multidimensional Assignment Problem for multipartite entity resolution
Because the optimization problem is NP-hard, we apply two heuristic procedures, a Greedy algorithm and very large scale neighborhood search, to solve the assignment problem and find the most likely matching of records from multiple datasets into a single entity.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
