Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Lance, W. Williams (1967)
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical SystemsComput. J., 9
T. Klastorin, C. Watts (1981)
The determination of alternative hospital classifications.Health services research, 16 2
G. Soete (1984)
Ultrametric tree representations of incomplete dissimilarity dataJournal of Classification, 1
Jean-Louis Chandon, J. Lemaire, J. Pouget (1980)
Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrésRairo-operations Research, 14
C. L. Lawson, R. J. Hanson (1974)
Solving Least Squares Problems
J. Reitman, H. Rueter (1980)
Organization revealed by recall orders and confirmed by pausesCognitive Psychology, 12
M. Goodman, J. Barnabas, G. Matsuda, G. Moore (1971)
Molecular Evolution in the Descent of ManNature, 233
W. Levelt (1970)
A scaling approach to the study of syntactic relations
R. Webster, P. A. Burrough (1972)
Computer-based Soil Mapping of Small Areas from Sample Data. I. Multivariate Classification and OrdinationJournal of Soil Science, 23
A. D. Gordon (1973)
Classification in the Presence of ConstraintsBiometrics, 29
L. Hubert, R. Golledge (1981)
A heuristic method for the comparison of related structuresJournal of Mathematical Psychology, 23
R. Webster, P. A. Burrough (1972)
Computer-based Soil Mapping of Small Areas from Sample Data. II. Classification SmoothingJournal of Soil Science, 23
G. Soete (1983)
A least squares algorithm for fitting additive trees to proximity dataPsychometrika, 48
J. D. Carroll, S. Pruzansky (1980)
Similarity and Choice
A. D. Gordon (1980)
Analyse de Donn�es et Informatique
W. DeSarbo, V. Mahajan (1984)
Constrained classification: The use of a priori information in cluster analysisPsychometrika, 49
A. Ferligoj, V. Batagelj (1982)
Clustering with relational constraintPsychometrika, 47
L. P. Lefkovitch (1980)
Conditional ClusteringBiometrics, 36
A. D. Gordon (1981)
Classification
L. Lebart (1978)
Programme d'Agr�gation avec Constraintes [C.A.H. Contiguit�]Cahiers de l'Analyse des Données, 3
G. Soete, W. DeSarbo, J. Carroll (1985)
Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithmJournal of Classification, 2
M. Powell (1977)
Restart procedures for the conjugate gradient methodMathematical Programming, 12
A. Gordon (1973)
359. Note: Classification in the Presence of ConstraintsBiometrics, 29
Richard Webster, P. Burrough (1972)
COMPUTER‐BASED SOIL MAPPING OF SMALL AREAS FROM SAMPLE DATAJournal of Soil Science, 23
A. K. Romney, R. G. D'Andrade (1964)
Cognitive aspects of English kin termsAmerican Anthropologist, 66
L. Lebart (1978)
Programme d'agrégation avec contraintes, 3
V. Mahajan, A. Jain (1978)
An Approach to Normative SegmentationJournal of Marketing Research, 15
Geert Soete, W. DeSarbo, G. Furnas, J. Carroll (1984)
The estimation of ultrametric and path length trees from rectangular proximity dataPsychometrika, 49
R. W. Moncrieff (1966)
Odor Preferences
Robert Helbig, P. Orr, Robert Roediger (1972)
Political redistricting by computerCommunications of the ACM, 15
M. Powell (1969)
Nonlinear Programming—Sequential Unconstrained Minimization TechniquesThe Computer Journal, 12
J.L. Chandon, J. Lemaire, J. Pouget (1980)
Construction de l'ultram�trique la plus proche d'une dissimilarit� au sens des moindres carr�sR.A.I.R.O. Recherche Opérationelle, 14
J. Carroll, Linda Clark, W. DeSarbo (1984)
The representation of three-way proximity data by single and multiple tree structure modelsJournal of Classification, 1
J. L. Chandon, G. Soete (1984)
Data Analysis and Informatics III
G. Soete (1984)
A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrixPattern Recognit. Lett., 2
G. Soete (1984)
Additive-tree representations of incomplete dissimilarity dataQuality and Quantity, 18
W. J. M. Levelt (1970)
Advances in Psycholinguistics
A. Ferligoj, V. Batagelj (1983)
Some types of clustering with relational constraintsPsychometrika, 48
A mathematical programming algorithm is developed for fitting ultrametric or additive trees to proximity data where external constraints are imposed on the topology of the tree. The two procedures minimize a least squares loss function. The method is illustrated on both synthetic and real data. A constrained ultrametric tree analysis was performed on similarities between 32 subjects based on preferences for ten odors, while a constrained additive tree analysis was carried out on some proximity data between kinship terms. Finally, some extensions of the methodology to other tree fitting procedures are mentioned.
Journal of Classification – Springer Journals
Published: Jun 18, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.