Automatic Classification of Open-Ended Questions: Check-All-That-Apply Questions

• Published in: Social science computer review Vol. 39; no. 4; pp. 562 - 572
• Main Authors: Schonlau, Matthias, Gweon, Hyukjun, Wenemark, Marika
• Format: Journal Article
• Language: English
• Published: Los Angeles, CA SAGE Publications 01.08.2021; SAGE PUBLICATIONS, INC
• Subjects: Algorithms; Automatic classification; Bivariate analysis; Civil disobedience; Classification; Coders; Correlation; Data; Immigrants; Labels; Machine learning; Noncitizens; Obedience; Offenses; Performance evaluation; Questions; Statistical models; multilabel; statistical learning; check-all-that-apply; text; machine learning; open-ended questions
• ISSN: 0894-4393; 1552-8286; 1552-8286
• DOI: 10.1177/0894439319869210

Text data from open-ended questions in surveys are challenging to analyze and are often ignored. Open-ended questions are important though because they do not constrain respondents’ answers. Where open-ended questions are necessary, often human coders manually code answers. When data sets are large, it is impractical or too costly to manually code all answer texts. Instead, text answers can be converted into numerical variables, and a statistical/machine learning algorithm can be trained on a subset of manually coded data. This statistical model is then used to predict the codes of the remainder. We consider open-ended questions where the answers are coded into multiple labels (all-that-apply questions). For example, in the open-ended question in our Happy example respondents are explicitly told they may list multiple things that make them happy. Algorithms for multilabel data take into account the correlation among the answer codes and may therefore give better prediction results. For example, when giving examples of civil disobedience, respondents talking about “minor nonviolent offenses” were also likely to talk about “crimes.” We compare the performance of two different multilabel algorithms (random k-labelsets [RAKEL], classifier chains [CC]) to the default method of binary relevance (BR) which applies single-label algorithms to each code separately. Performance is evaluated on data from three open-ended questions (Happy, Civil Disobedience, and Immigrant). We found weak bivariate label correlations in the Happy data (90th percentile: 7.6%), and stronger bivariate label correlations in the Civil Disobedience (90th percentile: 17.2%) and Immigrant (90th percentile: 19.2%) data. For the data with stronger correlations, we found both multilabel methods performed substantially better than BR using 0/1 loss (“at least one label is incorrect”) and had little effect when using Hamming loss (average error). For data with weak label correlations, we found no difference in performance between multilabel methods and BR. We conclude that automatic classification of open-ended questions that allow multiple answers may benefit from using multilabel algorithms for 0/1 loss. The degree of correlations among the labels may be a useful prognostic tool.