Next up
Concluding
Continuing in
Clustering Small to Humongous Datasets
This is a preview of subscription content
Your browser needs to be JavaScript capable to view this video
Try reloading this page, or reviewing your browser settings
This video teaches you an important algorithm for clustering really huge datasets. The clustering operations can be parallelized, The intermediate results of scanning the dataset can be reused for multiple queries. STING and CLIQUE algorithms fall under this category. Useful for clustering datasets having many dimensions.
Keywords
- STING
- CLIQUE
- Grid
- query-dependent clustering
- multi-dimensional datasets
- parallerized clustering
About this video
- Author(s)
- Poornachandra Sarang
- First online
- 28 October 2023
- DOI
- https://doi.org/10.1007/978-3-031-49094-1_9
- Online ISBN
- 978-3-031-49094-1
- Publisher
- Springer, Cham
- Copyright information
- © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2023