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

Package to collect algorithms for clustering in axis-parallel subspaces, suitable as a task for the KDDTask main routine.

See:
Description

Class Summary

CLIQUE<V extends RealVector<V,?>>	Implementation of the CLIQUE algorithm, a grid-based algorithm to identify dense clusters in subspaces of maximum dimensionality.
DiSH<V extends RealVector<V,?>>	Algorithm for detecting subspace hierarchies.
PreDeCon<V extends RealVector<V,?>>	PreDeCon computes clusters of subspace preference weighted connected points.
PROCLUS<V extends RealVector<V,?>>	PROCLUS provides the PROCLUS algorithm.
ProjectedClustering<V extends RealVector<V,?>>	Abstract superclass for PROCLUS and ORCLUS.

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

Package to collect algorithms for clustering in axis-parallel subspaces, suitable as a task for the KDDTask main routine.

The clustering algorithms in this package are instances of both, projected clustering algorithms or subspace clsutering algorithms according to the classical but somewhat obsolete classification schema of clustering algorithms for axis-parallel subspaces.