7. A method according to claim 1 wherein the generating is performed with a clustering algorithm that clusters complete undirected graphs where each edge of a graph is marked with one of four labels comprising a first, second, third, and fourth label, and where the algorithm produces a clustering such that for any edge labeled with the third label the vertices of the edge are placed in the same cluster, for any edge labeled with the fourth label, the vertices of the edge are placed in different clusters, and the sum of number of edges labeled with the first label whose vertices are in different clusters and the number of edges labeled with the second label whose vertices are in the same cluster is minimized.
7. A method according to claim 1 wherein the generating is performed with a clustering algorithm that clusters complete undirected graphs where each edge of a graph is marked with one of four labels comprising a first, second, third, and fourth label, and where the algorithm produces a clustering such that for any edge labeled with the third label the vertices of the edge are placed in the same cluster, for any edge labeled with the fourth label, the vertices of the edge are placed in different clusters, and the sum of number of edges labeled with the first label whose vertices are in different clusters and the number of edges labeled with the second label whose vertices are in the same cluster is minimized. 8. A method according to claim 7 wherein the generating further comprises using an algorithm comprising forward voting and backward propagation to transform the deduplication problem to one or more instances of a clustering problem to be solved by the clustering algorithm.