Operations and evaluation measures for learning possibilistic graphical models
β Scribed by Christian Borgelt; Rudolf Kruse
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 354 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
β¦ Synopsis
One focus of research in graphical models is how to learn them from a dataset of sample cases. This learning task can pose unpleasant problems if the dataset to learn from contains imprecise information in the form of sets of alternatives instead of precise values. In this paper we study an approach to cope with these problems, which is not based on probability theory as the more common approaches like, e.g., expectation maximization, but uses possibility theory as the underlying calculus of a graphical model. Since the search methods employed in a learning algorithm are relatively independent of the underlying uncertainty or imprecision calculus, we focus on evaluation measures (or scoring functions).
π SIMILAR VOLUMES
A graphical approach is proposed for the purpose of assessing the overall prediction capability of a nonlinear design inside a region of interest R. A visual description is given of the behavior of the meansquared error of prediction throughout the region R. More explicitly, for each of several conc
Process control problems can be modeled as closed recursive games. Learning strategies for such games is equivalent to the concept of learning inΓΏnite recursive branches for recursive trees. We use this branch learning model to measure the di culty of learning and synthesizing process controllers. W