Approximate Maximum Entropy Joint Feature Inference Consistent with Arbitrary Lower-Order Probability Constraints: Application to Statistical Classification | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Approximate Maximum Entropy Joint Feature Inference Consistent with Arbitrary Lower-Order Probability Constraints: Application to Statistical Classification

Neural Computation (2000) 12 (9): 2175–2207.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Eliciting vague but proper maximal entropy priors in Bayesian experiments

Nicolas Bousquet

Statistical Papers (2010) 51 (3): 613.

An Extension of Iterative Scaling for Decision and Data Aggregation in Ensemble Classification

Siddharth Pal
David J. Miller

The Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology (2007) 48 (1-2): 21.

Transductive Methods for the Distributed Ensemble Classification Problem

David J. Miller
Siddharth Pal

Neural Computation (2007) 19 (3): 856.

General statistical inference for discrete and mixed spaces by an approximate application of the maximum entropy principle

D.J. Miller

IEEE Transactions on Neural Networks (2000) 11 (3): 558.