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

Packages that use de.lmu.ifi.dbs.elki.algorithm.clustering.subspace

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.

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace used by de.lmu.ifi.dbs.elki.algorithm.clustering.subspace

CLIQUE

Implementation of the CLIQUE algorithm, a grid-based algorithm to identify dense clusters in subspaces of maximum dimensionality.

DiSH
Algorithm for detecting subspace hierarchies.

HiSC
Implementation of the HiSC algorithm, an algorithm for detecting hierarchies of subspace clusters.

PreDeCon

PreDeCon computes clusters of subspace preference weighted connected points.

PROCLUS

Provides the PROCLUS algorithm, an algorithm to find subspace clusters in high dimensional spaces.

PROCLUS.PROCLUSCluster
Encapsulates the attributes of a cluster.

SUBCLU
Implementation of the SUBCLU algorithm, an algorithm to detect arbitrarily shaped and positioned clusters in subspaces.