Efficient algorithms for agglomerative hierarchical clustering methods
Year of publication: |
1984
|
---|---|
Authors: | Day, William ; Edelsbrunner, Herbert |
Published in: |
Journal of Classification. - Springer. - Vol. 1.1984, 1, p. 7-24
|
Publisher: |
Springer |
Subject: | Algorithm complexity | Algorithm design | Centroid clustering method | Geometric model | SAHN clustering method |
-
Investigation of proportional link linkage clustering methods
Day, William, (1985)
-
A computationally efficient approximation to the nearest neighbor interchange metric
Brown, Edward, (1984)
-
Optimal algorithms for comparing trees with labeled leaves
Day, William, (1985)
- More ...
-
Investigation of proportional link linkage clustering methods
Day, William, (1985)
-
A computationally efficient approximation to the nearest neighbor interchange metric
Brown, Edward, (1984)
-
Foreword: Comparison and consensus of classifications
Day, William, (1986)
- More ...