Introduction To investigate the risk factors for myopia progression in primary school children and build prediction models by applying machine learning to longitudinal, cycloplegic autorefraction data. Methods A total of 2740 children from grade 1 to grade 6 were examined annually over a period of 5 years. Myopia progression was determined as change in cycloplegic autorefraction. Questionnaires were administered to gauge environmental factors. Each year, risk factors were evaluated and prediction models were built in a training group and then tested in an independent hold-out group using the random forest algorithm. Results Six variables appeared in prediction models on myopia progression for all 5 years, with combined weight of 77% and prediction accuracy over 80%. Uncorrected distance visual acuity (UDVA) had the greatest weight (mean 28%, range 22–39%), followed by spherical equivalent (20%, 7–28%), axial length (13%, 10–14%), flat keratometry reading (K1) (7%, 4–11%), gender (6%, 2–9%), and parental myopia (3%, 1–10%). UDVA and spherical equivalent had peak weight at the second and third study years, respectively. The weight of myopic parents decreased steadily over the 5 years (9.5%, 1.9%, 1.8%, 1%, and 1.3%). Weekly time spent reading, reading distance, reading in bed, and frequency of eating meat were included as variables in different study years. Conclusions Myopia progression in children was predicted well by machine learning models. UDVA and spherical equivalents were good predictive factors for myopia progression in children through primary school. Parental myopia was found to play a substantial role in the early stage of myopia progression but waned as children grew older.
2 January 2017 in Journal of the American Statistical Association
For data with high-dimensional covariates but small sample sizes, the analysis of single datasets often generates unsatisfactory results. The integrative analysis of multiple independent datasets provides an effective way of pooling information and outperforms single-dataset and several alternative multi-datasets methods. Under many scenarios, multiple datasets are expected to share common important covariates, that is, the corresponding models have similarity in their sparsity structures. However, the existing methods do not have a mechanism to promote the similarity in sparsity structures in integrative analysis. In this study, we consider penalized variable selection and estimation in integrative analysis. We develop an L0-penalty-based method, which explicitly promotes the similarity in sparsity structures. Computationally it is realized using a coordinate descent algorithm. Theoretically it has the selection and estimation consistency properties. Under a wide spectrum of simulation scenarios, it has identification and estimation performance comparable to or better than the alternatives. In the analysis of three lung cancer datasets with gene expression measurements, it identifies genes with sound biological implications and satisfactory prediction performance. Supplementary materials for this article are available online.
Analysis of data with a censored survival response and high-dimensional omics measurements is now common. Most of the existing analyses are based on specific (semi)parametric models, in particular the Cox model. Such analyses may be limited by not having sufficient flexibility, for example, in accommodating nonlinearity. For categorical and continuous responses, neural networks (NNs) have provided a highly competitive alternative. Comparatively, NNs for censored survival data remain limited. Omics measurements are usually high-dimensional, and only a small subset is expected to be survival-associated. As such, regularized estimation and selection are needed. In the existing NN studies, this is usually achieved via penalization. In this article, we propose adopting the threshold gradient descent regularization (TGDR) technique, which has competitive performance (for example, when compared to penalization) and unique advantages in regression analysis, but has not been adopted with NNs. The TGDR-based NN has a highly sensible formulation and an architecture different from the unregularized and penalization-based ones. Simulations show its satisfactory performance. Its practical effectiveness is further established via the analysis of two cancer omics datasets. Overall, this study can provide a practical and useful new way in the NN paradigm for survival analysis with high-dimensional omics measurements.