IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v36y2019i3d10.1007_s00357-018-9292-8.html
   My bibliography  Save this article

Card Sorting Data Collection Methodology: How Many Participants Is Most Efficient?

Author

Listed:
  • Ethan Lantz

    (Mississippi State University)

  • Jared W. Keeley

    (Mississippi State University)

  • Michael C. Roberts

    (University of Kansas)

  • Maria Elena Medina-Mora

    (Instituto Nacional de Psiquiatría ‘Ramón de la Fuente’)

  • Pratap Sharan

    (All India Institute of Medical Sciences)

  • Geoffrey M. Reed

    (Columbia University)

Abstract

Pairwise similarity judgments and card sorting methodologies are different ways of generating data for similarity matrices used in various analyses such as multidimensional scaling and cluster analysis. Pairwise similarity judgments are considered the gold standard methodology, but can be cumbersome for large numbers of stimuli given the geometric increase in number of judgments necessary to fill the matrix. Card sorting methods provide a more expedient means of gathering this information, although they typically generate only binary data. Nonetheless, aggregated matrices generated from card sorts approximate pairwise similarity matrices. The current study used pairwise similarity and card sorting results from two existing studies that used the same stimuli to determine the optimal number of participants needed in a card sorting task to approximate the similarity matrix of pairwise data collection. In these studies, approximately 10–15 participants provided optimal estimation of the similarity matrix, with minimal increases for higher numbers of participants.

Suggested Citation

  • Ethan Lantz & Jared W. Keeley & Michael C. Roberts & Maria Elena Medina-Mora & Pratap Sharan & Geoffrey M. Reed, 2019. "Card Sorting Data Collection Methodology: How Many Participants Is Most Efficient?," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 649-658, October.
  • Handle: RePEc:spr:jclass:v:36:y:2019:i:3:d:10.1007_s00357-018-9292-8
    DOI: 10.1007/s00357-018-9292-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-018-9292-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00357-018-9292-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:36:y:2019:i:3:d:10.1007_s00357-018-9292-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.