jsat.clustering.dissimilarity

Class CompleteLinkDissimilarity

java.lang.Object

jsat.clustering.dissimilarity.AbstractClusterDissimilarity

jsat.clustering.dissimilarity.DistanceMetricDissimilarity

jsat.clustering.dissimilarity.LanceWilliamsDissimilarity

jsat.clustering.dissimilarity.CompleteLinkDissimilarity

All Implemented Interfaces:

ClusterDissimilarity, UpdatableClusterDissimilarity

public class CompleteLinkDissimilarity
extends LanceWilliamsDissimilarity
implements UpdatableClusterDissimilarity

Measures the dissimilarity of two clusters by returning the value of the maximal dissimilarity of any two pairs of data points where one is from each cluster.

Constructor Summary

Constructors

Constructor and Description
CompleteLinkDissimilarity() Creates a new CompleteLinkDissimilarity using the EuclideanDistance
CompleteLinkDissimilarity(CompleteLinkDissimilarity toCopy) Copy constructor
CompleteLinkDissimilarity(DistanceMetric dm) Creates a new CompleteLinkDissimilarity

Method Summary

Modifier and Type	Method and Description
CompleteLinkDissimilarity	clone()
double	dissimilarity(int ni, int nj, int nk, double d_ij, double d_ik, double d_jk) Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.
double	dissimilarity(int i, int ni, int j, int nj, double[][] distanceMatrix) Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.
double	dissimilarity(int i, int ni, int j, int nj, int k, int nk, double[][] distanceMatrix) Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.
double	dissimilarity(java.util.List<DataPoint> a, java.util.List<DataPoint> b) Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.
double	dissimilarity(java.util.Set<java.lang.Integer> a, java.util.Set<java.lang.Integer> b, double[][] distanceMatrix) Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.

Methods inherited from class jsat.clustering.dissimilarity.DistanceMetricDissimilarity

distance

Methods inherited from class jsat.clustering.dissimilarity.AbstractClusterDissimilarity

createDistanceMatrix, getDistance, setDistance

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface jsat.clustering.dissimilarity.ClusterDissimilarity

distance

Constructor Detail

CompleteLinkDissimilarity

public CompleteLinkDissimilarity()

Creates a new CompleteLinkDissimilarity using the EuclideanDistance

CompleteLinkDissimilarity

public CompleteLinkDissimilarity(DistanceMetric dm)

Creates a new CompleteLinkDissimilarity

Parameters:

dm - the distance metric to use between individual points

CompleteLinkDissimilarity

public CompleteLinkDissimilarity(CompleteLinkDissimilarity toCopy)

Copy constructor

Parameters:

toCopy - the object to copy

Method Detail

clone

public CompleteLinkDissimilarity clone()

Specified by:

clone in interface ClusterDissimilarity

Specified by:

clone in interface UpdatableClusterDissimilarity

Specified by:

clone in class LanceWilliamsDissimilarity

dissimilarity

public double dissimilarity(java.util.List<DataPoint> a,
                            java.util.List<DataPoint> b)

Description copied from interface: ClusterDissimilarity

Provides the notion of dissimilarity between two sets of points, that may not have the same number of points.

Specified by:

dissimilarity in interface ClusterDissimilarity

Overrides:

dissimilarity in class LanceWilliamsDissimilarity

Parameters:

a - the first cluster of points

b - the second cluster of points

Returns:

a value >= 0 that describes the dissimilarity of the two clusters. The larger the value, the more different the two clusterings are.

dissimilarity

public double dissimilarity(java.util.Set<java.lang.Integer> a,
                            java.util.Set<java.lang.Integer> b,
                            double[][] distanceMatrix)

Description copied from interface: ClusterDissimilarity

Provides the notion of dissimilarity between two sets of points, that may not have the same number of points. This is done using a matrix containing all pairwise distance computations between all points.

Specified by:

dissimilarity in interface ClusterDissimilarity

Overrides:

dissimilarity in class LanceWilliamsDissimilarity

Parameters:

a - the first set of indices of the original data set that are in a cluster, which map to distanceMatrix

b - the second set of indices of the original data set that are in a cluster, which map to distanceMatrix

distanceMatrix - the upper triangual distance matrix as created by AbstractClusterDissimilarity.createDistanceMatrix(jsat.DataSet, jsat.clustering.dissimilarity.ClusterDissimilarity)

Returns:

a value >= 0 that describes the dissimilarity of the two clusters. The larger the value, the more different the two clusterings are.

dissimilarity

public double dissimilarity(int i,
                            int ni,
                            int j,
                            int nj,
                            double[][] distanceMatrix)

Description copied from interface: UpdatableClusterDissimilarity

Provides the notion of dissimilarity between two sets of points, that may not have the same number of points. This is done using a matrix containing all pairwise distance computations between all points. This distance matrix will then be updated at each iteration and merging, leaving empty space in the matrix. The updates will be done by the clustering algorithm. Implementing this interface indicates that this dissimilarity measure can be accurately computed in an updatable manner that is compatible with a Lance–Williams update.

Specified by:

dissimilarity in interface UpdatableClusterDissimilarity

Overrides:

dissimilarity in class LanceWilliamsDissimilarity

Parameters:

i - the index of cluster i's distance in the original data set

ni - the number of items in the cluster represented by i

j - the index of cluster j's distance in the original data set

nj - the number of items in the cluster represented by j

distanceMatrix - a distance matrix originally created by AbstractClusterDissimilarity.createDistanceMatrix(jsat.DataSet, jsat.clustering.dissimilarity.ClusterDissimilarity)

Returns:

a value >= 0 that describes the dissimilarity of the two clusters. The larger the value, the more different the two clusterings are.

dissimilarity

public double dissimilarity(int i,
                            int ni,
                            int j,
                            int nj,
                            int k,
                            int nk,
                            double[][] distanceMatrix)

Description copied from interface: UpdatableClusterDissimilarity

Provides the notion of dissimilarity between two sets of points, that may not have the same number of points. This is done using a matrix containing all pairwise distance computations between all points. This distance matrix will then be updated at each iteration and merging, leaving empty space in the matrix. The updates will be done by the clustering algorithm. Implementing this interface indicates that this dissimilarity measure can be accurately computed in an updatable manner that is compatible with a Lance–Williams update.
This computes the dissimilarity of the union of clusters i and j, (C_i ∪ C_j), with the cluster k. This method is used by other algorithms to perform an update of the distance matrix in an efficient manner.

Specified by:

dissimilarity in interface UpdatableClusterDissimilarity

Overrides:

dissimilarity in class LanceWilliamsDissimilarity

Parameters:

i - the index of cluster i's distance in the original data set

ni - the number of items in the cluster represented by i

j - the index of cluster j's distance in the original data set

nj - the number of items in the cluster represented by j

k - the index of cluster k's distance in the original data set

nk - the number of items in the cluster represented by k a distance matrix originally created by AbstractClusterDissimilarity.createDistanceMatrix(jsat.DataSet, jsat.clustering.dissimilarity.ClusterDissimilarity)

Returns:

a value >= 0 that describes the dissimilarity of the union of two clusters with a third cluster. The larger the value, the more different the resulting clusterings are.

dissimilarity

public double dissimilarity(int ni,
                            int nj,
                            int nk,
                            double d_ij,
                            double d_ik,
                            double d_jk)

Description copied from class: LanceWilliamsDissimilarity

Provides the notion of dissimilarity between two sets of points, that may not have the same number of points. This is done using a matrix containing all pairwise distance computations between all points. This distance matrix will then be updated at each iteration and merging, leaving empty space in the matrix. The updates will be done by the clustering algorithm. Implementing this interface indicates that this dissimilarity measure can be accurately computed in an updatable manner that is compatible with a Lance–Williams update.
This computes the dissimilarity of the union of clusters i and j, (C_i ∪ C_j), with the cluster k. This method is used by other algorithms to perform an update of the distance matrix in an efficient manner.

Overrides:

dissimilarity in class LanceWilliamsDissimilarity

Parameters:

ni - the number of items in the cluster represented by i

nj - the number of items in the cluster represented by j

nk - the number of items in the cluster represented by k

d_ij - the distance between clusters i and j

d_ik - the distance between clusters i and k

d_jk - the distance between clusters j and k

Returns:

the distance between the cluster formed from i and j, to the cluster k