Introduction to knowledge spaces: How to build, test, and search them.

Abstract

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.

Cites (9)

1. ASPECTS OF THE THEORY OF SYNTAX
   Chomsky, Noam · 1964
2. Untitled work
   1973 · CERN Document Server (European Organization for Nuclear Research)
3. Algorithms for Minimization Without Derivatives
   G., D., Brent, Richard P. · 1974 · Mathematics of Computation
4. Finite Markov chains
   John G. Kemeny, J. Laurie Snell · 1976 · Medical Entomology and Zoology
5. Computer-Based Medical Consultations: MYCIN.
   1976 · Annals of Internal Medicine
6. Psychology: A Study of A Science
   ED, Koch Sigmund, Albert, Ellis · 1962 · The Journal of Nervous and Mental Disease
7. Distributions in Statistics: Continuous Multivariate Distributions.
   Fisk, P. R., Johnson, Norman L., Kotz, Samuel · 1973 · Journal of the Royal Statistical Society. Series A (General)
8. Syntactic Methods in Pattern Recognition
   King‐Sun Fu, М.А. Айзерман · 1976 · IEEE Transactions on Systems Man and Cybernetics
9. Measurement, psychophysics, and neural information processing
   David H. Krantz · 1974 · W.H. Freeman eBooks

Show all 9 references

Cited by (2)

1. A Data Repository for the EDM Community: The PSLC DataShop
   2010 · Handbook of Educational Data Mining
2. Including Learning Analytics in the Loop of Self-Paced Online Course Learning Design
   Yan, Hongxin, Lin, Fuhua, Kinshuk · 2021 · International Journal of Artificial Intelligence in Education

See all 294