A generalized partial credit model: Application of an EM algorithm
1992
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
A generalized partial credit model: Application of an EM algorithm
Authors
Published Date
1992
Publisher
Type
Article
Abstract
The partial credit model (PCM) with a varying
slope parameter is developed and called the
generalized partial credit model (GPCM). The item
step parameter of this model is decomposed to a
location and a threshold parameter, following
Andrich’s (1978) rating scale formulation. The EM
algorithm for estimating the model parameters is
derived. The performance of this generalized
model is compared on both simulated and real
data to a Rasch family of polytomous item
response models. Simulated data were generated
and then analyzed by the various polytomous item
response models. The results demonstrate that the
rating formulation of the GPCM is quite adaptable
to the analysis of polytomous item responses.
The real data used in this study consisted of the
National Assessment of Educational Progress
(Johnson & Allen, 1992) mathematics data that
used both dichotomous and polytomous items.
The PCM was applied to these data using both
constant and varying slope parameters. The GPCM,
which provides for varying slope parameters,
yielded better fit to the data than did the PCM.
Index terms: item response model, National Assessment
of Educational Progress, nominal response
model, partial credit model, polytomous response
model, rating scale model.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Muraki, Eiji. (1992). A generalized partial credit model: Application of an EM algorithm. Applied Psychological Measurement, 16, 159-176. doi:10.1177/014662169201600206
Other identifiers
doi:10.1177/014662169201600206
Suggested citation
Muraki, Eiji. (1992). A generalized partial credit model: Application of an EM algorithm. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/115645.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.