Package de.lmu.ifi.dbs.elki.algorithm.clustering.gdbscan

Generalized DBSCAN.

See: Description


Package de.lmu.ifi.dbs.elki.algorithm.clustering.gdbscan Description

Generalized DBSCAN.

Generalized DBSCAN is an abstraction of the original DBSCAN idea, that allows the use of arbitrary "neighborhood" and "core point" predicates. For each object, the neighborhood as defined by the "neighborhood" predicate is retrieved - in original DBSCAN, this is the objects within an epsilon sphere around the query object. Then the core point predicate is evaluated to decide if the object is considered dense. If so, a cluster is started (or extended) to include the neighbors as well.

Reference:
Jörg Sander, Martin Ester, Hans-Peter Kriegel, Xiaowei Xu:
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
In: Data Mining and Knowledge Discovery, 1998.

Release 0.6.0 (2014-01-10_1610)