[Local Model P (h|x)] For the local model, we define cliques as individual nodes, 4 and parameterize each clique potential as Notice that in this model, finding argmax h P (h|x) corresponds to simply finding argmax INPUT: x, true labeling y * , current local model P (h|x) GOAL: Find the highest confidence labeling y such that y * = single-link-clustering(y ) Figure 1: Algorithm to find the highest confidence labeling y that can be clustered to the true labeling y * [Global Model P (y|h)] For the global model, we assume a deterministic clustering algorithm is given.
we focus on single-link clustering, as it has been shown to be effective for coreference resolution (e.g.