Fellegi & Sunter Model (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 == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1969 == Reference == https://www.tandfonline.com/doi/abs/10.1080/01621459.1969.10501049")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3}k)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1969

Reference

https://www.tandfonline.com/doi/abs/10.1080/01621459.1969.10501049

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