Hierarchically clusters the input data using a distance matrix.

Note: This node works only on small data sets, because it has cubic complexity.

There are two methods to do hierarchical clustering:

- Top-down or divisive, i.e. the algorithm starts with all data points in one huge cluster and the most dissimilar datapoints are divided into subclusters until each cluster consists of exactly one data point.
- Bottom-up or agglomerative, i.e. the algorithm starts with every datapoint as one single cluster and tries to combine the most similar ones into superclusters until it ends up in one huge cluster containing all subclusters.

In order to determine the distance between clusters a measure has to be defined. Basically, there exist three methods to compare two clusters:

- Single Linkage: defines the distance between two clusters c1 and c2 as the minimal distance between any two points x, y with x in c1 and y in c2.
- Complete Linkage: defines the distance between two clusters c1 and c2 as the maximal distance between any two points x, y with x in c1 and y in c2.
- Average Linkage: defines the distance between two clusters c1 and c2 as the mean distance between all points in c1 and c2.

The distance information used by this node is either read from a distance vector column that must be available in the input data or is computed directly with usage of a connected distance measure. You can always calculate the distance matrix using the corresponding calculate node.

- Distance matrix column
- Select the column containing the distance values. This option is disabled if a distance measure is connected (Port 1).
- Linkage type
- Which method to use to measure the distance between points (as described above)
- Ignore missing values
- By default, the node ignores rows with missing values completely. If instead an error should be reported, disable this option.

- This node has no views

- _01_PMR_AnalysisKNIME Hub
- 01_ClusteringKNIME Hub
- 01_ClusteringKNIME Hub
- 01_ClusteringKNIME Hub
- 01_ClusteringKNIME Hub
- Show all 140 workflows

- Epsilon value for geo coordinatesby qqilihq on 2023-07-11forum.knime.com/p/228507
- How to find agglomeration areas through DBScan?by armingrudd on 2022-03-29forum.knime.com/p/152094
- Location Clusteringby qqilihq on 2022-07-25forum.knime.com/p/164377

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.

To use this node in KNIME, install the extension KNIME Distance Matrix from the below update site following our NodePit Product and Node Installation Guide:

v5.2

A zipped version of the software site can be downloaded here.

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud
or on-premises – with our brand new **NodePit Runner**.

Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to mail@nodepit.com, follow @NodePit on Twitter or botsin.space/@nodepit on Mastodon.

**Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.**