A computationally efficient approximation to the nearest neighbor interchange metric
Year of publication: |
1984
|
---|---|
Authors: | Brown, Edward ; Day, William |
Published in: |
Journal of Classification. - Springer. - Vol. 1.1984, 1, p. 93-124
|
Publisher: |
Springer |
Subject: | Algorithm complexity | Algorithm design | Binary tree | Crossover metric | Dissimilarity measure | Distance measure | Hierarchical classification | nni metric |
-
Efficient algorithms for agglomerative hierarchical clustering methods
Day, William, (1984)
-
Investigation of proportional link linkage clustering methods
Day, William, (1985)
-
Optimal algorithms for comparing trees with labeled leaves
Day, William, (1985)
- More ...
-
Brown, Edward, (1685)
-
Campbell, John, (1774)
-
A political survey of Britain ; Vol. 1
Campbell, John, (1774)
- More ...