Although Behavior-Knowledge Space (BKS) method does not need any assumptions in combining multiple experts, it should build theoretically exponential storage spaces for storing and managing jointly observed K decisions from K experts. That is, combining K experts needs a (K+1)st-order probability distribution. However, it is well known that the distribution becomes unmanageable in storing and estimating, even for a small K. In order to overcome such weakness, it would be attractive to decompose the distribution into a number of component distributions and to approximate the distribution with a product of the component distributions. One of such previous works is to apply a conditional independence assumption to the distribution. Another work is to approximate the distribution with a product of only first-order tree dependencies or second-order distributions as shown in . In this paper, a dependency-based framework is proposed to optimally approximate a probability distribution with a product set of dth-order dependencies where 1≤d≤K, and to combine multiple experts based on the product set using the Bayesian formalism. This framework was experimented and evaluated with a standardized CEN-PARMI data base.
|Number of pages||6|
|Journal||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|Publication status||Published - 1999 Jan 1|
|Event||Proceedings of the 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Fort Collins, CO, USA|
Duration: 1999 Jun 23 → 1999 Jun 25
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition