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

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

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,?>>	Provides the PROCLUS algorithm, an algorithm to find subspace clusters in high dimensional spaces.
ProjectedClustering<V extends RealVector<V,?>>	Abstract superclass for projected clustering algorithms, like PROCLUS and ORCLUS.

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

Axis-parallel subspace clustering algorithms

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