Class | Description |
---|---|
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.
|
ExactByteAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
ExactDoubleAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
ExactFeatureVectorAssigner<T extends FeatureVector> |
A
HardAssigner that assigns points to the closest cluster based on
the distance to the centroid. |
ExactFloatAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
ExactIntAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
ExactLongAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
ExactShortAssigner |
A
HardAssigner that assigns points to the closest
cluster based on the distance to the centroid. |
HierarchicalByteHardAssigner | |
HierarchicalDoubleHardAssigner | |
HierarchicalFloatHardAssigner | |
HierarchicalIntHardAssigner | |
HierarchicalLongHardAssigner | |
HierarchicalShortHardAssigner | |
KDTreeByteEuclideanAssigner |
A
HardAssigner that uses a ByteNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
KDTreeDoubleEuclideanAssigner |
A
HardAssigner that uses a DoubleNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
KDTreeFloatEuclideanAssigner |
A
HardAssigner that uses a FloatNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
KDTreeIntEuclideanAssigner |
A
HardAssigner that uses a IntNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
KDTreeLongEuclideanAssigner |
A
HardAssigner that uses a LongNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
KDTreeShortEuclideanAssigner |
A
HardAssigner that uses a ShortNearestNeighboursKDTree to
generate approximately correct cluster assignments. |
Enum | Description |
---|---|
HierarchicalByteHardAssigner.ScoringScheme |
The
HierarchicalByteHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
HierarchicalDoubleHardAssigner.ScoringScheme |
The
HierarchicalDoubleHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
HierarchicalFloatHardAssigner.ScoringScheme |
The
HierarchicalFloatHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
HierarchicalIntHardAssigner.ScoringScheme |
The
HierarchicalIntHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
HierarchicalLongHardAssigner.ScoringScheme |
The
HierarchicalLongHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
HierarchicalShortHardAssigner.ScoringScheme |
The
HierarchicalShortHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |