Asymmetric Information Measures: How to Extract Knowledge from an Expert So That the Expert's Effort is Minimal
Knowledge acquisition is when we ask experts questions, and put the answers into the computer system. Since this is a very time-consuming task, it is desirable to minimize the effort of an expert.
As a crude estimate for this effort, we can take a number of binary (yes-no) questions that we ask. The procedure that minimizes this number is binary search.
This approach does not take into account that people often feel more comfortable answering "yes" than answering "no". So, to make our estimates more realistic, we will take into consideration that for a negative answer the effort is bigger.
This paper describes a procedure that minimizes the effort of an expert. We also estimate the effort of this "optimal" search procedure.
Original Version: UTEP-CS-00-11
tr00-11a.pdf (254 kB)
1st Updated: UTEP-CS-00-11a
tr00-11b.pdf (253 kB)
2nd Updated: UTEP-CS-00-11b
Published in Proceedings of the International Conference on Information Technology InTech'07, Sydney, Australia, December 12-14, 2007, pp. 136-145; full version published in International Journal of Automation and Control (IJAAC), 2008, Vol. 2, No. 2/3, pp. 153-177.