Probabilistic models in cluster analysis
From MaRDI portal
Publication:1350792
DOI10.1016/0167-9473(96)88919-5zbMATH Open0900.62324OpenAlexW2008689893MaRDI QIDQ1350792FDOQ1350792
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
Recommendations
Hierarchical clustering modelsPartition-type clusteringPhylogenetic inferenceProbabilistic cluster analysisTesting for a clustering structure
Cites Work
- Asymptotic distributions for clustering criteria
- Statistical analysis of finite mixture distributions
- Probabilistic models in cluster analysis
- Title not available (Why is that?)
- New approaches in classification and data analysis
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- An Exponential Family of Probability Distributions for Directed Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numbering binary trees with labeled terminal vertices
- Markov Graphs
- Asymptotic behaviour of classification maximum likelihood estimates
- The dip test of unimodality
- Clustering criteria for discrete data and latent class models
- Statistical Inference of Phylogenies
- Excess Mass Estimates and Tests for Multimodality
- Title not available (Why is that?)
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- A Method for Comparing Two Hierarchical Clusterings
- A Graphical Technique for Determining the Number of Components in a Mixture of Normals
- Title not available (Why is that?)
- Counting dendrograms: A survey
- A central limit theorem for k-means clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metric inference for social networks
- Asymptotic Poisson distributions with applications to statistical analysis of graphs
- The computational complexity of inferring rooted phylogenies by parsimony
- Title not available (Why is that?)
- Fast random generation of binary, t-ary and other types of trees
- Invariants of phylogenies in a simple case with discrete states
- Branch and bound algorithms to determine minimal evolutionary trees
- The probabilities of rooted tree-shapes generated by random bifurcation
- Title not available (Why is that?)
- A class of \(U\)-statistics and asymptotic normality of the number of \(k\)- clusters
- The generation of random, binary unordered trees
- Maximal spacings in several dimensions
- Minimal Mutation Trees of Sequences
- On some significance tests in cluster analysis
- Testing for the number of components in a mixture of normal distributions using moment estimators
- A Probability Theory of Cluster Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limit distribution for maxima of ‘weighted' rth-nearest-neighbour distances
- A computationally efficient approximation to the nearest neighbor interchange metric
- Metrics on spaces of finite trees
- An exact probability distribution on the connectivity of random graphs
- Probability Tables for Cluster Analysis Based on a Theory of Random Graphs
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- On the Distribution of Lengths of Evolutionary Trees
- Phylogenetic Inference: Linear Invariants and Maximum Likelihood
- Combinatorial structures and structures for classification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Necessary conditions for the method of inferring phylogeny by linear invariants
- On probability distributions of single-linkage dendrograms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The MAP test for multimodality
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Probability theory of hierarchic clustering using random dendrograms
- Multivariate Tests for Clusters
- Statistical tests on two characteristics of the shapes of cluster diagrams
- Parameter modification for clustering criteria
- 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
- 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
- Title not available (Why is that?)
- Significance of the length of the shortest tree
- Distributions on bicoloured binary trees arising from the principle of parsimony
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructing optimal ultrametrics
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (33)
- Probability of misclassification in model-based clustering
- A Robust Maximal F-Ratio Statistic to Detect Clusters Structure
- Concentration for Poisson functionals: component counts in random geometric graphs
- 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
- Fuzzy clustering models and their related concepts
- 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
- 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
- Reduction of n-th moment measures and the special case of the third moment measure of stationary and isotropic planar point processes
- A novel multimodal probability model for cluster analysis
- 10.1162/1532443041827943
- REMAXINT: a two-mode clustering-based method for statistical inference on two-way interaction
- Heteroscedastic factor mixture analysis
- Exploring the number of groups in robust model-based clustering
- A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix
- Two Models of Random Intersection Graphs and their Applications
- Maximal interaction two-mode clustering
- A probabilistic theory of clustering
- High-dimensional data clustering
- Power analysis for the bootstrap likelihood ratio test for the number of classes in latent class models
- Probabilistic models in cluster analysis
Uses Software
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)