A Sustainable Approach to Asthma Diagnosis: Classification with Data Augmentation, Feature Selection, and Boosting Algorithm.

Asthma is a diverse disease that affects over 300 million individuals globally. The prevalence of asthma has increased by 50% every decade since the 1960s, making it a serious global health issue. In addition to its associated high mortality, asthma generates large economic losses due to the degradation of patients' quality of life and the impairment of their physical fitness. Asthma research has evolved in recent years to fully analyze why certain diseases develop based on a variety of data and observations of patients' performance. The advent of new techniques offers good opportunities and application prospects for the development of asthma diagnosis methods. Over the last few decades, techniques like data mining and machine learning have been utilized to diagnose asthma. Nevertheless, these traditional methods are unable to address all of the difficulties associated with improving a small dataset to increase its quantity, quality, and feature space complexity at the same time. In this study, we propose a sustainable approach to asthma diagnosis using advanced machine learning techniques. To be more specific, we use feature selection to find the most important features, data augmentation to improve the dataset's resilience, and the extreme gradient boosting algorithm for classification. Data augmentation in the proposed method involves generating synthetic samples to increase the size of the training dataset, which is then utilized to enhance the training data initially. This could lessen the phenomenon of imbalanced data related to asthma. Then, to improve diagnosis accuracy and prioritize significant features, the extreme gradient boosting technique is used. The outcomes indicate that the proposed approach performs better in terms of diagnostic accuracy than current techniques. Furthermore, five essential features are extracted to help physicians diagnose asthma.

Study on the university students' satisfaction of the wisdom tree massive open online course platform based on parameter optimization intelligent algorithm.

INTRODUCTION: Curriculum learning through the wisdom tree massive open online course platform not only gets rid of the limitations of specialty, school and region, eliminates the limitations of time and space in traditional teaching, but also effectively solves the problem of educational equity. OBJECTIVES: This paper proposes an intelligent algorithm combining decision tree, support vector machine, and simulated annealing to obtain the best classification accuracy and decision rules for university students' satisfaction with the wisdom tree massive open online course platform. METHODS: This study takes the university students in Fuzhou city information management department as the survey object, and adopts the electronic questionnaire survey method. A total of 1136 formal questionnaires were responded, and 1028 valid questionnaires were obtained after data cleaning and deleting invalid questionnaires (the effective rate was 90.49%). In this paper, the reliability and validity of the questionnaire were tested by IBM SPSS-20.0 software, and six explanatory variables including function, achievement, exercise, quality, richness, and interaction were obtained by principal component analysis. Then, the questionnaire data is converted to CSV (comma separated values) format for analysis. This paper proposes an intelligent algorithm combining decision tree, support vector machine, and simulated annealing to obtain the best classification accuracy and decision rules for university students' satisfaction with the wisdom tree massive open online course platform. In this paper, the proposed algorithm is compared with decision tree, random forest, k-nearest neighbor, and support vector machine to verify its performance. RESULTS: The experimental results show that training set classification accuracy of decision tree, random forest, k-nearest neighbor, only support vector machine and the proposed algorithm (simulated annealing + support vector machine) are 92.21%, 96.10%, 95.67%, 97.29%, and 99.58%, respectively. CONCLUSION: The proposed algorithm simulated annealing + support vector machine does increase the classification accuracy. At the same time, the 11 decision rules generated by simulated annealing + decision tree can provide useful information for decision makers.

An integrated algorithm for gene selection and classification applied to microarray data of ovarian cancer.

OBJECTIVE: The type of data in microarray provides unprecedented amount of data. A typical microarray data of ovarian cancer consists of the expressions of tens of thousands of genes on a genomic scale, and there is no systematic procedure to analyze this information instantaneously. To avoid higher computational complexity, it needs to select the most likely differentially expressed gene markers to explain the effects of ovarian cancer. Traditionally, gene markers are selected by ranking genes according to statistics or machine learning algorithms. In this paper, an integrated algorithm is derived for gene selection and classification in microarray data of ovarian cancer. METHODS: First, regression analysis is applied to find target genes. Genetic algorithm (GA), particle swarm optimization (PSO), support vector machine (SVM), and analysis of variance (ANOVA) are hybridized to select gene markers from target genes. Finally, the improved fuzzy model is applied to classify cancer tissues. RESULTS: The microarray data of ovarian cancer, obtained from China Medical University Hospital, is used to test the performance of the proposed algorithm. In simulation, 200 target genes are obtained after regression analysis and six gene markers are selected from the hybrid process of GA, PCO, SVM and ANOVA. Additionally, these gene markers are used to classify cancer tissues. CONCLUSIONS: The proposed algorithm can be used to analyze gene expressions and has superior performance in microarray data of ovarian cancer, and it can be performed on other studies for cancer diagnosis.

Robust and fast learning for fuzzy cerebellar model articulation controllers.

In this paper, the online learning capability and the robust property for the learning algorithms of cerebellar model articulation controllers (CMAC) are discussed. Both the traditional CMAC and fuzzy CMAC are considered. In the study, we find a way of embeding the idea of M-estimators into the CMAC learning algorithms to provide the robust property against outliers existing in training data. An annealing schedule is also adopted for the learning constant to fulfill robust learning. In the study, we also extend our previous work of adopting the credit assignment idea into CMAC learning to provide fast learning for fuzzy CMAC. From demonstrated examples, it is clearly evident that the proposed algorithm indeed has faster and more robust learning. In our study, we then employ the proposed CMAC for an online learning control scheme used in the literature. In the implementation, we also propose to use a tuning parameter instead of a fixed constant to achieve both online learning and fine-tuning effects. The simulation results indeed show the effectiveness of the proposed approaches.

Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics.

A general weapon-target assignment (WTA) problem is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Genetic algorithms (GAs) are widely used for solving complicated optimization problems, such as WTA problems. In this paper, a novel GA with greedy eugenics is proposed. Eugenics is a process of improving the quality of offspring. The proposed algorithm is to enhance the performance of GAs by introducing a greedy reformation scheme so as to have locally optimal offspring. This algorithm is successfully applied to general WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.