Chen Ensembles of classifiers (Entity Resolution Entity Resolution): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n^{2} logn)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(n^{2} logn)$
$O(n^{2} \log n)$


== Space Complexity ==  
== Space Complexity ==  


   
  words


()
()
Line 23: Line 23:
== Model of Computation ==  
== Model of Computation ==  


 
Word RAM


== Year ==  
== Year ==  

Latest revision as of 08:57, 10 April 2023

Time Complexity

$O(n^{2} \log n)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference