Uses of Class
de.lmu.ifi.dbs.elki.utilities.documentation.Reference

Packages that use Reference

de.lmu.ifi.dbs.elki.algorithm	Algorithms suitable as a task for the KDDTask main routine.
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.
de.lmu.ifi.dbs.elki.algorithm.outlier	Outlier detection algorithms
de.lmu.ifi.dbs.elki.application.visualization	Visualization applications in ELKI.
de.lmu.ifi.dbs.elki.distance.distancefunction.colorhistogram	Distance functions using correlations.
de.lmu.ifi.dbs.elki.distance.distancefunction.timeseries	Distance functions designed for time series.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree	MTree
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar	RStarTree
de.lmu.ifi.dbs.elki.math.linearalgebra.pca	Principal Component Analysis (PCA) and Eigenvector processing.
de.lmu.ifi.dbs.elki.utilities.documentation	Documentation utilities: Annotations for Title, Description, Reference
de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d	Visualizers based on 2D projections.

Uses of Reference in de.lmu.ifi.dbs.elki.algorithm

Classes in de.lmu.ifi.dbs.elki.algorithm with annotations of type Reference

class	APRIORI Provides the APRIORI algorithm for Mining Association Rules.
class	DependencyDerivator<V extends NumberVector<V,?>,D extends Distance<D>> Dependency derivator computes quantitatively linear dependencies among attributes of a given dataset based on a linear correlation PCA.

Uses of Reference in de.lmu.ifi.dbs.elki.algorithm.clustering

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering with annotations of type Reference

class	DBSCAN<O extends DatabaseObject,D extends Distance<D>> DBSCAN provides the DBSCAN algorithm, an algorithm to find density-connected sets in a database.
class	DeLiClu<O extends NumberVector<O,?>,D extends Distance<D>> DeLiClu provides the DeLiClu algorithm, a hierarchical algorithm to find density-connected sets in a database.
class	EM<V extends NumberVector<V,?>> Provides the EM algorithm (clustering by expectation maximization).
class	KMeans<D extends Distance<D>,V extends NumberVector<V,?>> Provides the k-means algorithm.
class	OPTICS<O extends DatabaseObject,D extends Distance<D>> OPTICS provides the OPTICS algorithm.
class	SLINK<O extends DatabaseObject,D extends Distance<D>> Efficient implementation of the Single-Link Algorithm SLINK of R.
class	SNNClustering<O extends DatabaseObject,D extends Distance<D>> Shared nearest neighbor clustering.

Uses of Reference in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation with annotations of type Reference

class	CASH Provides the CASH algorithm, an subspace clustering algorithm based on the hough transform.
class	COPAC<V extends NumberVector<V,?>> Provides the COPAC algorithm, an algorithm to partition a database according to the correlation dimension of its objects and to then perform an arbitrary clustering algorithm over the partitions.
class	ERiC<V extends NumberVector<V,?>> Performs correlation clustering on the data partitioned according to local correlation dimensionality and builds a hierarchy of correlation clusters that allows multiple inheritance from the clustering result.
class	FourC<O extends NumberVector<O,?>> 4C identifies local subgroups of data objects sharing a uniform correlation.
class	HiCO<V extends NumberVector<V,?>> Implementation of the HiCO algorithm, an algorithm for detecting hierarchies of correlation clusters.
class	ORCLUS<V extends NumberVector<V,?>> ORCLUS provides the ORCLUS algorithm, an algorithm to find clusters in high dimensional spaces.

Uses of Reference in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace with annotations of type Reference

class	CLIQUE<V extends NumberVector<V,?>> Implementation of the CLIQUE algorithm, a grid-based algorithm to identify dense clusters in subspaces of maximum dimensionality.
class	DiSH<V extends NumberVector<V,?>> Algorithm for detecting subspace hierarchies.
class	HiSC<V extends NumberVector<V,?>> Implementation of the HiSC algorithm, an algorithm for detecting hierarchies of subspace clusters.
class	PreDeCon<V extends NumberVector<V,?>> PreDeCon computes clusters of subspace preference weighted connected points.
class	PROCLUS<V extends NumberVector<V,?>> Provides the PROCLUS algorithm, an algorithm to find subspace clusters in high dimensional spaces.
class	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.

Uses of Reference in de.lmu.ifi.dbs.elki.algorithm.outlier

Classes in de.lmu.ifi.dbs.elki.algorithm.outlier with annotations of type Reference

class	ABOD<V extends NumberVector<V,?>> Angle-Based Outlier Detection Outlier detection using variance analysis on angles, especially for high dimensional data sets.
class	DBOutlierDetection<O extends DatabaseObject,D extends Distance<D>> Simple distanced based outlier detection algorithm.
class	DBOutlierScore<O extends DatabaseObject,D extends Distance<D>> Compute percentage of neighbors in the given neighborhood with size d.
class	GaussianUniformMixture<V extends NumberVector<V,Double>> Outlier detection algorithm using a mixture model approach.
class	INFLO<O extends DatabaseObject> INFLO provides the Mining Algorithms (Two-way Search Method) for Influence Outliers using Symmetric Relationship Reference: Jin, W., Tung, A., Han, J., and Wang, W. 2006 Ranking outliers using symmetric neighborhood relationship< br/> In Proc.
class	KNNOutlier<O extends DatabaseObject,D extends DoubleDistance> Outlier Detection based on the distance of an object to its k nearest neighbor.
class	KNNWeightOutlier<O extends DatabaseObject,D extends DoubleDistance> Outlier Detection based on the accumulated distances of a point to its k nearest neighbors.
class	LDOF<O extends DatabaseObject> Computes the LDOF (Local Distance-Based Outlier Factor) for all objects of a Database.
class	LOCI<O extends DatabaseObject,D extends NumberDistance<D,?>> Fast Outlier Detection Using the "Local Correlation Integral".
class	LOF<O extends DatabaseObject,D extends NumberDistance<D,?>> Algorithm to compute density-based local outlier factors in a database based on a specified parameter LOF.K_ID (-lof.k).
class	LoOP<O extends DatabaseObject> LoOP: Local Outlier Probabilities Distance/density based algorithm similar to LOF to detect outliers, but with statistical methods to achieve better result stability.
class	OPTICSOF<O extends DatabaseObject> OPTICSOF provides the Optics-of algorithm, an algorithm to find Local Outliers in a database.
class	ReferenceBasedOutlierDetection<V extends NumberVector<V,N>,N extends Number> provides the Reference-Based Outlier Detection algorithm, an algorithm that computes kNN distances approximately, using reference points.
class	SOD<V extends NumberVector<V,?>,D extends Distance<D>>

Uses of Reference in de.lmu.ifi.dbs.elki.application.visualization

Classes in de.lmu.ifi.dbs.elki.application.visualization with annotations of type Reference

class

KNNExplorer<O extends NumberVector<?,?>,D extends NumberDistance<D,N>,N extends Number> User application to explore the k Nearest Neighbors for a given data set and distance function.

Uses of Reference in de.lmu.ifi.dbs.elki.distance.distancefunction.colorhistogram

Classes in de.lmu.ifi.dbs.elki.distance.distancefunction.colorhistogram with annotations of type Reference

class

HistogramIntersectionDistanceFunction<V extends NumberVector<V,?>> Intersection distance for color histograms.

Uses of Reference in de.lmu.ifi.dbs.elki.distance.distancefunction.timeseries

Classes in de.lmu.ifi.dbs.elki.distance.distancefunction.timeseries with annotations of type Reference

class

LCSSDistanceFunction<V extends NumberVector<V,?>> Provides the Longest Common Subsequence distance for FeatureVectors.

Uses of Reference in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree with annotations of type Reference

class

MTree<O extends DatabaseObject,D extends Distance<D>> MTree is a metrical index structure based on the concepts of the M-Tree.

Uses of Reference in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar with annotations of type Reference

class

RStarTree<O extends NumberVector<O,?>> RStarTree is a spatial index structure based on the concepts of the R*-Tree.

Uses of Reference in de.lmu.ifi.dbs.elki.math.linearalgebra.pca

Classes in de.lmu.ifi.dbs.elki.math.linearalgebra.pca with annotations of type Reference

class

WeightedCovarianceMatrixBuilder<V extends NumberVector<V,?>,D extends NumberDistance<D,?>> CovarianceMatrixBuilder with weights.

Uses of Reference in de.lmu.ifi.dbs.elki.utilities.documentation

Methods in de.lmu.ifi.dbs.elki.utilities.documentation that return Reference

static Reference

DocumentationUtil.getReference(Class<?> c) Get the reference annotation of a class, or null.

Uses of Reference in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d

Classes in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d with annotations of type Reference

class

BubbleVisualizer<NV extends NumberVector<NV,?>> Generates a SVG-Element containing bubbles.