Probabilistic models in cluster analysis

DOI10.1016/0167-9473(96)88919-5MaRDI QIDQ1350792zbMATH OpenOpenAlexFDO

Authors H.-H. 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)

Recommendations

• scientific article; zbMATH DE number 1313702
• scientific article; zbMATH DE number 1140598
• scientific article; zbMATH DE number 5585860
• A probabilistic theory of clustering
• A novel multimodal probability model for cluster analysis

Cites work

• scientific article; zbMATH DE number 3874428 (Why is no real title available?)
• scientific article; zbMATH DE number 4200033 (Why is no real title available?)
• scientific article; zbMATH DE number 4201445 (Why is no real title available?)
• scientific article; zbMATH DE number 4207850 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3934272 (Why is no real title available?)
• scientific article; zbMATH DE number 3936253 (Why is no real title available?)
• scientific article; zbMATH DE number 3945127 (Why is no real title available?)
• scientific article; zbMATH DE number 3963047 (Why is no real title available?)
• scientific article; zbMATH DE number 4020246 (Why is no real title available?)
• scientific article; zbMATH DE number 4022343 (Why is no real title available?)
• scientific article; zbMATH DE number 17201 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 52492 (Why is no real title available?)
• scientific article; zbMATH DE number 192822 (Why is no real title available?)
• scientific article; zbMATH DE number 194075 (Why is no real title available?)
• scientific article; zbMATH DE number 496231 (Why is no real title available?)
• scientific article; zbMATH DE number 1107547 (Why is no real title available?)
• scientific article; zbMATH DE number 1107555 (Why is no real title available?)
• scientific article; zbMATH DE number 1163449 (Why is no real title available?)
• scientific article; zbMATH DE number 1163453 (Why is no real title available?)
• scientific article; zbMATH DE number 194758 (Why is no real title available?)
• scientific article; zbMATH DE number 756180 (Why is no real title available?)
• scientific article; zbMATH DE number 756195 (Why is no real title available?)
• scientific article; zbMATH DE number 3996906 (Why is no real title available?)
• scientific article; zbMATH DE number 3999034 (Why is no real title available?)
• scientific article; zbMATH DE number 3439834 (Why is no real title available?)
• scientific article; zbMATH DE number 863795 (Why is no real title available?)
• scientific article; zbMATH DE number 912694 (Why is no real title available?)
• scientific article; zbMATH DE number 912695 (Why is no real title available?)
• scientific article; zbMATH DE number 912696 (Why is no real title available?)
• scientific article; zbMATH DE number 3333197 (Why is no real title available?)
• scientific article; zbMATH DE number 4186967 (Why is no real title available?)
• A Graphical Technique for Determining the Number of Components in a Mixture of Normals
• A Method for Comparing Two Hierarchical Clusterings
• A Probability Theory of Cluster Analysis
• A Probability theory of hierarchic clustering using random dendrograms
• A central limit theorem for k-means clustering
• A class of U-statistics and asymptotic normality of the number of k- clusters
• A computationally efficient approximation to the nearest neighbor interchange metric
• An Exponential Family of Probability Distributions for Directed Graphs
• An exact probability distribution on the connectivity of random graphs
• Asymptotic Poisson distributions with applications to statistical analysis of graphs
• Asymptotic behaviour of classification maximum likelihood estimates
• Asymptotic distributions for clustering criteria
• Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
• Branch and bound algorithms to determine minimal evolutionary trees
• 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
• Clustering criteria for discrete data and latent class models
• Combinatorial structures and structures for classification
• Constructing optimal ultrametrics
• Counting dendrograms: A survey
• 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
• Distributions on bicoloured binary trees arising from the principle of parsimony
• Excess Mass Estimates and Tests for Multimodality
• Fast random generation of binary, t-ary and other types of trees
• 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
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• Invariants of phylogenies in a simple case with discrete states
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• Markov Graphs
• Maximal spacings in several dimensions
• Metric inference for social networks
• Metrics on spaces of finite trees
• Minimal Mutation Trees of Sequences
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Multivariate Tests for Clusters
• Necessary conditions for the method of inferring phylogeny by linear invariants
• New approaches in classification and data analysis
• Numbering binary trees with labeled terminal vertices
• On probability distributions of single-linkage dendrograms
• On some significance tests in cluster analysis
• On the Distribution of Lengths of Evolutionary Trees
• Parameter modification for clustering criteria
• Phylogenetic Inference: Linear Invariants and Maximum Likelihood
• Probabilistic models in cluster analysis
• Probability Tables for Cluster Analysis Based on a Theory of Random Graphs
• Significance of the length of the shortest tree
• Statistical Inference of Phylogenies
• Statistical analysis of finite mixture distributions
• Statistical tests on two characteristics of the shapes of cluster diagrams
• Testing for the number of components in a mixture of normal distributions using moment estimators
• The MAP test for multimodality
• The computational complexity of inferring rooted phylogenies by parsimony
• The dip test of unimodality
• The generation of random, binary unordered trees
• The limit distribution for maxima of ‘weighted' rth-nearest-neighbour distances
• The probabilities of rooted tree-shapes generated by random bifurcation

Cited in

(33)

• Probability of misclassification in model-based clustering
• Concentration for Poisson functionals: component counts in random geometric graphs
• A Robust Maximal F-Ratio Statistic to Detect Clusters Structure
• Flexible parametric bootstrap for testing homogeneity against clustering and assessing the number of clusters
• On the quality of k-means clustering based on grouped data
• Robust double clustering: a method based on alternating concentration steps
• Discovering patterns in categorical time series using IFS
• Three-mode partitioning
• Identifiability of nonparametric mixture models and Bayes optimal clustering
• E-ReMI: extended maximal interaction two-mode clustering
• Statistical theory in clustering
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• Probabilistic clustering via Pareto solutions and significance tests
• 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
• Fuzzy clustering models and their related concepts
• A Clustering Method for Categorical Ordinal Data
• Building mixture trees from binary sequence data
• Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
• A review of robust clustering methods
• A novel multimodal probability model for cluster analysis
• Reduction of n-th moment measures and the special case of the third moment measure of stationary and isotropic planar point processes
• Exploring the number of groups in robust model-based clustering
• 10.1162/1532443041827943
• A modified k-means clustering procedure for obtaining a cardinality-constrained centroid matrix
• REMAXINT: a two-mode clustering-based method for statistical inference on two-way interaction
• Heteroscedastic factor mixture analysis
• Maximal interaction two-mode clustering
• Two Models of Random Intersection Graphs and their Applications
• A probabilistic theory of clustering
• High-dimensional data clustering
• Probabilistic models in cluster analysis
• Power analysis for the bootstrap likelihood ratio test for the number of classes in latent class models

Describes a project that uses

Uses Software

• PHYLIP
• fastDNAml
• spatial

This page was built for publication: Probabilistic models in cluster analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350792)