Introduction to algorithms
Entropy and Information
| Hi-index | 0.00 |
In recent decades, the development and application of expert systems has been under intensive study (e.g., see [1---3]). The construction of an optimal algorithm for guessing an object by sequentially asking questions about its properties in the case when the answers may be incorrect is considered. This algorithm can be used in expert systems. Several optimization criteria are considered. It is concluded that the most practical criterion is the entropy minimization. The one-step entropy minimization is an analog of a deterministic greedy algorithm. The question asked by the expert system that minimizes the entropy can be chosen at each step of the procedure for any search depth depending on available computational resources.