Hierarchical regrouping
This type of Classification proceeds in three stages:
1. to find the similarities between the pairs of objects;
2. to group the objects in the form of a tree, this is carried out by considering each element in a class and to gather the two closest classes within the meaning of a distance;
3. to determine the cut of tree by defining the number of classes wished. One calls dendrogramme the binary Tree reflecting the structure of the data and allowing to gather the similar data. However, the disadvantage with such an approach is the determination of the threshold of the cut, as well as the absence of overlapping of the classes. A data can be near thématiquement to other data belonging to two different classes.
Related articles
| Random links: | The Incorruptible ones (televised series) | Alain Guillerm | Stamps of Canada 2007 | Routing Policy Language Specification | Tropical storm Erin (2007) | L'école_de_Bulmershe |