scientific article; zbMATH DE number 3504320
From MaRDI portal
zbMath0322.62065MaRDI QIDQ4085109
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Research exposition (monographs, survey articles) pertaining to statistics (62-02) General biology and biomathematics (92B05)
Related Items
Pyramids and weak hierarchies in the ordinal model for clustering, The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies, New macroeconomic modeling approaches. Hierarchical dynamics and mean- field approximation, Extended similarity trees, Preservation of weak order equivalence, Distinguishing and classifying from \(n\)-ary properties, Biorder families, valued relations, and preference modelling, Analyzing cognitive maps to help structure issues or problems, Computational complexity of inferring phylogenies from dissimilarity matrices, An order theoretic framework for overlapping clustering, Metric inference for social networks, 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, Neighborhood systems and approximate retrieval, A discrete optimization model for preserving biological diversity, SMILE: a novel dissimilarity-based procedure for detecting sparse-specific profiles in sparse contingency tables, Order preserving hierarchical agglomerative clustering, Validity studies in clustering methodologies, Fuzzy sets and sheaves. II: Sheaf-theoretic foundations of fuzzy set theory with applications to algebra and topology, A continuous rating method for preferential voting: the complete case, Use of symmetry and stability for data clustering, A note on Jardine and Sibson's \(C_u\)-cluster methods, Clustering on trees, A taxonomic distance applicable to paleontology, Preservation of global order equivalence, Clusteranalyse - Überblick und neuere Entwicklungen, Functorial hierarchical clustering with overlaps, Comparison of phylogenetic trees, Continuous L-cluster methods, Ordinal and percentile clustering, Classifying clustering schemes, 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, Pseudocontinuity in hierarchical classifications, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), Statistics for data with geometric structure. Abstracts from the workshop held January 21--27, 2018, Classification of normalized cluster methods in an order theoretic model, New macroeconomic modeling approaches, Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis, Binary clustering, Statistical properties of the single linkage hierarchical clustering estimator, Semantic networks, A new approach to isotonic agglomerative hierarchical clustering, A primer on persistent homology of finite metric spaces, Unsupervised fuzzy clustering with multi-center clusters, Representation of structure in similarity data: problems and prospects, From hypertrees to arboreal quasi-ultrametrics, Subjective clustering and bibliography of books on pattern recognition, A molecular sequence metric and evolutionary trees, The enumeration of minimal phylograms, Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects, Some biological sequence metrics, On the semantics of fuzzy logic, Data analysis implications of some concepts related to the cuts of a graph, Maximum sum-of-splits clustering, A set-theoretical approach to the problem of hierarchical clustering, Reeb posets and tree approximations, Multilevel clustering models and interval convexities, The comparison and fitting of given classification schemes, k-Blocks and Ultrablocks in Graphs, Clustering of fuzzy data and simultaneous feature selection: a model selection approach, Semiflat L-cluster methods, Validity of clusters formed by graph-theoretic cluster methods, Enhancing point symmetry-based distance for data clustering, Ultrametrics and matrix theory, Classification and specification of flat cluster methods, Representation of graphs by means of generalized metrics, Cluster generation and grouping using mathematical programming, On the measurement of shape, Dissimilarity coefficients which are independent of a special set of data, Metrics on spaces of finite trees, Combinatorial optimization in system configuration design, On Euclidean images of a set endowed with a preordonnance, Computing sharp bounds for hard clustering problems on trees, On lattice consensus methods, A density-sensitive hierarchical clustering method, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Approximating dissimilarities by quasi-ultrametrics, Diversity and dissimilarity coefficients: A unified approach, Faithful consensus methods for n-trees, A new non-Archimedean metric on persistent homology, Efficient algorithms for agglomerative hierarchical clustering methods, Paths algebra, similarities and system decomposition, Efficient and binary consensus functions on transitively valued relations, k-connectivity in random undirected graphs, Euclidean consensus dendrograms and other classification structures, Some aspects of qualitative data analysis, Classic: A hierarchical clustering algorithm based on asymmetric similarities, A stratificational overlapping cluster scheme, Fixed points approach to clustering, Constructing optimal ultrametrics, Flatness and continuity in the percentile clustering model, A clustering algorithm based on graph connectivity, Consistency in ordinal data analysis. I., The conceptual weak hierarchy associated with a dissimilarity measure, A model in partial orders for comparing objects by dualistic measures, Compatibility in a graph-theoretic setting, Unnamed Item, Lattice for nested rough approximation, An empirical comparison and characterisation of nine popular clustering methods, The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria, Distributivity of a segmentation lattice, The ultrametric Gromov-Wasserstein distance, Distances and isomorphism between networks: stability and convergence of network invariants, Embeddings of Ultrametric Spaces in Finite Dimensional Structures, Analysis of Dynamic Graphs and Dynamic Metric Spaces via Zigzag Persistence, A novel approach to fault tolerant multichannel networks designing problems, Diversity as width, Some Aspects of Clustering Functions, Combinatorial optimisation and hierarchical classifications, Sub-dominant theory in numerical taxonomy, A unified view on clustering binary data, Unnamed Item, A class of rational cardinality-based similarity measures, Reconstruction of additive phylogenetic tree., Conglomerados y sus aplicaciones, Advances in Constrained Connectivity, Multidimensional scaling of measures of distance between partitions, A framework for systematic zoological studies with game theory, Finite metric and 𝑘-metric bases on ultrametric spaces, Subdominant pseudoultrametric on graphs, Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining, Unnamed Item
