Probabilistic models in cluster analysis

DOI10.1016/0167-9473(96)88919-5zbMath0900.62324OpenAlexW2008689893MaRDI QIDQ1350792

Hans-Hermann Bock

Publication date: 27 February 1997

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(96)88919-5

zbMATH Keywords

Hierarchical clustering modelsPartition-type clusteringPhylogenetic inferenceProbabilistic cluster analysisTesting for a clustering structure

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

Concentration for Poisson functionals: component counts in random geometric graphs, Maximal interaction two-mode clustering, On the quality of \(k\)-means clustering based on grouped data, Probabilistic models in cluster analysis, REMAXINT: a two-mode clustering-based method for statistical inference on two-way interaction, Power analysis for the bootstrap likelihood ratio test for the number of classes in latent class models, E-ReMI: extended maximal interaction two-mode clustering, A review of robust clustering methods, Identifiability of nonparametric mixture models and Bayes optimal clustering, A Clustering Method for Categorical Ordinal Data, Exploring the number of groups in robust model-based clustering, Flexible parametric bootstrap for testing homogeneity against clustering and assessing the number of clusters, A variational approximations-DIC rubric for parameter estimation and mixture model selection within a family setting, Incorporating statistical clustering methods into mortality models to improve forecasting performances, Robust double clustering: a method based on alternating concentration steps, Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy, A Robust Maximal F-Ratio Statistic to Detect Clusters Structure, Three-mode partitioning, Heteroscedastic factor mixture analysis, High-dimensional data clustering, Discovering patterns in categorical time series using IFS, A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix, Fuzzy Clustering Models and Their Related Concepts, Two Models of Random Intersection Graphs and their Applications

Uses Software

• spatial
• fastDNAml
• PHYLIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal spacings in several dimensions
• Fast random generation of binary, t-ary and other types of trees
• Necessary conditions for the method of inferring phylogeny by linear invariants
• Metrics on spaces of finite trees
• Counting dendrograms: A survey
• Numbering binary trees with labeled terminal vertices
• A computationally efficient approximation to the nearest neighbor interchange metric
• The dip test of unimodality
• The generation of random, binary unordered trees
• On some significance tests in cluster analysis
• The computational complexity of inferring rooted phylogenies by parsimony
• Invariants of phylogenies in a simple case with discrete states
• Statistical tests on two characteristics of the shapes of cluster diagrams
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• Parameter modification for clustering criteria
• Branch and bound algorithms to determine minimal evolutionary trees
• A central limit theorem for k-means clustering
• Classification, data analysis, and knowledge organization. Models and methods with applications. Proceedings of the 14th annual conference of the Gesellschaft für Klassifikation e.V., University of Marburg, Germany, March 12-14, 1990
• Significance of the length of the shortest tree
• Clustering criteria for discrete data and latent class models
• A class of \(U\)-statistics and asymptotic normality of the number of \(k\)- clusters
• Distributions on bicoloured binary trees arising from the principle of parsimony
• An exact probability distribution on the connectivity of random graphs
• Asymptotic distributions for clustering criteria
• Constructing optimal ultrametrics
• The MAP test for multimodality
• Metric inference for social networks
• Probabilistic models in cluster analysis
• Combinatorial structures and structures for classification
• Data analysis and information systems. Statistical and conceptual approaches. Proceedings of the 19th annual conference of the Gesellschaft für Klassifikation e.V., Basel, Switzerland, March 8--10, 1995
• Testing for the number of components in a mixture of normal distributions using moment estimators
• New approaches in classification and data analysis
• From data to knowledge: theoretical and practical aspects of classification, data analysis, and knowledge organization. Selected papers presented at the 18th annual conference of the German Classification Society, Oldenburg, Germany, March 9-11, 1994
• Statistical Inference of Phylogenies
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• A Method for Comparing Two Hierarchical Clusterings
• Excess Mass Estimates and Tests for Multimodality
• On the Distribution of Lengths of Evolutionary Trees
• A Probability theory of hierarchic clustering using random dendrograms
• Markov Graphs
• Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
• Asymptotic Poisson distributions with applications to statistical analysis of graphs
• Multivariate Tests for Clusters
• On probability distributions of single-linkage dendrograms
• An Exponential Family of Probability Distributions for Directed Graphs
• The limit distribution for maxima of ‘weighted' rth-nearest-neighbour distances
• Minimal Mutation Trees of Sequences
• Probability Tables for Cluster Analysis Based on a Theory of Random Graphs
• Asymptotic behaviour of classification maximum likelihood estimates
• Phylogenetic Inference: Linear Invariants and Maximum Likelihood
• A Graphical Technique for Determining the Number of Components in a Mixture of Normals
• A Probability Theory of Cluster Analysis
• The probabilities of rooted tree-shapes generated by random bifurcation