Implementation of Hierarchical Clustering Methods
✍ Scribed by Arturo Serna
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 366 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
✦ Synopsis
methods to distribute a set of objects into a set of groups. Among these methods, hierarchical clustering gives the
We present an implementation of hierarchical clustering methods to distribute a set of objects into a set of groups. Our code is particu-clearest insight into the structure of a cluster and allows larly conceived to identify and analyze substructures in galaxy clusa relatively easy identification of the members of a group.
ters or in large-scale catalogues. However, its general scheme This kind of method can be formulated in terms of operaallows for very easy adaptation to any other kinds of systems and tional concepts, and it has been applied in the field of physical problems. The algorithms to draw the hierarchical tree astronomy by Materne [3], Tully [4, 5], Gourgoulhon et al. associated to a given sample of data, as well as those for analyzing and interpreting the results obtained from this technique, are also [6], and Serna and Gerbal [2].
📜 SIMILAR VOLUMES
## Abstract This is a procedural paper that compares six commonly used hierarchical clustering techniques applied to atmospheric soundings. The following techniques are compared: single‐, complete‐, and two average‐linkage techniques, the Ward's technique, and one centroid type technique. Vertical
## Abstract We introduce a novel approach to identifying Web search user sessions based on the burstiness of users' activity. Our method is user‐centered rather than population‐centered or system‐centered and can be deployed in situations in which users choose to withhold personal content informati