Density Adaptive Parallel Clustering
Data Structures and Algorithms
2014-07-14 v1 Machine Learning
Machine Learning
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.
Cite
@article{arxiv.1407.3242,
title = {Density Adaptive Parallel Clustering},
author = {Marcello La Rocca},
journal= {arXiv preprint arXiv:1407.3242},
year = {2014}
}
Comments
5 pages, 4 figures