Modifier and Type | Interface and Description |
---|---|
interface |
HardAssigner<DATATYPE,DISTANCES,DISTANCE_INDEX>
The
HardAssigner interface describes classes that assign a spatial
point to a single cluster. |
interface |
SoftAssigner<DATATYPE,DISTANCES>
The
SoftAssigner interface describes classes that assign a spatial
point to multiple clusters, possibly with weighting. |
Modifier and Type | Class and Description |
---|---|
class |
ConstrainedFloatAssigner<DATATYPE>
An assigner that wraps another hard assigner and only produces valid
assignments if the closest cluster is within (or outside) of a given
threshold distance.
|
class |
ExactByteAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
ExactDoubleAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
ExactFeatureVectorAssigner<T extends FeatureVector>
A
HardAssigner that assigns points to the closest cluster based on
the distance to the centroid. |
class |
ExactFloatAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
ExactIntAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
ExactLongAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
ExactShortAssigner
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
class |
HierarchicalByteHardAssigner
|
class |
HierarchicalDoubleHardAssigner
|
class |
HierarchicalFloatHardAssigner
|
class |
HierarchicalIntHardAssigner
|
class |
HierarchicalLongHardAssigner
|
class |
HierarchicalShortHardAssigner
|
class |
KDTreeByteEuclideanAssigner
A
HardAssigner that uses a ByteNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
class |
KDTreeDoubleEuclideanAssigner
A
HardAssigner that uses a DoubleNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
class |
KDTreeFloatEuclideanAssigner
A
HardAssigner that uses a FloatNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
class |
KDTreeIntEuclideanAssigner
A
HardAssigner that uses a IntNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
class |
KDTreeLongEuclideanAssigner
A
HardAssigner that uses a LongNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
class |
KDTreeShortEuclideanAssigner
A
HardAssigner that uses a ShortNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
Modifier and Type | Class and Description |
---|---|
class |
ByteKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
class |
DoubleKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
class |
FloatKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
class |
HierarchicalBytePathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
HierarchicalDoublePathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
HierarchicalFloatPathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
HierarchicalIntPathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
HierarchicalLongPathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
HierarchicalShortPathAssigner
A
SoftAssigner for gathering the clusters assigned
to a point from a hierarchical clustering. |
class |
IntKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
class |
LongKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
class |
ShortKNNAssigner
A
SoftAssigner that picks a fixed number of nearest neighbours. |
Modifier and Type | Class and Description |
---|---|
class |
ClusterLimitedIntRAC
Similar to
IntRAC but explicitly specify the limit the number of
clusters. |
class |
IntRAC
An implementation of the RAC algorithm proposed by Ramanan and Niranjan.
|
Modifier and Type | Class and Description |
---|---|
class |
IntRandomForest
An implementation of the RandomForest clustering algorithm proposed by Jurie et al.
|