Approximating probability distributions to reduce storage requirements
From MaRDI portal
Publication:3273538
DOI10.1016/S0019-9958(59)90207-4zbMath0095.32602OpenAlexW2085294315MaRDI QIDQ3273538
Publication date: 1959
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(59)90207-4
Related Items
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, Existence of extensions and product extensions for discrete probability distributions, Classification of binary vectors by stochastic complexity., RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS, Unnamed Item, Auxiliary information: the raking-ratio empirical process, METASYSTEMS AND THE MAXIMUM ENTROPY PRINCIPLE, An algebra of probability over finite product spaces, with applications, Order independence and factor convergence in iterative scaling, UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS, The table look-up rule, Associative naïve Bayes classifier: automated linking of gene ontology to medline documents, Unnamed Item, Relating and approximating discrete probability distributions with component distributions, RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†, DETERMINATION OF UNBIASED RECONSTRUCTIONS, Unnamed Item
