Combinatorial structures and structures for classification

DOI10.1016/S0167-9473(96)00028-XzbMath0900.62320OpenAlexW1991403374MaRDI QIDQ1350822

Bernard van Cutsem

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/s0167-9473(96)00028-x

zbMATH Keywords

Markov chainsCombinatorial structures operations and specifications, uniform random generationStructures of classification, partitions, hierarchies

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items

Probabilistic models in cluster analysis ⋮ Editorial ⋮ Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy

Uses Software

• Gaia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting dendrograms: A survey
• On a recurrence involving Stirling numbers
• A method and two algorithms on the theory of partitions
• A calculus for the random generation of labelled combinatorial structures
• Hierarchical clustering schemes
• A CONVERGENCE CRITERION FOR RECURRENT SEQUENCES WITH APPLICATION TO THE PARTITION LATTICE
• Renewal-type behavior of absorption times in Markov chains
• The probabilities of rooted tree-shapes generated by random bifurcation