IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v58y2009i3p376-392.html
   My bibliography  Save this article

Inductive item tree analysis: Corrections, improvements, and comparisons

Author

Listed:
  • Sargin, Anatol
  • Ünlü, Ali

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.

Suggested Citation

  • Sargin, Anatol & Ünlü, Ali, 2009. "Inductive item tree analysis: Corrections, improvements, and comparisons," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 376-392, November.
    • Handle: RePEc:eee:matsoc:v:58:y:2009:i:3:p:376-392
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00060-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Schrepp, Martin, 2007. "On the evaluation of fit measures for quasi-orders," Mathematical Social Sciences, Elsevier, vol. 53(2), pages 196-208, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. repec:jss:jstsof:37:i02 is not listed on IDEAS
    2. Ünlü, Ali & Schrepp, Martin, 2015. "Untangling comparison bias in inductive item tree analysis based on representative random quasi-orders," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 31-43.
    3. Goran Savić & Milan Segedinac & Zora Konjović & Milan Vidaković & Radoslav Dutina, 2023. "Towards a Domain-Neutral Platform for Sustainable Digital Twin Development," Sustainability, MDPI, vol. 15(18), pages 1-23, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ünlü, Ali & Schrepp, Martin, 2015. "Untangling comparison bias in inductive item tree analysis based on representative random quasi-orders," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 31-43.
    2. Schrepp, Martin, 2006. "ITA 2.0: A Program for Classical and Inductive Item Tree Analysis," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 16(i10).
    3. repec:jss:jstsof:16:i10 is not listed on IDEAS
    4. Schrepp, Martin, 2006. "Properties of the correlational agreement coefficient: A comment to Unlu and Albert (2004)," Mathematical Social Sciences, Elsevier, vol. 51(1), pages 117-123, January.
    5. Unlu, Ali & Albert, Dietrich, 2004. "The Correlational Agreement Coefficient CA(D)--a mathematical analysis of a descriptive goodness-of-fit measure," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 281-314, November.
    6. Schrepp, Martin, 2007. "On the evaluation of fit measures for quasi-orders," Mathematical Social Sciences, Elsevier, vol. 53(2), pages 196-208, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.