public class HierarchicalDoubleHardAssigner extends Object implements HardAssigner<double[],double[],IntDoublePair>
HierarchicalDoubleHardAssigner is a HardAssigner for
HierarchicalDoubleKMeansResult instances. The assigner
produces the index of the assigned leaf node as if the clusters were
actually flat.| Modifier and Type | Class and Description |
|---|---|
static class |
HierarchicalDoubleHardAssigner.ScoringScheme
The
HierarchicalDoubleHardAssigner.ScoringScheme determines how the distance
to a cluster is estimated from the hierarchy of k-means
generated clusters. |
| Modifier and Type | Field and Description |
|---|---|
protected HierarchicalDoublePathAssigner |
path |
protected HierarchicalDoubleKMeansResult |
result |
protected HierarchicalDoubleHardAssigner.ScoringScheme |
scorer |
| Constructor and Description |
|---|
HierarchicalDoubleHardAssigner(HierarchicalDoubleKMeansResult result)
Construct with the given Hierarchical KMeans clusterer
and the SUM scoring scheme.
|
HierarchicalDoubleHardAssigner(HierarchicalDoubleKMeansResult result,
HierarchicalDoubleHardAssigner.ScoringScheme scorer)
Construct with the given hierarchical KMeans clusterer
and scoring scheme.
|
| Modifier and Type | Method and Description |
|---|---|
int |
assign(double[] data)
Assign a single point to a cluster.
|
int[] |
assign(double[][] data)
Assign data to a cluster.
|
IntDoublePair |
assignDistance(double[] data)
Assign a single point to a cluster.
|
void |
assignDistance(double[][] data,
int[] indices,
double[] distances)
Assign data to clusters.
|
int |
numDimensions()
Get the number of dimensions of the input vectors.
|
int |
size()
The number of centroids or unique ids that can be generated.
|
protected HierarchicalDoubleKMeansResult result
protected HierarchicalDoublePathAssigner path
protected HierarchicalDoubleHardAssigner.ScoringScheme scorer
public HierarchicalDoubleHardAssigner(HierarchicalDoubleKMeansResult result, HierarchicalDoubleHardAssigner.ScoringScheme scorer)
result - the hierarchical KMeans clustererscorer - the scoring schemepublic HierarchicalDoubleHardAssigner(HierarchicalDoubleKMeansResult result)
result - the hierarchical KMeans clustererpublic int[] assign(double[][] data)
HardAssignerassign in interface HardAssigner<double[],double[],IntDoublePair>data - the data.public int assign(double[] data)
HardAssignerassign in interface HardAssigner<double[],double[],IntDoublePair>data - datum to assign.public void assignDistance(double[][] data, int[] indices, double[] distances)
HardAssignerassignDistance in interface HardAssigner<double[],double[],IntDoublePair>data - the data.indices - the cluster index for each data point.distances - the distance to the closest cluster for each data point.public IntDoublePair assignDistance(double[] data)
HardAssignerassignDistance in interface HardAssigner<double[],double[],IntDoublePair>data - point to assign.public int size()
HardAssignersize in interface HardAssigner<double[],double[],IntDoublePair>public int numDimensions()
AssignernumDimensions in interface Assigner<double[]>