Bellare Active Learning (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^{2} logn clogc)$ == Space Complexity == () == Description == Pairwise ER Active Learning == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference == https://dl.acm.org/doi/10.1145/2339530.2339707")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2} logn clogc)$

Space Complexity

()

Description

Pairwise ER Active Learning

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2012

Reference

https://dl.acm.org/doi/10.1145/2339530.2339707