Abstract

The goal of sample-size planning (SSP) is to determine the number of measurements needed for statistical analysis. This SSP is necessary to achieve robust and significant results with a minimal number of measurements that need to be collected. SSP is a common procedure for univariate measurements, whereas for multivariate measurements, like spectra or time traces, no general sample-size-planning method exists. Sample-size planning becomes more important for biospectroscopic data because the data generation is time-consuming and costly. Additionally, ethical reasons do not allow the use of unnecessary samples and the measurement of unnecessary spectra. In this paper, a general sample-size-planning algorithm is presented that is based on learning curves. The learning curve quantifies the improvement of a classifier for an increasing training-set size. These curves are fitted by the inverse-power law, and the parameters of this fit can be utilized to predict the necessary training-set size. Sample-size planning is demonstrated for a biospectroscopic task of differentiating six different bacterial species, including Escherichia coli, Klebsiella terrigena, Pseudomonas stutzeri, Listeria innocua, Staphylococcus warneri, and Staphylococcus cohnii, on the basis of their Raman spectra. Thereby, we estimate the required number of Raman spectra and biological replicates to train a classification model, which consists of principal-component analysis (PCA) combined with linear-discriminant analysis (LDA). The presented algorithm revealed that 142 Raman spectra per species and seven biological replicates are needed for the above-mentioned biospectroscopic-classification task. Even though it was not demonstrated, the learning-curve-based sample-size-planning algorithm can be applied to any multivariate data and in particular to biospectroscopic-classification tasks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.