Computing Conditional Probabilities in Large Domains by Maximizing Renyi's Quadratic Entropy
- Topics:
- Electrical and Electronic
- Tags:
- Carnegie-Mellon University,
- Computing,
- Constraint,
- Domain,
- Human Resources,
- Probability,
- Training And Certification,
- Workforce Management
- Source:
- Carnegie Mellon University
FREE Registration is required
Overview: This white paper dissertation discusses the methods for efficiently approximating conditional probabilities in large domains by maximizing the entropy of the distribution given a set of constraints. The constraints are constructed from conditional probabilities, typically of low-order, that can be accurately computed from the training data. By appropriately choosing the constraints, maximum entropy methods can balance the tradeoffs in errors due to bias and variance.
(Is this item miscategorized? Does it need more tags? Let us know.)
Format: PDF | Size: 2,591KB | Date: Jun 2003 | Pages: 126



