Gupta & Sarawagi CRF (Entity Resolution Entity Resolution)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{3}k)$

Space Complexity

$O(nk)$? words

(Derived: Creates an intermediate "consolidated" table that it manipulates/reorders to get final output)

Description

Bipartite method to compute pairwise ER

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2009

Reference

https://doi.org/10.14778/1687627.1687661