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

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

de.lmu.ifi.dbs.elki.algorithm.clustering	Clustering algorithms Clustering algorithms are supposed to implement the Algorithm-Interface.
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation	Correlation clustering algorithms
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 used by de.lmu.ifi.dbs.elki.algorithm.clustering

ClusteringAlgorithm
Interface for Algorithms that are capable to provide a Clustering as Result.

DeLiClu.SpatialObjectPair
Encapsulates an entry in the cluster order.

OPTICS.COEntry
Encapsulates an entry in the cluster order.

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

ClusteringAlgorithm
Interface for Algorithms that are capable to provide a Clustering as Result.

ProjectedDBSCAN
Provides an abstract algorithm requiring a VarianceAnalysisPreprocessor.

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

ClusteringAlgorithm
Interface for Algorithms that are capable to provide a Clustering as Result.

OPTICS
OPTICS provides the OPTICS algorithm.

ProjectedDBSCAN
Provides an abstract algorithm requiring a VarianceAnalysisPreprocessor.