Inductive item tree analysis: Corrections, improvements, and comparisons
There are various methods in knowledge space theory for building knowledge structures or surmise relations from data. Few of them have been thoroughly analyzed, making it difficult to decide which of these methods provides good results and when to apply each of the methods. In this paper, we investigate the method known as inductive item tree analysis and discuss the advantages and disadvantages of this algorithm. In particular, we introduce some corrections and improvements to it, resulting in two newly proposed algorithms. These algorithms and the original inductive item tree analysis procedure are compared in a simulation study and with empirical data.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Schrepp, Martin, 1999. "On the empirical construction of implications between bi-valued test items," Mathematical Social Sciences, Elsevier, vol. 38(3), pages 361-375, November.
- Schrepp, Martin, 2007. "On the evaluation of fit measures for quasi-orders," Mathematical Social Sciences, Elsevier, vol. 53(2), pages 196-208, March.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:58:y:2009:i:3:p:376-392. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.