Inductive item tree analysis: Corrections, improvements, and comparisons

  • Sargin A
  • Ünlü A
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 13

    Citations

    Citations of this article.

Abstract

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. © 2009 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Deriving surmise relations
  • Inductive item tree analysis
  • Knowledge space theory

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Anatol Sargin

  • Ali Ünlü

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free