Aim
The purpose of this study was to develop a machine learning prediction model for successful aging (SA) based on physical fitness tests.
Methods
A total of 3657 community‐dwelling adults aged ≥60 years from Nanchang city were recruited in this study. A 3‐year follow‐up test was carried out for all the participants to determine whether they turn to non‐SA. Developed questionnaires and physical fitness tests were used to obtain overall health condition, balance, agility, speed, reactions and gait. Four machine learning models (logistic regression, deep learning, random forest and gradient boosting decision tree) were applied to develop the prediction models, the analyzed sample was 890.
Results
The baseline prevalence of successful aging was 26.99%, The average annual incidence rate of SA to non‐SA was 11.04%. There were significant differences between the SA and non‐SA groups for all physical fitness tests at baseline. The accuracy and area under the curve of all four machine learning models was >85%, the positive predictive value and sensitivity was >75%, and the specificity was >86% on the average. The deep learning model outperformed the other model, with area under the curve 90.00%, accuracy 89.3%, positive predictive value 85.8% and specificity 93.1%, respectively. Compared with other models, the logistic regression model performed best in sensitivity. Age, arm curl, 30‐s sit‐to‐stand and reaction time were important predictors in all models.
Conclusion
The deep learning model is ideal in the prediction of SA maintenance, and the corresponding physical fitness interventions are essential to ensuring SA. Geriatr Gerontol Int 2020; ••: ••–••.
The EL family of description logics (DLs) has been successfully applied for representing the knowledge of several domains, specially from the bio-medical fields. One of its principal characteristics is that its reasoning tasks have polynomial complexity, which makes them suitable for large-scale knowledge bases. In their classical form, description logics cannot handle imprecise concepts in a satisfactory manner. Rough sets have been studied as a method for describing imprecise notions, by providing a lower and an upper approximation, which are defined through classes of indiscernible elements. In this paper we study the combination of the EL family of DLs with the notion of rough sets, thus obtaining a family of rough DLs. We show that the rough extension of these DLs maintains the polynomial-time complexity enjoyed by its classical counterpart. We also present a completionbased algorithm that is a strict generalization of the known method for the DL EL ++ .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.