A procedure for the incremental construction of a knowledge space. (English) Zbl 1069.91095
Summary: Knowledge spaces are structures for the efficient assessment of the knowledge state of a student in a given field of knowledge. Existing procedures for constructing a knowledge space by querying an expert assume that the domain of questions is known in advance, and that it is fixed during the whole query process. The outcome of these procedures is a knowledge space on the questions in that domain. If the original domain is extended with new questions, a new knowledge space on the extended domain can be produced by expert query. Since in this case a knowledge space for the original domain already exists, the available information can be used to extend the existing space in an efficient way, thus avoiding to apply expert query from scratch. Existing procedures do not provide an explicit way to use such information. Although these procedures can be adapted to this purpose, in this paper a new query algorithm that is specifically tailored for the problem above mentioned is presented.
MSC:
| 91E40 | Memory and learning in psychology |
References:
| [1] | Albert, D., & Held, T. (1994). Establishing knowledge spaces by systematical problem construction. In D. Albert (Ed.), Knowledge structures; Albert, D., & Held, T. (1994). Establishing knowledge spaces by systematical problem construction. In D. Albert (Ed.), Knowledge structures |
| [2] | Doignon, J.-P.; Falmagne, J.-C., Spaces for the assessment of knowledge, International Journal for Man-Machine Studies, 23, 175-196 (1985) · Zbl 0581.68066 |
| [3] | Doignon, J.-P.; Falmagne, J.-C., Knowledge spaces (1999), Springer: Springer Berlin · Zbl 0908.92040 |
| [4] | Dowling, C., Applying the basis of a knowledge space for controlling the questioning of an expert, Journal of Mathematical Psychology, 37, 21-48 (1993) · Zbl 0811.92031 |
| [5] | Kambouri, M.; Koppen, M.; Villano, M.; Falmagne, J.-C., Knowledge assessmentTapping human expertise by the query routine, International Journal of Human-Computer Studies, 40, 119-151 (1994) |
| [6] | Koppen, M., Extracting human expertise for constructing knowledge spacesAn algorithm, Journal of Mathematical Psychology, 37, 1-20 (1993) · Zbl 0768.92029 |
| [7] | Koppen, M.; Doignon, J.-P., How to build a knowledge space by querying and expert, Journal of Mathematical Psychology, 34, 311-331 (1990) · Zbl 0725.92029 |
| [8] | Lukas, J., & Albert, D. (1993). Knowledge assessment based on skill assignment and psychological task analysis. In G. Strube & K. F. Wender (Eds.), The cognitive psychology of knowledge; Lukas, J., & Albert, D. (1993). Knowledge assessment based on skill assignment and psychological task analysis. In G. Strube & K. F. Wender (Eds.), The cognitive psychology of knowledge |
| [9] | Stefanutti, L. (1999). Strutture dazioneteoriametodi e modelli matematici per una valutazione efficiente dei processi organizzativi; Stefanutti, L. (1999). Strutture dazioneteoriametodi e modelli matematici per una valutazione efficiente dei processi organizzativi |
| [10] | Stefanutti, L., & Cristante, F. (2001). Knowledge space constructionTesting agreement among experts by means of log-linear models; Stefanutti, L., & Cristante, F. (2001). Knowledge space constructionTesting agreement among experts by means of log-linear models |
| [11] | Theuns, P. (1998). Building a knowledge space via boolean analysis of co-occurrence data. In C. Dowling, F. Roberts, & P. Theuns (Eds.), Recent progress in mathematical psychology; Theuns, P. (1998). Building a knowledge space via boolean analysis of co-occurrence data. In C. Dowling, F. Roberts, & P. Theuns (Eds.), Recent progress in mathematical psychology · Zbl 1058.91578 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
