Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O({1})$ words (Derived: For SVM, only need to store a constant number of support vectors) == Description == SVM string similarity == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/956750.956759")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O({1})$ words

(Derived: For SVM, only need to store a constant number of support vectors)

Description

SVM string similarity

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/956750.956759

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Adaptive_Duplicate_Detection_Algorithm_(ADD)_(Duplicate_Elimination_Duplicate_Elimination)&oldid=45483"