Ward's method
Criterion applied in hierarchical cluster analysis
In statistics, Ward's method is a criterion applied in hierarchical cluster analysis. Ward's minimum variance method is a special case of the objective function approach originally presented by Joe H. Ward, Jr. Ward suggested a general agglomerative hierarchical clustering procedure, where the criterion for choosing the pair of clusters to merge at each step is based on the optimal value of an objective function.
Nº Q3333621 ★
Common · Knowledge
Ward's method
Criterion applied in hierarchical cluster analysis
In statistics, Ward's method is a criterion applied in hierarchical cluster analysis. Ward's minimum variance method is a special case of the objective function approach originally presented by Joe H. Ward, Jr. Ward suggested a general agglomerative hierarchical clustering procedure, where the criterion for choosing the pair of clusters to merge at each step is based on the optimal value of an objective function.
From Wikipedia
In statistics, Ward's method is a criterion applied in hierarchical cluster analysis. Ward's minimum variance method is a special case of the objective function approach originally presented by Joe H. Ward, Jr. Ward suggested a general agglomerative hierarchical clustering procedure, where the criterion for choosing the pair of clusters to merge at each step is based on the optimal value of an objective function. This objective function could be "any function that reflects the investigator's purpose." Many of the standard clustering procedures are contained in this very general class. To illustrate the procedure, Ward used the example where the objective function is the error sum of squares, and this example is known as Ward's method or more precisely Ward's minimum variance method. The nearest-neighbor chain algorithm can be used to find the same clustering defined by Ward's method, in time proportional to the size of the input distance matrix and space linear in the number of points being clustered.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
K-means clustering
Vector quantization algorithm that minimizes the sum of squared deviations between points and their nearest mean
Nº Q310401 ★★★
Not listed
-
Cluster analysis
Task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense or another) to each other than to those in other groups (clusters)
Nº Q622825 ★★
Not listed
-
H
Heath–Jarrow–Morton framework
Financial model
Nº Q1563747 ★
Not listed
-
F
Factor analysis
Statistical method used to describe correlation through fewer possibly latent variables
Nº Q726474 ★★
Not listed
-
Least squares
Approximation method in statistics
Nº Q74304 ★★★★
Not listed
-
Fisher's method
Statistical method for combining the probability values of independent tests
Nº Q5454737 ★
Not listed