IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v87y2022i1d10.1007_s11336-021-09788-9.html
   My bibliography  Save this article

Multidimensional Item Response Theory in the Style of Collaborative Filtering

Author

Listed:
  • Yoav Bergner

    (New York University)

  • Peter Halpin

    (University of North Carolina-Chapel Hill)

  • Jill-Jênn Vie

    (Inria)

Abstract

This paper presents a machine learning approach to multidimensional item response theory (MIRT), a class of latent factor models that can be used to model and predict student performance from observed assessment data. Inspired by collaborative filtering, we define a general class of models that includes many MIRT models. We discuss the use of penalized joint maximum likelihood to estimate individual models and cross-validation to select the best performing model. This model evaluation process can be optimized using batching techniques, such that even sparse large-scale data can be analyzed efficiently. We illustrate our approach with simulated and real data, including an example from a massive open online course. The high-dimensional model fit to this large and sparse dataset does not lend itself well to traditional methods of factor interpretation. By analogy to recommender-system applications, we propose an alternative “validation” of the factor model, using auxiliary information about the popularity of items consulted during an open-book examination in the course.

Suggested Citation

  • Yoav Bergner & Peter Halpin & Jill-Jênn Vie, 2022. "Multidimensional Item Response Theory in the Style of Collaborative Filtering," Psychometrika, Springer;The Psychometric Society, vol. 87(1), pages 266-288, March.
  • Handle: RePEc:spr:psycho:v:87:y:2022:i:1:d:10.1007_s11336-021-09788-9
    DOI: 10.1007/s11336-021-09788-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11336-021-09788-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11336-021-09788-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Jin, Shaobo & Moustaki, Irini & Yang-Wallentin, Fan, 2018. "Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case," LSE Research Online Documents on Economics 88118, London School of Economics and Political Science, LSE Library.
    2. R. Bock & Murray Aitkin, 1981. "Marginal maximum likelihood estimation of item parameters: Application of an EM algorithm," Psychometrika, Springer;The Psychometric Society, vol. 46(4), pages 443-459, December.
    3. Shaobo Jin & Irini Moustaki & Fan Yang-Wallentin, 2018. "Approximated Penalized Maximum Likelihood for Exploratory Factor Analysis: An Orthogonal Case," Psychometrika, Springer;The Psychometric Society, vol. 83(3), pages 628-649, September.
    4. Cho, S.-J. & Rabe-Hesketh, S., 2011. "Alternating imputation posterior estimation of models with crossed random effects," Computational Statistics & Data Analysis, Elsevier, vol. 55(1), pages 12-25, January.
    5. Jianan Sun & Yunxiao Chen & Jingchen Liu & Zhiliang Ying & Tao Xin, 2016. "Latent Variable Selection for Multidimensional Item Response Theory Models via $$L_{1}$$ L 1 Regularization," Psychometrika, Springer;The Psychometric Society, vol. 81(4), pages 921-939, December.
    6. Fan J. & Li R., 2001. "Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1348-1360, December.
    7. Li Cai, 2010. "High-dimensional Exploratory Item Factor Analysis by A Metropolis–Hastings Robbins–Monro Algorithm," Psychometrika, Springer;The Psychometric Society, vol. 75(1), pages 33-57, March.
    8. Yunzhang Zhu & Xiaotong Shen & Changqing Ye, 2016. "Personalized Prediction and Sparsity Pursuit in Latent Factor Models," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 111(513), pages 241-252, March.
    9. Nickolay Trendafilov & Kohei Adachi, 2015. "Sparse Versus Simple Structure Loadings," Psychometrika, Springer;The Psychometric Society, vol. 80(3), pages 776-790, September.
    10. Chalmers, R. Philip, 2012. "mirt: A Multidimensional Item Response Theory Package for the R Environment," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 48(i06).
    11. Nickolay T. Trendafilov & Sara Fontanella & Kohei Adachi, 2017. "Sparse Exploratory Factor Analysis," Psychometrika, Springer;The Psychometric Society, vol. 82(3), pages 778-794, September.
    12. Yunxiao Chen & Xiaoou Li & Siliang Zhang, 2019. "Joint Maximum Likelihood Estimation for High-Dimensional Exploratory Item Factor Analysis," Psychometrika, Springer;The Psychometric Society, vol. 84(1), pages 124-146, March.
    13. Chen, Yunxiao & Li, Xiaoou & Zhang, Siliang, 2019. "Structured latent factor analysis for large-scale data: identifiability, estimability, and their implications," LSE Research Online Documents on Economics 101122, London School of Economics and Political Science, LSE Library.
    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. John Patrick Lalor & Pedro Rodriguez, 2023. "py-irt : A Scalable Item Response Theory Library for Python," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 5-13, January.

    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. Christopher J. Urban & Daniel J. Bauer, 2021. "A Deep Learning Algorithm for High-Dimensional Exploratory Item Factor Analysis," Psychometrika, Springer;The Psychometric Society, vol. 86(1), pages 1-29, March.
    2. Geminiani, Elena & Marra, Giampiero & Moustaki, Irini, 2021. "Single and multiple-group penalized factor analysis: a trust-region algorithm approach with integrated automatic multiple tuning parameter selection," LSE Research Online Documents on Economics 108873, London School of Economics and Political Science, LSE Library.
    3. Yunxiao Chen & Xiaoou Li & Siliang Zhang, 2019. "Joint Maximum Likelihood Estimation for High-Dimensional Exploratory Item Factor Analysis," Psychometrika, Springer;The Psychometric Society, vol. 84(1), pages 124-146, March.
    4. Elena Geminiani & Giampiero Marra & Irini Moustaki, 2021. "Single- and Multiple-Group Penalized Factor Analysis: A Trust-Region Algorithm Approach with Integrated Automatic Multiple Tuning Parameter Selection," Psychometrika, Springer;The Psychometric Society, vol. 86(1), pages 65-95, March.
    5. Siliang Zhang & Yunxiao Chen, 2022. "Computation for Latent Variable Model Estimation: A Unified Stochastic Proximal Framework," Psychometrika, Springer;The Psychometric Society, vol. 87(4), pages 1473-1502, December.
    6. Zhang, Siliang & Chen, Yunxiao, 2022. "Computation for latent variable model estimation: a unified stochastic proximal framework," LSE Research Online Documents on Economics 114489, London School of Economics and Political Science, LSE Library.
    7. Björn Andersson & Tao Xin, 2021. "Estimation of Latent Regression Item Response Theory Models Using a Second-Order Laplace Approximation," Journal of Educational and Behavioral Statistics, , vol. 46(2), pages 244-265, April.
    8. Jin, Shaobo & Moustaki, Irini & Yang-Wallentin, Fan, 2018. "Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case," LSE Research Online Documents on Economics 88118, London School of Economics and Political Science, LSE Library.
    9. Yang Liu, 2020. "A Riemannian Optimization Algorithm for Joint Maximum Likelihood Estimation of High-Dimensional Exploratory Item Factor Analysis," Psychometrika, Springer;The Psychometric Society, vol. 85(2), pages 439-468, June.
    10. Shaobo Jin & Irini Moustaki & Fan Yang-Wallentin, 2018. "Approximated Penalized Maximum Likelihood for Exploratory Factor Analysis: An Orthogonal Case," Psychometrika, Springer;The Psychometric Society, vol. 83(3), pages 628-649, September.
    11. Alexander Robitzsch, 2021. "A Comprehensive Simulation Study of Estimation Methods for the Rasch Model," Stats, MDPI, vol. 4(4), pages 1-23, October.
    12. Liu, Xinyi Lin & Wallin, Gabriel & Chen, Yunxiao & Moustaki, Irini, 2023. "Rotation to sparse loadings using Lp losses and related inference problems," LSE Research Online Documents on Economics 118349, London School of Economics and Political Science, LSE Library.
    13. Battauz, Michela & Vidoni, Paolo, 2022. "A likelihood-based boosting algorithm for factor analysis models with binary data," Computational Statistics & Data Analysis, Elsevier, vol. 168(C).
    14. Yang Liu & Jan Hannig, 2017. "Generalized Fiducial Inference for Logistic Graded Response Models," Psychometrika, Springer;The Psychometric Society, vol. 82(4), pages 1097-1125, December.
    15. Zhang, Haoran & Chen, Yunxiao & Li, Xiaoou, 2020. "A note on exploratory item factor analysis by singular value decomposition," LSE Research Online Documents on Economics 104166, London School of Economics and Political Science, LSE Library.
    16. Yunxiao Chen, 2020. "A Continuous-Time Dynamic Choice Measurement Model for Problem-Solving Process Data," Psychometrika, Springer;The Psychometric Society, vol. 85(4), pages 1052-1075, December.
    17. Chen, Yunxiao & Li, Xiaoou, 2022. "Determining the number of factors in high-dimensional generalized latent factor models," LSE Research Online Documents on Economics 111574, London School of Economics and Political Science, LSE Library.
    18. Haoran Zhang & Yunxiao Chen & Xiaoou Li, 2020. "A Note on Exploratory Item Factor Analysis by Singular Value Decomposition," Psychometrika, Springer;The Psychometric Society, vol. 85(2), pages 358-372, June.
    19. Zhehan Jiang & Jonathan Templin, 2019. "Gibbs Samplers for Logistic Item Response Models via the Pólya–Gamma Distribution: A Computationally Efficient Data-Augmentation Strategy," Psychometrika, Springer;The Psychometric Society, vol. 84(2), pages 358-374, June.
    20. Ping Chen & Chun Wang, 2021. "Using EM Algorithm for Finite Mixtures and Reformed Supplemented EM for MIRT Calibration," Psychometrika, Springer;The Psychometric Society, vol. 86(1), pages 299-326, 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:spr:psycho:v:87:y:2022:i:1:d:10.1007_s11336-021-09788-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.