Faster Clustering with DBSCAN

  • Kryszkiewicz M
  • Skonieczny Ł
N/ACitations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Grouping data into meaningful clusters belongs to important tasks in the area of artificial intelligence and data mining. DBSCAN is recognized as a high quality scalable algorithm for clustering data. It enables determination of clusters of any shape and identification of noise data. In this paper, we propose a method improving the performance of DBSCAN. The usefulness of the method is verified experimentally both for indexed and non-indexed data.

Cite

CITATION STYLE

APA

Kryszkiewicz, M., & Skonieczny, Ł. (2006). Faster Clustering with DBSCAN. In Intelligent Information Processing and Web Mining (pp. 605–614). Springer-Verlag. https://doi.org/10.1007/3-540-32392-9_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free