INTRODUCTION TO KNOWLEDGE SPACES - HOW TO BUILD, TEST, AND SEARCH THEM

被引:169
作者
FALMAGNE, JC
DOIGNON, JP
KOPPEN, M
VILLANO, M
JOHANNESEN, L
机构
[1] CTR ADV STUDY BEHAV SCI, STANFORD, CA 94305 USA
[2] UNIV LIBRE BRUXELLES, B-1050 BRUSSELS, BELGIUM
[3] NYU, NEW YORK, NY 10003 USA
[4] HONEYWELL INC, HONEYWELL SYST & RES CTR, MINNEAPOLIS, MN 55413 USA
关键词
D O I
10.1037/0033-295X.97.2.201
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
This article gives a comprehensive description of a theory for the efficient assessment of knowledge. The essential concept is that the knowledge state of a subject with regard to a specified field of information can be represented by a particular subset of questions or problems that the subject is capable of solving. The family of all knowledge states forms the knowledge space. It is assumed that if 2 subsets K and K′ of questions are assumed to be states in a knowledge space , then KU K′ is also assumed to be a state in K. Such a theory is consistent with the idea that at least some of the notions in the field may be acquired from different sets of prerequisites. Various aspects of the theory are discussed. In particular, the problem of constructing a knowledge space in practice is analyzed in detail. A first sketch of the knowledge space can be obtained by consulting expert teachers in the field. The mathematical theory necessary to render this consultation efficient is given. This preliminary construction can then be tested and refined on the basis of empirical data. To this end, a probabilistic version of the theory is developed, which is similar in spirit to some psychometric models, but it is grounded on the concept of a knowledge space rather than on that of skill or ability. An exemplary application of this probabilistic theory to a high school mathematics test is described, based on a sample of several hundred students. By standard likelihood ratio methods, it is shown how the preliminary knowledge space can be gradually refined, and the number of possible knowledge states substantially reduced. Two classes of Markovian knowledge assessment algorithms are outlined. Most of the results presented summarize previous articles published in various technical journals. The application of the probabilistic theory to the high school mathematics test is original to this article.
引用
收藏
页码:201 / 224
页数:24
相关论文
共 31 条
[1]  
Birkhoff G., 1937, DUKE MATH J, V3, P443, DOI DOI 10.1215/S0012-7094-37-00334-X
[2]  
Brent R., 1973, ALGORITHMS MINIMIZAT
[3]  
Chomsky N., 1965, ASPECTS THEORY SYNTA
[4]   LANGUAGES FOR THE ASSESSMENT OF KNOWLEDGE [J].
DEGREEF, E ;
DOIGNON, JP ;
DUCAMP, A ;
FALMAGNE, JC .
JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1986, 30 (03) :243-256
[5]  
DOIGNON JP, 1988, DISCRETE APPL MATH, V21, P87, DOI 10.1016/0166-218X(88)90046-7
[6]  
DOIGNON JP, 1985, INT J MAN MACH STUD, V23, P175, DOI 10.1016/S0020-7373(85)80031-6
[7]  
DOIGNON JP, 1987, BEITRAGE BEGRIFFSANA, P129
[8]  
Duda R. O., 1973, PATTERN CLASSIFICATI
[9]  
Falmagne J. C., 1989, IMA, V17
[10]   A MARKOVIAN PROCEDURE FOR ASSESSING THE STATE OF A SYSTEM [J].
FALMAGNE, JC ;
DOIGNON, JP .
JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1988, 32 (03) :232-258