A metric and an ordering on sets
From MaRDI portal
Publication:770924
DOI10.1007/BF02289843zbMath0087.15903MaRDI QIDQ770924
Publication date: 1959
Published in: Psychometrika (Search for Journal in Brave)
Related Items
Extended similarity trees, Applications of the theory of meaningfulness to psychology, Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures, Exploring the set-theoretical structure of objects by additive trees, Statistical methods for a theory of cue learning, A graph theoretic approach to similarity relations, Mathematical Applications in Sociology: Measurement and Relations, A probabilistic feature model for unfolding tested for perfect and imperfect nestings, Conceptual orthospaces -- convexity meets negation, Metrics on partially ordered sets - a survey, Theory construction in psychology: The interpretation and integration of psychological data, The median procedure in cluster analysis and social choice theory, Quantale-valued dissimilarity, The complexity of computing metric distances between partitions, The additive random feature model for unfolding and the feature structure of choice objects, TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model, Some applications of graph theory to clustering, Ordinal network representation: Representing proximities by graphs, ON THE PROBLEM OF REPRESENTATION IN LOCKEAN AND DIALECTICAL BELIEF SYSTEMS: A SYSTEMS APPROACH TO POLICY ANALYSIS, ON THE STRENGTH OF BELIEF OF DIALECTICAL BELIEF SYSTEMS, Transitivity revisited, The metric of multidimensional psychological spaces as a function of the differential attention to subjective attributes, On nontransitive indifference, Metrics on spaces of finite trees, Betweenness, orders and interval graphs, A choice theory analysis of similarity judgments, Multidimensional scaling of measures of distance between partitions, Distances between trees, Probability and logic in belief systems, Properties of Levenshtein metrics on sequences, A computationally efficient approximation to the nearest neighbor interchange metric, A formalization of consensus index methods, Optimal algorithms for comparing trees with labeled leaves
Cites Work
