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 NumberVector<V,?>>	Implementation of the CLIQUE algorithm, a grid-based algorithm to identify dense clusters in subspaces of maximum dimensionality.
DiSH<V extends NumberVector<V,?>>	Algorithm for detecting subspace hierarchies.
HiSC<V extends NumberVector<V,?>>	Implementation of the HiSC algorithm, an algorithm for detecting hierarchies of subspace clusters.
PreDeCon<V extends NumberVector<V,?>>	PreDeCon computes clusters of subspace preference weighted connected points.
PROCLUS<V extends NumberVector<V,?>>	Provides the PROCLUS algorithm, an algorithm to find subspace clusters in high dimensional spaces.
ProjectedClustering<V extends NumberVector<V,?>>	Abstract superclass for projected clustering algorithms, like PROCLUS and ORCLUS.
SUBCLU<V extends NumberVector<V,?>,D extends Distance<D>>	Implementation of the SUBCLU algorithm, an algorithm to detect arbitrarily shaped and positioned clusters in subspaces.

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.