| Package | Description |
|---|---|
| org.openimaj.ml.clustering.assignment.hard | |
| org.openimaj.ml.clustering.kmeans |
K-Means in OpenIMAJ is designed to be both extremely fast and flexible.
|
| Class and 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. |