An Intelligent Evaluation Method of Information Course Teaching Effect Based on Image Analysis

Due to its own limitations, the traditional teaching quality evaluation method has been unable to adapt to the development of information-based curriculum teaching. Therefore, the establishment of a scientific and intelligent teaching effect evaluation method will help to improve the teaching quality of college teachers. To solve the above problems, a student fatigue state evaluation method based on the quantum particle swarm optimization artificial neural network is proposed. Firstly, face detection is realized by adding three Haar-like feature blocks and improving the AdaBoost algorithm of a weak classifier connection. Secondly, in order to effectively improve the image imbalance, the MSR algorithm is used to enhance the face data image, which is effectively suitable for network training. Then, by readjusting the connection mode, the DenseNet is improved to fully reflect the local detail feature information of the low level. Finally, quantum particle swarm optimization (QPSO) is used to optimize the DenseNet structure, which makes the optimization of network structure more automatic and solves the uncertainty of manual selection. The experimental results show that the proposed method has a good detection effect and prove the effectiveness and correctness of the proposed method.

A Comprehensive Performance Analysis of Various Classifier Models for Coronary Artery Disease Prediction

Cardio Vascular Diseases (CVD) is the major reason for the death of the majority of the people in the world. Earlier diagnosis of disease will reduce the mortality rate. Machine learning (ML) algorithms are giving promising results in the disease diagnosis and it is now widely accepted by medical experts as their clinical decision support system. In this work, the most popular ML models are investigated and compared with one other for heart disease prediction based on various metrics. The base classifiers such as Support Vector Machine (SVM), Logistic regression, Naïve Bayes, Decision Tree, K Nearest Neighbour are used for predicting heart disease. In this paper, bagging and boosting techniques are applied over these individual classifiers to improve the performance of the system. With the Cleveland and Statlog datasets, Naive Bayes as the individual classifier gives the maximum accuracy of 85.13%and 84.81% respectively. Bagging technique improves the accuracy of the decision tree which is identified as a weak classifier by 7% and it is a significant improvement in identifying CVD.

A Comprehensive Performance Analysis of Various Classifier Models for Coronary Artery Disease Prediction

Cardio Vascular Diseases (CVD) is the major reason for the death of the majority of the people in the world. Earlier diagnosis of disease will reduce the mortality rate. Machine learning (ML) algorithms are giving promising results in the disease diagnosis and it is now widely accepted by medical experts as their clinical decision support system. In this work, the most popular ML models are investigated and compared with one other for heart disease prediction based on various metrics. The base classifiers such as Support Vector Machine (SVM), Logistic regression, Naïve Bayes, Decision Tree, K Nearest Neighbour are used for predicting heart disease. In this paper, bagging and boosting techniques are applied over these individual classifiers to improve the performance of the system. With the Cleveland and Statlog datasets, Naive Bayes as the individual classifier gives the maximum accuracy of 85.13%and 84.81% respectively. Bagging technique improves the accuracy of the decision tree which is identified as a weak classifier by 7% and it is a significant improvement in identifying CVD.

Evolutionary multiple instance boosting framework for weakly supervised learning

Multiple instance boosting (MILBoost) is a framework which uses multiple instance learning (MIL) with boosting technique to solve the problems regarding weakly labeled inexact data. This paper proposes an enhanced multiple boosting framework—evolutionary MILBoost (EMILBoost) which utilizes differential evolution (DE) to optimize the combination of weak classifier or weak estimator weights in the framework. A standard MIL dataset MUSK and a binary classification dataset Hastie_10_2 are used to evaluate the results. Results are presented in terms of bag and instance classification error and also confusion matrix of test data.

Tag N’ Train: a technique to train improved classifiers on unlabeled data

There has been substantial progress in applying machine learning techniques to classification problems in collider and jet physics. But as these techniques grow in sophistication, they are becoming more sensitive to subtle features of jets that may not be well modeled in simulation. Therefore, relying on simulations for training will lead to sub-optimal performance in data, but the lack of true class labels makes it difficult to train on real data. To address this challenge we introduce a new approach, called Tag N’ Train (TNT), that can be applied to unlabeled data that has two distinct sub-objects. The technique uses a weak classifier for one of the objects to tag signal-rich and background-rich samples. These samples are then used to train a stronger classifier for the other object. We demonstrate the power of this method by applying it to a dijet resonance search. By starting with autoencoders trained directly on data as the weak classifiers, we use TNT to train substantially improved classifiers. We show that Tag N’ Train can be a powerful tool in model-agnostic searches and discuss other potential applications.

The Research of Fault Diagnosis of Nuclear Power Plant Based on ELM-AdaBoost.SAMME

A fault diagnosis framework based on extreme learning machine (ELM) and AdaBoost.SAMME is proposed in a nuclear power plant (NPP) in this paper. After briefly describing the principles of ELM and AdaBoost.SAMME algorithm, the fault diagnosis framework sets ELM algorithm as the weak classifier and then integrates several weak classifiers into a strong one using the AdaBoost.SAMME algorithm. Furthermore, some experiments are put forward for the setting of two algorithms. The results of simulation experiments on the HPR1000 simulator show that the combined method has higher precision and faster speed by improving the performance of weak classifiers compared to the BP neural network and verify the feasibility and validity of the ensemble learning method for fault diagnosis. Meanwhile, the results also indicate that the proposed method can meet the requirements of a real-time diagnosis of the nuclear power plant.

Modeling and analyzing a public opinion influence method with K-adaboost

In order to solve the low efficiency of public opinion influence analysis of social media, a new public opinion influence algorithm K-adaboost has been proposed in this paper according to adaboost and K-means algorithms. We first group the training samples and calculate the clustering center of all types of users in the group using the K-means algorithm, and then train the weak classifier of public opinion data and confirm the influence of public opinion on all types of users using the adaboost algorithm, so as to get the total influence of public opinions. Finally, we compare and analyze the performance of K-adaboost, K-means and adaboost algorithms through simulation experiments. The results show that K-adaboost has good adaptability in convergence time and accuracy.

Improving Human Motion Classification by Applying Bagging and Symmetry to PCA-Based Features

This paper proposes a method for improving human motion classification by applying bagging and symmetry to Principal Component Analysis (PCA)-based features. In contrast to well-known bagging algorithms such as random forest, the proposed method recalculates the motion features for each “weak classifier” (it does not randomly sample a feature set). The proposed classification method was evaluated on a challenging (even to a human observer) motion capture recording dataset of martial arts techniques performed by professional karate sportspeople. The dataset consisted of 360 recordings in 12 motion classes. Because some classes of these motions might be symmetrical (which means that they are performed with a dominant left or right hand/leg), an analysis was conducted to determine whether accounting for symmetry could improve the recognition rate of a classifier. The experimental results show that applying the proposed classifiers’ bagging procedure increased the recognition rate (RR) of the Nearest-Neighbor (NNg) and Support Vector Machine (SVM) classifiers by more than 5% and 3%, respectively. The RR of one trained classifier (SVM) was higher when we did not use symmetry. On the other hand, the application of symmetry information for bagged NNg improved its recognition rate compared with the results without symmetry information. We can conclude that symmetry information might be helpful in situations in which it is not possible to optimize the decision borders of the classifier (for example, when we do not have direct information about class labels). The experiment presented in this paper shows that, in this case, bagging and mirroring might help find a similar object in the training set that shares the same class label. Both the dataset that was used for the evaluation and the implementation of the proposed method can be downloaded, so the experiment is easily reproducible.