E - the type of objects being clusteredpublic class LinkDendrogram<E> extends Dendrogram<E>
LinkDendrogram consists of a pair of sub-dendrograms
which are joined at a specified cost. Although typically used in
the case where the sub-dendrograms have lower costs than their
parent dendrograms, this condition is not enforced by this
implementation.| Constructor and Description |
|---|
LinkDendrogram(Dendrogram<E> dendrogram1,
Dendrogram<E> dendrogram2,
double cost)
Construct a link dendrogram containing the specified object.
|
| Modifier and Type | Method and Description |
|---|---|
Dendrogram<E> |
dendrogram1()
Returns the first dendrogram in the linked dendrogram.
|
Dendrogram<E> |
dendrogram2()
Returns the second dendrogram in the linked dendrogram.
|
Set<E> |
memberSet()
Returns the members of this dendrogram.
|
double |
score()
Returns the cost of this dendogram.
|
contains, copheneticCorrelation, dereference, parent, partitionDistance, partitionK, prettyPrint, size, structurallyEquivalent, toString, withinClusterScatterpublic LinkDendrogram(Dendrogram<E> dendrogram1, Dendrogram<E> dendrogram2, double cost)
dendrogram1 - First dendrogram in cluster.dendrogram2 - Second dendrogram in cluster.cost - Cost of creating this dendrogram from the specified
dendrograms.IllegalArgumentException - If the cost is less than
0.0.public double score()
score in interface Scoredscore in class Dendrogram<E>public Set<E> memberSet()
DendrogrammemberSet in class Dendrogram<E>public Dendrogram<E> dendrogram1()
public Dendrogram<E> dendrogram2()
Copyright © 2016 Alias-i, Inc.. All rights reserved.