Classification ascendante hiérarchique des grands ensembles de données: un algorithme rapide fondé sur la construction des voisinages réductibles

Auteur :
BRUYNOOGHE M.,

Description :
The ascending hierarchical classification proceeds by aggregating at each steps the two classes which are, in a certain way, closest. The algorithm can be significantly speeded up if the search for the pair to aggregate can be limited to a suitable graph. This is what the author achieves. The article first describes the mathematical principles of the method and then follows the algorithm in detail for two imaginary examples with a small number of elements to be aggregated.


Type de document :
Article de périodique

Source :
Cahiers de l'Analyse des Données (Les), Paris, 1978, vol. 3, n°. 1, p. 7-33

Date :
1978