|
|
|||||||||||||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NumberVector | |
---|---|
de.lmu.ifi.dbs.elki.algorithm | Package to collect algorithms suitable as a task for the KDDTask main routine. |
de.lmu.ifi.dbs.elki.algorithm.clustering | Package collects clustering algorithms. |
de.lmu.ifi.dbs.elki.data | Package collects basic classes for different data types, database object types and label types. |
de.lmu.ifi.dbs.elki.database | Package collects variants of databases and related classes. |
de.lmu.ifi.dbs.elki.distance.distancefunction | Package collects distance functions. |
de.lmu.ifi.dbs.elki.index.tree.spatial | Package collects spatial tree-based index structures. |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants | Package collects variants of the R*-Tree. |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | Package collects classes for the
DeLiCluTree |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn | Package collects classes for the
RdKNNTree |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar | Package collects classes for the
RStarTree |
Uses of NumberVector in de.lmu.ifi.dbs.elki.algorithm |
---|
Classes in de.lmu.ifi.dbs.elki.algorithm with type parameters of type NumberVector | |
---|---|
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. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.algorithm.clustering |
---|
Classes in de.lmu.ifi.dbs.elki.algorithm.clustering with type parameters of type NumberVector | |
---|---|
class |
DeLiClu<O extends NumberVector<O,?>,D extends Distance<D>>
DeLiClu provides the DeLiClu algorithm, a hierachical algorithm to find density-connected sets in a database. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.data |
---|
Classes in de.lmu.ifi.dbs.elki.data with type parameters of type NumberVector | |
---|---|
class |
NumberVector<V extends NumberVector<V,N>,N extends Number>
NumberVector is an abstract implementation of FeatureVector. |
Subclasses of NumberVector in de.lmu.ifi.dbs.elki.data | |
---|---|
class |
BitVector
Provides a BitVector wrapping a BitSet. |
class |
DoubleVector
A DoubleVector is to store real values approximately as double values. |
class |
FloatVector
A FloatVector is to store real values approximately as float values. |
class |
ParameterizationFunction
A parameterization function decribes all lines in a d-dimensional feature space intersecting in one point p. |
class |
RealVector<V extends RealVector<V,N>,N extends Number>
RealVector is an abstract super class for all feature vectors having real numbers as values. |
class |
SparseDoubleVector
A SparseDoubleVector is to store real values approximately as double values. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.database |
---|
Classes in de.lmu.ifi.dbs.elki.database with type parameters of type NumberVector | |
---|---|
class |
SpatialIndexDatabase<O extends NumberVector<O,?>,N extends SpatialNode<N,E>,E extends SpatialEntry>
SpatialIndexDatabase is a database implementation which is supported by a spatial index structure. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.distance.distancefunction |
---|
Classes in de.lmu.ifi.dbs.elki.distance.distancefunction with type parameters of type NumberVector | |
---|---|
class |
AbstractDimensionsSelectingDoubleDistanceFunction<V extends NumberVector<V,?>>
Provides a distance function that computes the distance (which is a double distance) between feature vectors only in specified dimensions. |
class |
DimensionsSelectingEuklideanDistanceFunction<V extends NumberVector<V,?>>
Provides a distance function that computes the Euklidean distance between feature vectors only in specified dimensions. |
class |
EuklideanDistanceFunction<T extends NumberVector<T,?>>
Provides the Euklidean distance for FeatureVectors. |
class |
ManhattanDistanceFunction<T extends NumberVector<T,?>>
Manhattan distance function to compute the Manhattan distance for a pair of NumberVectors. |
class |
WeightedDistanceFunction<O extends NumberVector<O,?>>
Provides the Weighted distance for feature vectors. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.index.tree.spatial |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.spatial with type parameters of type NumberVector | |
---|---|
class |
SpatialIndex<O extends NumberVector<O,?>,N extends SpatialNode<N,E>,E extends SpatialEntry>
Abstract super class for all spatial index classes. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants with type parameters of type NumberVector | |
---|---|
class |
AbstractRStarTree<O extends NumberVector<O,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
Abstract superclass for index structures based on a R*-Tree. |
class |
NonFlatRStarTree<O extends NumberVector<O,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
Abstract superclass for all non-flat R*-Tree variants. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu with type parameters of type NumberVector | |
---|---|
class |
DeLiCluTree<O extends NumberVector<O,?>>
DeLiCluTree is a spatial index structure based on an R-TRee. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn with type parameters of type NumberVector | |
---|---|
class |
RdKNNTree<O extends NumberVector<O,?>,D extends NumberDistance<D>>
RDkNNTree is a spatial index structure based on the concepts of the R*-Tree supporting efficient processing of reverse k nearest neighbor queries. |
Uses of NumberVector in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar with type parameters of type NumberVector | |
---|---|
class |
RStarTree<O extends NumberVector<O,?>>
RStarTree is a spatial index structure based on the concepts of the R*-Tree. |
|
|
||||||||||||
PREV NEXT | FRAMES NO FRAMES |