|
||||
|
||||
Item Selection by an Extended Latent Class Model: An Application to Nursing Homes EvaluationFrancesco BartolucciUniversità di Perugia - Finanza e Statistica - Dipartimento di Economia Giorgio Eduardo MontanariUniversity of Perugia Silvia PandolfiUniversity of Perugia - Department of Economics, Finance and Statistics April 16, 2012 Abstract: The evaluation of nursing homes and the assessment of the quality of the health care provided to their patients are usually based on the administration of questionnaires made of a large number of polytomous items. In applications involving data collected by questionnaires of this type, the Latent Class (LC) model represents a useful tool for classifying subjects in homogenous groups. In this paper, we propose an algorithm for item selection, which is based on the LC model. The proposed algorithm is aimed at finding the smallest subset of items which provides an amount of information close to that of the initial set. The method sequentially eliminates the items that do not significantly change the classification of the subjects in the sample with respect to the classification based on the full set of items. The LC model, and then the item selection algorithm, may be also used with missing responses that are dealt with assuming a form of latent ignorability. The potentialities of the proposed approach are illustrated through an application to a nursing home dataset collected within the ULISSE project, which concerns the quality-of-life of elderly patients hosted in Italian nursing homes. The dataset presents several issues, such as missing responses and a very large number of items included in the questionnaire.
Number of Pages in PDF File: 33 Keywords: expectation-maximization algorithm, polytomous items, quality-of-life, ULISSE project JEL Classification: C13, C33, I11 working papers seriesDate posted: April 18, 2012 ; Last revised: April 27, 2012Suggested CitationContact Information
|
|
||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo8 in 0.313 seconds