Density Adaptive Parallel Clustering

2014/07/11 by Marcello La Rocca, La Rocca, Marcello
Computer Science · #91C20 #Advanced Clustering Algorithms Research #D.1.3 #Data Management and Algorithms #Data Mining Algorithms and Applications #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2 #H.3.3 #Machine Learning (cs.LG) #Machine Learning (stat.ML)

paper · pdf · doi:10.48550/arxiv.1407.3242

openalex publication_date 2014/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance a value for k, the number of clusters.

Citations

• Least squares quantization in PCM

Related

• A New Parallel Adaptive Clustering and its Application to Streaming Data
• Distributed Lance-William Clustering Algorithm
• Homogenous and Heterogenous Parallel Clustering: An Overview
• Clustering Based on Density Propagation and Subcluster Merging
• Nearest Neighbour Equilibrium Clustering