|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AbstractDistanceBasedAlgorithm | |
---|---|
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.algorithm.outlier.spatial | Spatial outlier detection algorithms |
de.lmu.ifi.dbs.elki.algorithm.statistics | Statistical analysis algorithms The algorithms in this package perform statistical analysis of the data (e.g. compute distributions, distance distributions etc.) |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm | |
---|---|
class |
KNNDistanceOrder<O,D extends Distance<D>>
Provides an order of the kNN-distances for all objects within the database. |
class |
KNNJoin<V extends NumberVector<V,?>,D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>
Joins in a given spatial database to each object its k-nearest neighbors. |
class |
MaterializeDistances<O,D extends NumberDistance<D,?>>
Algorithm to materialize all the distances in a data set. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering | |
---|---|
class |
DBSCAN<O,D extends Distance<D>>
DBSCAN provides the DBSCAN algorithm, an algorithm to find density-connected sets in a database. |
class |
DeLiClu<NV extends NumberVector<NV,?>,D extends Distance<D>>
DeLiClu provides the DeLiClu algorithm, a hierarchical algorithm to find density-connected sets in a database. |
class |
OPTICS<O,D extends Distance<D>>
OPTICS provides the OPTICS algorithm. |
class |
SLINK<O,D extends Distance<D>>
Efficient implementation of the Single-Link Algorithm SLINK of R. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation | |
---|---|
class |
HiCO<V extends NumberVector<V,?>>
Implementation of the HiCO algorithm, an algorithm for detecting hierarchies of correlation clusters. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace | |
---|---|
class |
HiSC<V extends NumberVector<V,?>>
Implementation of the HiSC algorithm, an algorithm for detecting hierarchies of subspace clusters. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.outlier |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.outlier | |
---|---|
class |
ABOD<V extends NumberVector<V,?>>
Angle-Based Outlier Detection Outlier detection using variance analysis on angles, especially for high dimensional data sets. |
class |
AbstractDBOutlier<O,D extends Distance<D>>
Simple distance based outlier detection algorithms. |
class |
DBOutlierDetection<O,D extends Distance<D>>
Simple distanced based outlier detection algorithm. |
class |
DBOutlierScore<O,D extends Distance<D>>
Compute percentage of neighbors in the given neighborhood with size d. |
class |
INFLO<O,D extends NumberDistance<D,?>>
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 In Proc. |
class |
KNNOutlier<O,D extends NumberDistance<D,?>>
Outlier Detection based on the distance of an object to its k nearest neighbor. |
class |
KNNWeightOutlier<O,D extends NumberDistance<D,?>>
Outlier Detection based on the accumulated distances of a point to its k nearest neighbors. |
class |
LDOF<O,D extends NumberDistance<D,?>>
Computes the LDOF (Local Distance-Based Outlier Factor) for all objects of a Database. |
class |
LOCI<O,D extends NumberDistance<D,?>>
Fast Outlier Detection Using the "Local Correlation Integral". |
class |
OPTICSOF<O,D extends NumberDistance<D,?>>
OPTICSOF provides the Optics-of algorithm, an algorithm to find Local Outliers in a database. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial | |
---|---|
class |
CTLuGLSBackwardSearchAlgorithm<V extends NumberVector<?,?>,D extends NumberDistance<D,?>>
GLS-Backward Search is a statistical approach to detecting spatial outliers. |
class |
CTLuRandomWalkEC<N,D extends NumberDistance<D,?>>
Spatial outlier detection based on random walks. |
Uses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.statistics |
---|
Subclasses of AbstractDistanceBasedAlgorithm in de.lmu.ifi.dbs.elki.algorithm.statistics | |
---|---|
class |
DistanceStatisticsWithClasses<O,D extends NumberDistance<D,?>>
Algorithm to gather statistics over the distance distribution in the data set. |
class |
EvaluateRankingQuality<V extends NumberVector<V,?>,D extends NumberDistance<D,?>>
Evaluate a distance function with respect to kNN queries. |
class |
RankingQualityHistogram<O,D extends NumberDistance<D,?>>
Evaluate a distance function with respect to kNN queries. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |