Classification of binary vectors by stochastic complexity.
From MaRDI portal
Recommendations
- Classification of binary vectors by using ΔSC distance to minimize stochastic complexity
- The computational complexity of understanding binary classifier decisions
- scientific article; zbMATH DE number 971347
- scientific article; zbMATH DE number 139608
- Complexity of classification problems
- Sample complexity for computational classification problems
- scientific article; zbMATH DE number 1107550
Cites work
- scientific article; zbMATH DE number 3872359 (Why is no real title available?)
- scientific article; zbMATH DE number 4066122 (Why is no real title available?)
- scientific article; zbMATH DE number 4068049 (Why is no real title available?)
- scientific article; zbMATH DE number 45100 (Why is no real title available?)
- scientific article; zbMATH DE number 48904 (Why is no real title available?)
- scientific article; zbMATH DE number 52032 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3463524 (Why is no real title available?)
- scientific article; zbMATH DE number 1149880 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 2026097 (Why is no real title available?)
- An Information Measure for Classification
- An improved algorithm for finding diagnostic taxonomic descriptions
- Approximate Confidence Intervals for the Number of Clusters
- Approximating probability distributions to reduce storage requirements
- Asymptotic behaviour of classification maximum likelihood estimates
- Clustering criteria for discrete data and latent class models
- Estimating the dimension of a model
- Information-Theoretical Aspects of Inductive and Deductive Inference
- Locally optimal block quantizer design
- Maximal Predictive Classification
- Non-uniqueness in probabilistic numerical identification of bacteria
- Numerical taxonomy and the principle of maximum entropy
- Parameter modification for clustering criteria
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
Cited in
(11)- Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy
- Simple stochastic fingerprints towards mathematical modelling in biology and medicine. I: The treatment of coccidiosis
- Sliding window discretization: a new method for multiple band matching of bacterial genotyping fingerprints
- Probabilistic Models for Bacterial Taxonomy
- Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
- Have I seen you before? Principles of Bayesian predictive classification revisited
- Classification of binary vectors by using ΔSC distance to minimize stochastic complexity
- Learning genetic population structures using minimization of stochastic complexity
- Singling out ill-fit items in a classification. Application to the taxonomy of Enterobacteriaceae
- A unified view on clustering binary data
- On multivariate binary data clustering and feature weighting
This page was built for publication: Classification of binary vectors by stochastic complexity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372217)
