Artificial Intelligence
Inferring decision trees using the minimum description length principle
Information and Computation
Explanation-Based Generalization: A Unifying View
Machine Learning
Machine Learning
Explanation-Based Learning: An Alternative View
Machine Learning
Incorporating redundant learned rules: a preliminary formal analysis of EBL
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Diagnosis with behavioral modes
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Experience learning in model-based diagnostic systems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper describes an inductive learning method in probabilistic domain. It acquires an appropriate probabilistic model from a small amount of observation data. In order to derive an appropriate probabilistic model, a presumption tree with least description length is constructed. Description length of a presumption tree is defined as the sum of its code length and log-likelihood. Using a constructed presumption tree, the probabilistic distribution of future events can be presumed appropriately from observations of occurrences in the past. This capability enables the efficiency of certain kinds of performance systems, such as diagnostic system, that deal with probabilistic problems. The experimental results show that a model-based diagnostic system performs efficiently by making good use of the learning mechanism. In comparison with a simple probability estimation method, it is shown that the proposed approach requires fewer observations, to acquire an appropriate probabilistic model.