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

Class	Description
CLIQUE<V extends NumberVector<V,?>>	Implementation of the CLIQUE algorithm, a grid-based algorithm to identify dense clusters in subspaces of maximum dimensionality.
CLIQUE.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.
DiSH<V extends NumberVector<V,?>>	Algorithm for detecting subspace hierarchies.
DiSH.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.
HiSC<V extends NumberVector<V,?>>	Implementation of the HiSC algorithm, an algorithm for detecting hierarchies of subspace clusters.
HiSC.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.
PreDeCon<V extends NumberVector<V,?>>	PreDeCon computes clusters of subspace preference weighted connected points.
PreDeCon.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.
PROCLUS<V extends NumberVector<V,?>>	Provides the PROCLUS algorithm, an algorithm to find subspace clusters in high dimensional spaces.
PROCLUS.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.
SUBCLU<V extends NumberVector<V,?>>	Implementation of the SUBCLU algorithm, an algorithm to detect arbitrarily shaped and positioned clusters in subspaces.
SUBCLU.Parameterizer<V extends NumberVector<V,?>>	Parameterization class.

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.