Gupta & Sarawagi CRF (Entity Resolution Entity Resolution)

From Algorithm Wiki

Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3}k)$ == Space Complexity == () == Description == Bipartite method to compute pairwise ER == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2009 == Reference == https://doi.org/10.14778/1687627.1687661")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3}k)$

Space Complexity

()

Description

Bipartite method to compute pairwise ER

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2009

Reference

https://doi.org/10.14778/1687627.1687661

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gupta_%26_Sarawagi_CRF_(Entity_Resolution_Entity_Resolution)&oldid=45450"