Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy

DOI10.1016/S0025-5564(01)00096-7zbMath1003.62023OpenAlexW2132509480WikidataQ48733489 ScholiaQ48733489MaRDI QIDQ1602623

Timo Koski, Mats Gyllenberg

Publication date: 23 June 2002

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0025-5564(01)00096-7

zbMATH Keywords

classificationidentificationsupervised learningmultivariate binary dataBahadur-Lazarsfeld expansionsBayesian risk consistencymultivariate Bernoulli distributions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Bayesian inference (62F15)

Related Items

Bayesian analysis of population structure based on linked molecular information, Probabilistic Models for Bacterial Taxonomy, Random partition models and exchangeability for Bayesian identification of population struc\-ture, Learning genetic population structures using minimization of stochastic complexity, Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy

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
• École d'été de probabilités de Saint-Flour XIII - 1983
• Bayesian predictive identification and cumulative classification of bacteria
• W. E. Johnson's sufficientness postulate
• An improved algorithm for finding diagnostic taxonomic descriptions
• Exchangeable urn processes
• The role of exchangeability in inference
• Predicting the unpredictable
• Inductive reasoning and Kolmogorov complexity
• Uses of exchangeability
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
• Jeffreys' prior is asymptotically least favorable under entropy risk
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Stochastic complexity in learning
• Classification of binary vectors by stochastic complexity.
• Probably almost Bayes decisions
• Exchangeable and partially exchangeable random partitions
• Theory of statistics
• On the stochastic complexity of learning realizable and unrealizable rules
• The performance of universal encoding
• I.—PROBABILITY: THE DEDUCTIVE AND INDUCTIVE PROBLEMS
• Updating Subjective Probability
• Universal noiseless coding
• Probabilistic Models for Bacterial Taxonomy
• Fisher information and stochastic complexity
• Randomly Generated Nonlinear Transformations for Pattern Recognition
• Codes based on inaccurate source probabilities
• A note on exchangeable sequences