Item Selection Algorithm Based on Collaborative Filtering for Item Exposure Control

preprint OA: closed Public-Domain
🔓 Open OA copy View at publisher

Abstract

In computerized adaptive testing, overexposure of items in the bank is a serious problem and might result in item compromise (e.g., Veldkamp et al., 2010). We develop an item selection algorithm that utilizes the entire bank well and reduces overexposure of items. The algorithm is based on collaborative filtering (Su & Khoshgoftaar, 2009) and selects an item in two stages. In the first stage, a set of candidate items whose expected performance well matches the examinee’s current performance is selected. In the second stage, an item that is the approximately matched to the most recently administered item is selected from the candidate set. The expected performance of an examinee on an item is predicted by autoencoders (Goodfellow et al., 2016). Simulation results show that the proposed algorithm outperforms existing item selection algorithms in terms of item exposure while incurring only a small loss in measurement precision.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: Public-Domain