Density-Based clustering in mapReduce with guarantees on parallel time, space, and solution quality
A well-known clustering problem called Density-Based Spatial Clustering of Applications with Noise~(DBSCAN) involves computing the solutions of at least one disk range query per input point, computing the connected components of a graph, and bichromatic fixed-radius nearest neighbor. MapReduce class...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2024-04-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_28264_25c4b7936d8b67c3489a676b9a960418.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|