Approximating probability distributions to reduce storage requirements
From MaRDI portal
Cited in
(20)- Existence of extensions and product extensions for discrete probability distributions
- Classification of binary vectors by stochastic complexity.
- Auxiliary information: the raking-ratio empirical process
- Associative naïve Bayes classifier: automated linking of gene ontology to medline documents
- Relating and approximating discrete probability distributions with component distributions
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions
- scientific article; zbMATH DE number 3872489 (Why is no real title available?)
- RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS
- DETERMINATION OF UNBIASED RECONSTRUCTIONS
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†
- The table look-up rule
- scientific article; zbMATH DE number 513103 (Why is no real title available?)
- METASYSTEMS AND THE MAXIMUM ENTROPY PRINCIPLE
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- Feature selection based on the best-path algorithm in high dimensional graphical models
- Order independence and factor convergence in iterative scaling
- A brief survey on probability distribution approximation
- An algebra of probability over finite product spaces, with applications
This page was built for publication: Approximating probability distributions to reduce storage requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3273538)
