Package smile.clustering.linkage

Class CompleteLinkage

java.lang.Object
smile.clustering.linkage.Linkage
smile.clustering.linkage.CompleteLinkage
public class CompleteLinkage extends Linkage
Complete linkage. This is the opposite of single linkage. Distance between groups is now defined as the distance between the most distant pair of objects, one from each group.

  • Constructor Details

    • CompleteLinkage

      public CompleteLinkage(double[][] proximity)
      Constructor.
      Parameters:
      proximity - the proximity matrix. Only the lower half will be referred.

    • CompleteLinkage

      public CompleteLinkage(int size, float[] proximity)
      Constructor. Initialize the linkage with the lower triangular proximity matrix.
      Parameters:
      size - the data size.
      proximity - the column-wise linearized proximity matrix that stores only the lower half. The length of proximity should be size * (size+1) / 2. To save space, Linkage will use this argument directly without copy. The elements may be modified.

  • Method Details

    • of

      public static CompleteLinkage of(double[][] data)
      Computes the proximity and the linkage.
      Parameters:
      data - the data points.
      Returns:
      the linkage.

    • of

      public static <T> CompleteLinkage of(T[] data, Distance<T> distance)
      Computes the proximity and the linkage.
      Type Parameters:
      T - the data type of points.
      Parameters:
      data - the data points.
      distance - the distance function.
      Returns:
      the linkage.

    • toString

      public String toString()
      Overrides:
      toString in class Object

    • merge

      public void merge(int i, int j)
      Description copied from class: Linkage
      Merges two clusters into one and update the proximity matrix.
      Specified by:
      merge in class Linkage
      Parameters:
      i - cluster id.
      j - cluster id.