Publication:4085109
From MaRDI portal
zbMath0322.62065MaRDI QIDQ4085109
Publication date: 1971
62H30: Classification and discrimination; cluster analysis (statistical aspects)
62P10: Applications of statistics to biology and medical sciences; meta analysis
62-02: Research exposition (monographs, survey articles) pertaining to statistics
92B05: General biology and biomathematics
Related Items
Advances in Constrained Connectivity, A class of rational cardinality-based similarity measures, Reconstruction of additive phylogenetic tree., Maximum sum-of-splits clustering, Validity studies in clustering methodologies, New macroeconomic modeling approaches, Unsupervised fuzzy clustering with multi-center clusters, Metrics on spaces of finite trees, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Faithful consensus methods for n-trees, Paths algebra, similarities and system decomposition, Classic: A hierarchical clustering algorithm based on asymmetric similarities, Flatness and continuity in the percentile clustering model, Neighborhood systems and approximate retrieval, Fuzzy sets and sheaves. II: Sheaf-theoretic foundations of fuzzy set theory with applications to algebra and topology, Ordinal and percentile clustering, Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis, Binary clustering, Diversity and dissimilarity coefficients: A unified approach, Efficient algorithms for agglomerative hierarchical clustering methods, Efficient and binary consensus functions on transitively valued relations, k-connectivity in random undirected graphs, Euclidean consensus dendrograms and other classification structures, A stratificational overlapping cluster scheme, A model in partial orders for comparing objects by dualistic measures, Extended similarity trees, Biorder families, valued relations, and preference modelling, Computational complexity of inferring phylogenies from dissimilarity matrices, The complexity of ultrametric partitions on graphs, NP-hard problems in hierarchical-tree clustering, On the use of ordered sets in problems of comparison and consensus of classifications, A note on Jardine and Sibson's \(C_u\)-cluster methods, A taxonomic distance applicable to paleontology, Preservation of global order equivalence, Clusteranalyse - Überblick und neuere Entwicklungen, Comparison of phylogenetic trees, Continuous L-cluster methods, Graph theoretical clustering based on limited neighbourhood sets, A transfer algorithm for hierarchical clustering, Informational divergence and the dissimilarity of probability distributions, The median procedure in cluster analysis and social choice theory, The complexity of computing metric distances between partitions, Classification of normalized cluster methods in an order theoretic model, Semantic networks, A new approach to isotonic agglomerative hierarchical clustering, Representation of structure in similarity data: problems and prospects, Subjective clustering and bibliography of books on pattern recognition, Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects, Some biological sequence metrics, Data analysis implications of some concepts related to the cuts of a graph, A set-theoretical approach to the problem of hierarchical clustering, The comparison and fitting of given classification schemes, k-Blocks and Ultrablocks in Graphs, Semiflat L-cluster methods, Validity of clusters formed by graph-theoretic cluster methods, Ultrametrics and matrix theory, Classification and specification of flat cluster methods, Cluster generation and grouping using mathematical programming, On the measurement of shape, Some aspects of qualitative data analysis, Fixed points approach to clustering, Constructing optimal ultrametrics, New macroeconomic modeling approaches. Hierarchical dynamics and mean- field approximation, An order theoretic framework for overlapping clustering, Metric inference for social networks, Clustering on trees, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), Approximating dissimilarities by quasi-ultrametrics, A clustering algorithm based on graph connectivity, Pyramids and weak hierarchies in the ordinal model for clustering, From hypertrees to arboreal quasi-ultrametrics, Dissimilarity coefficients which are independent of a special set of data, On Euclidean images of a set endowed with a preordonnance, On lattice consensus methods, Consistency in ordinal data analysis. I., The conceptual weak hierarchy associated with a dissimilarity measure, The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies, Analyzing cognitive maps to help structure issues or problems, A discrete optimization model for preserving biological diversity, Pseudocontinuity in hierarchical classifications, A molecular sequence metric and evolutionary trees, The enumeration of minimal phylograms, On the semantics of fuzzy logic, Preservation of weak order equivalence, Compatibility in a graph-theoretic setting, Combinatorial optimisation and hierarchical classifications, Sub-dominant theory in numerical taxonomy, A unified view on clustering binary data, Multidimensional scaling of measures of distance between partitions, A framework for systematic zoological studies with game theory, The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria, Some Aspects of Clustering Functions, Unnamed Item, Unnamed Item, Embeddings of Ultrametric Spaces in Finite Dimensional Structures, Conglomerados y sus aplicaciones
