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...

Full description

Bibliographic Details

Published in:	Transactions on combinatorics Vol. 14; no. 3; pp. 135 - 156
Main Authors:	Sepideh Aghamolaei, Mohammad Ghodsi
Format:	Journal Article
Language:	English
Published:	University of Isfahan 2025
Subjects:	clustering massively parallel algorithms near neighbors range searching unit disk graph
ISSN:	2251-8657, 2251-8665
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!