Classification Algorithm of Ship Trajectory Based on Machine Learning Techniques

Network intrusion detection systems are an important defense technology to guarantee information security and protect a network from attacks. In recent years, the broad learning system has attracted much attention and has been introduced into intrusion detection systems with some success. However, since the traditional broad learning system is a simple linear structure, when dealing with imbalanced datasets, it often ignores the feature learning of minority class samples, leading to a poorer recognition rate of minority class samples. Secondly, the high dimensionality and redundant features in intrusion detection datasets also seriously affect the training time and detection performance of the traditional broad learning system. To address the above problems, we propose a deep belief network broad equalization learning system. The model fully learns the large-scale high-dimensional dataset via a deep belief network and represents it as an optimal low-dimensional dataset, and then introduces the equalization loss v2 reweighing idea into the broad learning system and learns to classify the low-dimensional dataset via a broad equalization learning system. The model was experimentally tested using the CICIDS2017 dataset and fully validated using the CICIDS2018 dataset. Compared with other algorithms in the same field, the model shortens the training time and has a high detection rate and a low false alarm rate.

Based on the broad learning system(BLS), this paper carries out the detection of ships in navigation. Firstly, grayscale, and histogram equalization are used to preprocess the image to enhance the detail of the image and improve the training accuracy. Secondly, randomly select a part of the photo set as the test set. Finally, BLS is introduced to train and test the data set. Two training methods, back propagation neural network(BPNN) and support vector machine (SVM), are used to compare the proposed method with the navigation ship data set. From the experimental results, it can be seen that the BLS in this paper has a better detection effect in ship detection. By applying the comparison on the face detection data set, the universality of BLS for image recognition is proved.

This paper describes an experiment on Parkinsons disease classification using multiple classification algorithms for comparison. Parkinsons disease is a common neurological disorder, and early diagnosis and classification are important for the assessment of treatment and prognosis. Therefore, the research implications of this paper are clear. The classification algorithms used in the experiment include adaboost classification model, XGBoost classification model, logistic regression regression model, random forest plain Bayesian classification model, bp neural network and support vector machine. The experimental results show that adaboost classification model performs well when dealing with small sample data, XGBoost classification model performs well when dealing with large-scale datasets, and logistic regression regression model and random forest plain Bayesian classification model also have good performance. The bp neural network and support vector machine, on the other hand, perform poorly in terms of classification results and require a much larger dataset for support. These experimental results have important reference value for the classification and diagnosis of Parkinsons disease. Different classification algorithms are suitable for different dataset sizes and characteristics, so in practical applications, we can choose different classification algorithms according to the size and characteristics of the dataset to achieve the optimal classification effect. In conclusion, the results of this paper provide a reference for the classification and diagnosis of Parkinsons disease, as well as a guide for choosing appropriate classification algorithms. In the future, we can further expand the dataset size and use more classification algorithms for comparison to improve the accuracy and robustness of Parkinsons disease classification.

In recent years, electroencephalogram (EEG) e-motion recognition has been becoming an emerging field in artificial intelligence area, which can reflect the relation between emotional states and brain activity. In this paper, we designed a novel architecture, i.e., broad dynamical graph learning system (BDGLS), to deal with EEG signals. By integrating the advantage of dynamical graph convolution neural networks (DGCNN) and broad learning system (BLS), BDGLS has the ability of extracting features on non-Euclidean domain and randomly generating nodes to find the desired connection weights simultaneously. We evaluated our system on SJTU emotion EEG dataset (SEED), and used differential entropy (DE) features as input data. In the experiments, BDGLS achieved the best result, compared with the state-of-the-art methods, e.g., support vector machine (SVM), deep belief networks (DBN), graph convolutional neural networks (DCNN) and DGCNN. Especially the performance on all-frequency band of DE features, BDGLS reached the highest average recognition accuracy of 93.66% with the standard deviation of 6.11%. The result demonstrated the excellent classification ability of BDGLS in EEG emotion recognition.

In this paper, traditional DeepWalk method and broad learning system (BLS) are used to classify network nodes in graph embedding, and results of classification are compared. When categorizing, DeepWalk adopts one vs rest (OvR) logistic regression method, and BLS is applied after the production of vector representations. In order to obviously compare results of the two classification methods, Support Vector Machine (SVM) and Convolutional Neural Network (CNN) are employed to carry out the experiment on multi-label classification of BlogCatalog. The experimental result shows that F1 score of BLS is obviously higher than DeepWalk and other methods, and training time of BLS is much less than other methods. These performances make our method suitable to graph embedding.

Accurate Electric Vehicle (EV) charging load time-series prediction is an important prerequisite for enhancing the safe and stable operation of charging stations. However, the EV charging load is strongly nonlinear, highly intermittent and random, which leads to the low accuracy of charging load time-series prediction. To this end, this paper proposes a broad learning system-based EV charging load time-series prediction method. First, the actual data of charging load of EV are analyzed and processed. Further, a charging load time-series prediction model is established using a broad learning system. Simulation experiments based on actual data indicate that the proposed charging load time-series prediction model based on the broad learning system has better prediction performance and also has less computing time compared to prediction models such as back propagation neural network and long-short term memory.

Stream label distribution learning processing via broad learning system

Medical image classification is an essential task in the fields of computer-aided diagnosis and medical image analysis. In recent years, researchers have made extensive work on medical image classification by computer vision techniques. However, most of the current work is based on deep learning methods, which still suffer from expensive hardware resources, long time consuming and a lot of parameters to be optimized. In this paper, a multi-granularity ensemble algorithm for medical image classification based on broad learning system is proposed, which is an end-to-end lightweight model. On the one hand, the proposed method is designed to address the problem of weak image feature learning ability of broad learning system. The convolution module with fixed weights based on transfer learning is introduced as a feature extractor to extract fusion features of medical images. On the other hand, the multi-granularity ensemble framework is proposed, which learn the fusion features of medical images from fine-grained to coarse-grained respectively, and the prediction results at different granularity levels are integrated by ensemble learning. In this way, the bottom local features can be sufficiently considered, while the global features can also be taken into account. The experimental results show that on the MedMNIST dataset (containing 10 sub-datasets), the proposed method can shorten the training time by tens of times while having similar accuracy to deep convolutional neural networks. On the ChestXRay2017 dataset, the proposed method can achieve an accuracy of 92.5%, and the training time is also significantly better than other methods.

The study introduces a novel approach to short-term wind speed forecasting, which amalgamates statistical and machine learning techniques through the utilization of a hybrid model consisting of the broad learning system (BLS) and the relevance vector machine (RVM), to account for the nonstationary characteristics of wind speed data. Firstly, the initial wind speed time series is preprocessed using singular spectrum analysis to achieve noise reduction. Subsequently, the denoised wind speed time series is predicted using generalized learning system (BLS), and the prediction error is obtained. Finally, the prediction error of BLS is further predicted using RVM, and the final prediction result is obtained by combining it with the prediction results of BLS. By integrating multiple algorithms, this novel wind speed forecasting hybrid model improves prediction accuracy and can adapt to different wind speed characteristics and complex wind speed fluctuations. Through a case study, we find that this model outperforms other comparative models in terms of prediction, fully demonstrating its superiority.

Stock market forecasting has attracted a lot of research interests in previous literature, and recent studies have shown that artificial neural networks (ANN) method achieved better performance than traditional statistical ones. ANN approaches have, however, suffered from difficulties with generalization, producing models that can overfit the data. This paper employs a relatively new machine learning technique, support vector machines (SVM), to the stock market forecasting problem in an attempt to provide a model with better explanatory power. To evaluate the prediction accuracy of SVM, we compare its performance with three-layer fully connected backpropagation neural networks (BNN). The experiment results show that SVM outperforms the BNN.

Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.

Sentiment analysis is a popular theme in the natural language processing (NLP) domain. People at present share their stay experience in restaurants, shopping malls, hotels and their travel experience in taxis, buses, trains and airplanes. Online social media provide a platform for the people to share their experiences of stay and travel in the form of text, images and videos. Twitter is one of the popular and well known social media platforms across the world. In this study, we are using tweets data in respect to comfort services in Indian long route superfast trains. This tweet data is used to analyze the hidden sentiments using machine learning techniques such as support vector machines (SVM), Random forest (RF) and back propagation neural networks (BPNN). The results show that BPNN provides high accuracy with more training on the data. The results achieved from SVM and RF was also satisfactory but BPANN won the race with more training on the data.

Credit rating analysis with support vector machines and neural networks: a market comparative study

Smart cities are centres of economic opulence and hope for standardized living. Understanding the shades of urban resilience and livability in smart city models is of paramount importance. This study presents a novel two-stage data-driven framework combining a multivariate metric-distance analysis with machine learning (ML) techniques for resilience and livability assessment of smart cities. A longitudinal dataset for 35 top-ranked European smart cities from 2015 till 2020 applied as the case study under the proposed framework. Initially, a metric distance-based weighting approach is used to weight the indicators and quantify the scores across each aspect under city resilience and urban livability. The key aspects under city resilience include social, economic, infrastructure and built environment and, institutional resilience, while under urban livability, the aspects include accessibility, community well-being, and economic vibrancy. Fuzzy c-means clustering as an unsupervised machine learning technique is used to sort smart cities based on the degree of performance. In addition, an intelligent approach is presented for the prediction of the degree of livability, resilience, and aggregate performance of smart cities based on various supervised ML techniques. Classification models such as Naïve Bayes, k-nearest neighbors (kNN), support vector machine (SVM), Classification and Regression Tree (CART) and, ensemble models including Random Forest (RF) and Gradient Boosting machine (GBM) were used. Three coefficients (accuracy, Cohen's Kappa (κ) and average area under the precision-recall curve (AUC-PR)) along with confusion matrix were used to appraise the performance of the classifier ML models. The results revealed GBM as the best classification and predictive model for the resilience, livability, and aggregate performance assessment. The study also revealed Copenhagen, Geneva, Stockholm, Munich, Helsinki, Vienna, London, Oslo, Zurich, and Amsterdam as the smart cities that co-create resilience and livability in their development model with superior performance.

With the development of big data technology, machine learning classification methods have been widely used in the classification and recognition of remote sensing images. For remote sensing big data, how to quickly and efficiently use machine learning classification algorithms to classify remote sensing images is an urgent problem. It is a general term for the theory, method, technology, and activities of obtaining valuable information based on massive remote sensing data sets, synthesizing auxiliary data from other sources, and using big data thinking and means. The purpose of this paper is to study the support vector machine (SVM) parallelized remote sensing image classification algorithm based on big data. We propose a parallel nesting of GPU in MPI multiprocesses based on the big data framework, which can more effectively improve the calculation processing speed and build a high-performance SVM parallel computing framework based on the big data framework. The optimization problem of SVM considers both empirical risk and structural risk minimization and requires maximum edge distance when constructing hyperplane decision boundaries, so there is ample space between the interval boundaries to accommodate the test samples. Based on this framework, we improve the machine learning SVM algorithm and realize the high-performance parallel computing of SVM classification algorithm on this platform. It is an efficient hybrid parallel mode to nest GPU in MPI multiprocess in parallel. When the number of nodes is 2, 4, and 6, the speedup of the SVM classification algorithm is 1.52, 2.24, and 2.55.