A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix-Reference-Cited by-同舟云学术

A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix

Published:1984-03 Issue:3 Volume:2 Page:133-137
ISSN:0167-8655
Container-title:Pattern Recognition Letters
language:en
Short-container-title:Pattern Recognition Letters

Author:

De Soete Geert

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference14 articles.

1. Fitting of hierarchical tree structure (HTS) models, mixtures of HTS models, and hybrid models, via mathematical programming and alternating least squares;Carroll,1975

2. Discrete and hybrid scaling models;Carroll,1980

3. Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés;Chandon;R.A.I.R.O. Recherche Opérationelle,1980

4. On conjugate gradient algorithms;Dixon,1980

5. Validity studies in clustering methodologies;Dubes;Pattern Recognition,1979

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ensemble clustering of longitudinal bivariate HIV biomarker profiles to group patients by patterns of disease progression;International Journal of Data Science and Analytics;2022-05-04

2. The ROCK Tool: A Novel Method for the Structural Exploration of Schemata;Frontiers in Psychology;2021-07-13

3. Ultrametric fitting by gradient descent *;Journal of Statistical Mechanics: Theory and Experiment;2020-12-01

4. Ultrametric distribution of culture vectors in an extended Axelrod model of cultural dissemination;Scientific Reports;2014-05-02

5. Clustering and Classification Methods;Handbook of Psychology, Second Edition;2012-09-26