diff options
| author | TheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com> | 2024-04-29 22:06:12 -0400 |
|---|---|---|
| committer | TheSiahxyz <164138827+TheSiahxyz@users.noreply.github.com> | 2024-04-29 22:06:12 -0400 |
| commit | 4d53fa14ee0cd615444aca6f6ba176e0ccc1b5be (patch) | |
| tree | 4d9f0527d9e6db4f92736ead0aa9bb3f840a0f89 /SI/Resource/Fundamentals of Data Mining/Content/Complexity.md | |
init
Diffstat (limited to 'SI/Resource/Fundamentals of Data Mining/Content/Complexity.md')
| -rw-r--r-- | SI/Resource/Fundamentals of Data Mining/Content/Complexity.md | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/SI/Resource/Fundamentals of Data Mining/Content/Complexity.md b/SI/Resource/Fundamentals of Data Mining/Content/Complexity.md new file mode 100644 index 0000000..e73595a --- /dev/null +++ b/SI/Resource/Fundamentals of Data Mining/Content/Complexity.md @@ -0,0 +1,25 @@ +--- +id: Complexity +aliases: + - Computational/Time Complexity +tags: [] +--- + +## Computational/Time Complexity + +- K-Medoids: + - PAM: $O(K(n - k)^2)$ +- Kernel K-Means: + - Computational complexity (time and space) is higher than K-Means + - Need to compute and store n x n kernel matrix generated from the kernel + function on the original data, where n is the number of points +- Hierarchical Clustering: + - Agglomerative Clustering + - Time complexity: $O(n^2)$ + - Algorithmic Complexity: $O(m^2logm)$ +- Density-based Clustering: + - DBSCAN: + - Computational complexity: $O(nlogn)$ + - worst case: $O(n^2)$ + - OPTICS: + - Complexity: $O(NlogN)$ |
