Delete items only when test reliability improves upon deletion¶
Design Method · All design methods
Evidence · 2 claims (2 for) · 1 study (1 theoretical),q1· 0 of 1 report an effect size · 2 claims rest on one study
Description¶
The article proposes a data-driven item-deletion procedure: identify candidate items via the k0 intersection acceptance region (k0 ± 2SD of item scores, difficulty or discriminating values), skewness of the parameter distributions, or marginal point-biserial item reliability, but it states plainly that "Deletion of items is advisable only when reliability of the test improves upon deletion." Deletion changes both test difficulty and discriminating values, so impact must be checked before removing items.
Design Implications¶
Context¶
Requirements¶
- Compute item difficulty and discriminating values and the k0 intersection point; recompute test reliability and error variance after any candidate deletion
Constraints¶
- (k0 ± 3SD) may result in discarding too few items; choice of ∆ may depend on original number of items, type of test, and whether the test measures single or multiple dimensions
- Items must not be deleted if test reliability gets reduced or error variance of the test gets increased
Target Learners¶
- test developers and psychometricians assessing binary-item tests
Target Learning Objectives¶
- improving test discrimination and reliability through item selection
Claims¶
- K0 Intersection Item Deletion Criterion [+M]
- Point Biserial Negative Test Discrimination Relation [+W]
Related Principles¶
Examples¶
-
Key Sources¶
- Chakrabartty, S. N. (2021). Assessment of item and test parameters: Cosine similarity approach. International Journal of Psychology and Educational Studies, 8(3), 28-38. https://dx.doi.org/10.52380/ijpes.2021.8.3.190
Page metadata
| Field | Value |
|---|---|
type |
method |
id |
item-deletion-only-if-reliability-improves |
title |
Delete items only when test reliability improves upon deletion |
description |
The article proposes a data-driven item-deletion procedure: identify candidate items via the k0 intersection acceptance region (k0 ± 2SD of item scores, difficulty or discriminating values), skewness of the parameter... |
status |
review |
generated |
by process:wiki-ingest on 2026-09-25 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — chakrabartty-2021 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.