English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/161692
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


(I Can’t Get No) Saturation: A simulation and guidelines for sample sizes in qualitative research

AuthorsRijnsoever, Frank J. van
Issue Date2017
PublisherPublic Library of Science
CitationPLoS ONE 12(7): e0181689 (2017)
AbstractI explore the sample size in qualitative research that is required to reach theoretical saturation. I conceptualize a population as consisting of sub-populations that contain different types of information sources that hold a number of codes. Theoretical saturation is reached after all the codes in the population have been observed once in the sample. I delineate three different scenarios to sample information sources: “random chance,” which is based on probability sampling, “minimal information,” which yields at least one new code per sampling step, and “maximum information,” which yields the largest number of new codes per sampling step. Next, I use simulations to assess the minimum sample size for each scenario for systematically varying hypothetical populations. I show that theoretical saturation is more dependent on the mean probability of observing codes than on the number of codes in a population. Moreover, the minimal and maximal information scenarios are significantly more efficient than random chance, but yield fewer repetitions per code to validate the findings. I formulate guidelines for purposive sampling and recommend that researchers follow a minimum information scenario.
Publisher version (URL)https://doi.org/10.1371/journal.pone.0181689
Identifiersdoi: 10.1371/journal.pone.0181689
e-issn: 1932-6203
Appears in Collections:(INGENIO) Artículos
Files in This Item:
File Description SizeFormat 
icanotget.pdf4,12 MBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.