Comparing Optimization Algorithms for Item Selection in Mokken Scale Analysis

Mokken scale analysis uses an automated bottom-up stepwise item selection procedure that suffers from two problems. First, when selected during the procedure items satisfy the scaling conditions but they may fail to do so after the scale has been completed. Second, the procedure is approximate and t...

Full description

Saved in:
Bibliographic Details
Published in:Journal of classification Vol. 30; no. 1; pp. 75 - 99
Main Authors: Straat, J. Hendrik, van der Ark, L. Andries, Sijtsma, Klaas
Format: Journal Article
Language:English
Published: New York Springer-Verlag 01.04.2013
Springer Nature B.V
Subjects:
Algorithms
Alleviation
Analysis
Bioinformatics
Classification
Genetic algorithms
Genetics
Marketing
Mathematics and Statistics
Measures
Optimization
Pattern Recognition
Psychometrics
Selection
Signal,Image and Speech Processing
Simulation
Statistical Theory and Methods
Statistics
Mokken scaling
Item selection
Genetic algorithm
Test construction
ISSN:0176-4268, 1432-1343
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Mokken scale analysis uses an automated bottom-up stepwise item selection procedure that suffers from two problems. First, when selected during the procedure items satisfy the scaling conditions but they may fail to do so after the scale has been completed. Second, the procedure is approximate and thus may not produce the optimal item partitioning. This study investigates a variation on Mokken’s item selection procedure, which alleviates the first problem, and proposes a genetic algorithm, which alleviates both problems. The genetic algorithm is an approximation to checking all possible partitionings. A simulation study shows that the genetic algorithm leads to better scaling results than the other two procedures.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0176-4268
1432-1343
DOI:10.1007/s00357-013-9122-y