Search

This paper proposes a new algorithm composition network from the perspective of machine learning, based on an in-depth study of related literature. At the same time, this paper examines the characteristics of music and develops a model for recognising musical emotions. Using the model's information entropy of pitch and intensity to extract the main melody track, note features are extracted from bar features. Finally, the cosine of the vector included angle is used to judge the similarity between feature vectors of several adjacent sections, allowing the music to be divided into several independent segments. The emotional model of music is used to analyze each segment's emotion. By quantifying music features, this paper classifies and quantifies music emotion based on the mapping relationship between music features and emotion. Music emotion can be accurately identified by the model. The model's emotion recognition accuracy is up to 93.78 percent, and the algorithm's recall rate is up to 96.3 percent, according to simulation results. The recognition method used in this paper has a higher recognition ability than other methods, and the emotion recognition result is more reliable. This paper can not only meet the composer's auxiliary creative needs, but it can also help intelligent music services. [ABSTRACT FROM AUTHOR]

Based on a machine learning algorithm, this paper deeply explores the privacy protection of personal information. In this paper, the definition of the machine learning algorithm is put forward, the design idea of privacy protection in joint machine learning platform is studied, and the architecture model and model parameter updating strategy of joint machine learning under privacy protection are designed. To protect the privacy of personal information, this paper also proposes a data homomorphic verification mechanism to prevent the global parameters from being tampered with by malicious cloud servers. In order to verify the performance of the models constructed in this paper, the comparative experiments of different models are carried out. The experimental results show that this algorithm has a fast convergence speed, and the average error rate decreases by 4.17% compared with the traditional algorithm. Moreover, the accuracy of this algorithm reaches 95.37%, which is about 8.76% higher than the previous algorithm. This model is applied to the field of personal information privacy protection, which can provide a safe and reliable environment for personal information privacy and effectively protect the privacy of data owners. And, means and reference value is provided for the development direction of privacy protection. [ABSTRACT FROM AUTHOR]

With the development of teaching evaluation program, colleges and universities have reformed according to the actual situation of the school. With the development of evaluation activities, many universities are eager to establish their own teaching quality evaluation system, so as to pre-evaluate the teaching quality of schools. SVM is one of the most widely used machine learning algorithms that enables efficient statistical learning with a very limited number of samples. Considering the excellent learning performance of SVM, it is very suitable for the teaching quality evaluation system. In this paper, we optimize the existing multiple classification algorithm for binary trees and propose a new method. Learning the popular teaching quality evaluation system in colleges and universities, the binary tree support vector machine classification algorithm, and design comparison experiment, the experimental results show that the evaluation model proposed in this paper has strong generalization ability and higher classification accuracy and better classification efficiency. [ABSTRACT FROM AUTHOR]

In order to improve the scientificity of sports action analysis, this paper constructs a sports action analysis model based on machine learning based on the greedy algorithm and the bat algorithm. According to the structural characteristics of the model, the structure of the model is reflected in the form of face order, that is, the face neighborhood structure. Moreover, this paper judges the degree of similarity between model faces through the pros and cons of the order and applies it to the structural similarity matrix between models. In addition, this paper establishes corresponding mathematical models for the shape and structure of the model and constructs the shape similarity matrix, the surface neighborhood structure similarity matrix, and the structure similarity matrix between the source model and the target model. Finally, this paper designs and implements CAD model retrieval methods based on greedy algorithm and bat algorithm and designs experiments to compare the performance of the algorithm proposed in this paper with traditional algorithms. The result of the experiment shows that the algorithm proposed in this paper has obvious advantages in sports action analysis compared with the traditional algorithm. [ABSTRACT FROM AUTHOR]

Gesture recognition utilizes deep learning network model to automatically extract deep features of data; however, traditional machine learning algorithms rely on manual feature extraction and poor model generalization ability. In this paper, a multimodal gesture recognition algorithm based on convolutional long-term memory network is proposed. First, a convolutional neural network (CNN) is employed to automatically extract the deeply hidden features of multimodal gesture data. Then, a time series model is constructed using a long short-term memory (LSTM) network to learn the long-term dependence of multimodal gesture features on the time series. On this basis, the classification of multimodal gestures is realized by the SoftMax classifier. Finally, the method is experimented and evaluated on two dynamic gesture datasets, VIVA and NVGesture. Experimental results indicate that the accuracy rates of the proposed method on the VIVA and NVGesture datasets are 92.55% and 87.38%, respectively, and its recognition accuracy and convergence performance are better than those of other comparison algorithms. [ABSTRACT FROM AUTHOR]

The existing face detection methods were affected by the network model structure used. Most of the face recognition methods had low recognition rate of face key point features due to many parameters and large amount of calculation. In order to improve the recognition accuracy and detection speed of face key points, a real-time face key point detection algorithm based on attention mechanism was proposed in this paper. Due to the multiscale characteristics of face key point features, the deep convolution network model was adopted, the attention module was added to the VGG network structure, the feature enhancement module and feature fusion module were combined to improve the shallow feature representation ability of VGG, and the cascade attention mechanism was used to improve the deep feature representation ability. Experiments showed that the proposed algorithm not only can effectively realize face key point recognition but also has better recognition accuracy and detection speed than other similar methods. This method can provide some theoretical basis and technical support for face detection in complex environment. [ABSTRACT FROM AUTHOR]

With the rapid development of DNA high-throughput testing technology, there is a high correlation between DNA sequence variation and human diseases, and detecting whether there is variation in DNA sequence has become a hot research topic at present. DNA sequence variation is relatively rare, and the establishment of DNA sequence sparse matrix, which can quickly detect and reason fusion variation point, has become an important work of tumor gene testing. Because there are differences between the current comparison software and mutation detection software in detecting the same sample, there are errors between the results of derivative sequence comparison and the detection of mutation. In this paper, SNP and InDel detection methods based on machine learning and sparse matrix detection are proposed, and VarScan 2, Genome Analysis Toolkit (GATK), BCFtools, and FreeBayes are compared. In the research of SNP and InDel detection with intelligent reasoning, the experimental results show that the detection accuracy and recall rate are better when the depth is increasing. The reasoning fusion method proposed in this paper has certain advantages in comparison effect and discovery in SNP and InDel and has good effect on swelling and pain gene detection. [ABSTRACT FROM AUTHOR]

The New Caledonian crow learning algorithm (NCCLA) is a novel metaheuristic algorithm inspired by the learning behavior of New Caledonian crows learning to make tools to obtain food. However, it suffers from the problems of easily falling into local optima and insufficient convergence accuracy and convergence precision. To further improve the convergence performance of NCCLA, an improved New Caledonian crow learning algorithm (INCCLA) is proposed in this paper. By determining the parent individuals based on the cosine similarity, the juveniles are guided to search toward different ranges to maintain the population diversity; a novel hybrid mechanism of complete and incomplete learning is proposed to balance the exploration and exploitation capabilities of the algorithm; the update strategy of juveniles and parent individuals is improved to enhance the convergence speed and precision of the algorithm. The test results of the CEC2013 and CEC2020 test suites show that, compared with the original NCCLA algorithm and four of the best metaheuristics to date, INCCLA has significant advantages in terms of convergence speed, convergence precision, and stability. [ABSTRACT FROM AUTHOR]

The latest development of neuroscience has deepened the understanding of the information-processing mechanisms in the human brain and inspired a couple of sophisticated computational methods, such as deep learning, memory networks, and hierarchical temporal memory. However, it remains a challenge to explore simpler models due to the high computational cost of the above-mentioned methods. This paper proposes recall network (RN), an intuitive and simple model, that initializes itself by constructing the network path derived from the correlation of features in the training dataset and then makes classification decisions by recalling the paths that are relevant to the features in the test set. The algorithm has been applied to 263 datasets available from UCI Machine Learning Repository, and the classification results of repeated 10-fold cross-validation experiments on Weka demonstrate its competitive performance with prestigious classification algorithms, such as ANN, J48, and KNN. [ABSTRACT FROM AUTHOR]

Multimodal tasks based on attention mechanism and language face numerous problems. Based on multimodal hierarchical attention mechanism and genetic neural network, this paper studies the application of image segmentation algorithm in data completion and 3D scene reconstruction. The algorithm refers to the process of concentrating attention that humans subjectively pay attention to and calculates the difference between each pixel in the genetic neural network test image in the color space and the average value of the target image, which solves the problem of static feature maps and dynamic feature maps of image sequences. In addition, in view of the problem that the number of attention enhancement feature extraction modules is too large and the parameters are too large, the recursive mechanism is used as the feature extraction branch, and new model parameters are not added when the network depth is increased. The simulation results show that the accuracy of the improved image saliency detection algorithm based on the attention mechanism reaches 89.7%, and the difference between the average value of the single-point pixel and the target image is reduced to 0.132, which further promotes the practicability and reliability of the image segmentation model. [ABSTRACT FROM AUTHOR]

Aiming at the problem of low accuracy of face detection under complex occlusion conditions, a double-channel occlusion perceptron neural network model was proposed. The area occlusion judgment unit is designed and integrated into the VGG16 network to form an occlusion perceptron neural network. Thereupon, the features of unoccluded regions and less occluded regions in facial images are extracted by the perceptual neural network. Transfer learning algorithm is utilized to pretrain parameters of the convolution layer to reduce the overfitting problem caused by insufficient training data samples. Face features of the whole face were extracted by optimizing the residual network, and then the face features of the occluding perceptron neural network and the residual network were weighted and fused. Experiments were carried out on two open data sets, AR and MAFA. The results demonstrate that the detection accuracy of this method is higher than that of other methods, and the detection speed is faster. [ABSTRACT FROM AUTHOR]

The ensemble pruning system is an effective machine learning framework that combines several learners as experts to classify a test set. Generally, ensemble pruning systems aim to define a region of competence based on the validation set to select the most competent ensembles from the ensemble pool with respect to the test set. However, the size of the ensemble pool is usually fixed, and the performance of an ensemble pool heavily depends on the definition of the region of competence. In this paper, a dynamic pruning framework called margin-based Pareto ensemble pruning is proposed for ensemble pruning systems. The framework explores the optimized ensemble pool size during the overproduction stage and finetunes the experts during the pruning stage. The Pareto optimization algorithm is used to explore the size of the overproduction ensemble pool that can result in better performance. Considering the information entropy of the learners in the indecision region, the marginal criterion for each learner in the ensemble pool is calculated using margin criterion pruning, which prunes the experts with respect to the test set. The effectiveness of the proposed method for classification tasks is assessed using datasets. The results show that margin-based Pareto ensemble pruning can achieve smaller ensemble sizes and better classification performance in most datasets when compared with state-of-the-art models. [ABSTRACT FROM AUTHOR]

Traditional text annotation-based video retrieval is done by manually labeling videos with text, which is inefficient and highly subjective and generally cannot accurately describe the meaning of videos. Traditional content-based video retrieval uses convolutional neural networks to extract the underlying feature information of images to build indexes and achieves similarity retrieval of video feature vectors according to certain similarity measure algorithms. In this paper, by studying the characteristics of sports videos, we propose the histogram difference method based on using transfer learning and the four-step method based on block matching for mutation detection and fading detection of video shots, respectively. By adaptive thresholding, regions with large frame difference changes are marked as candidate regions for shots, and then the shot boundaries are determined by mutation detection algorithm. Combined with the characteristics of sports video, this paper proposes a key frame extraction method based on clustering and optical flow analysis, and experimental comparison with the traditional clustering method. In addition, this paper proposes a key frame extraction algorithm based on clustering and optical flow analysis for key frame extraction of sports video. The algorithm effectively removes the redundant frames, and the extracted key frames are more representative. Through extensive experiments, the keyword fuzzy finding algorithm based on improved deep neural network and ontology semantic expansion proposed in this paper shows a more desirable retrieval performance, and it is feasible to use this method for video underlying feature extraction, annotation, and keyword finding, and one of the outstanding features of the algorithm is that it can quickly and effectively retrieve the desired video in a large number of Internet video resources, reducing the false detection rate and leakage rate while improving the fidelity, which basically meets people's daily needs. [ABSTRACT FROM AUTHOR]

The deep Q-network (DQN) is one of the most successful reinforcement learning algorithms, but it has some drawbacks such as slow convergence and instability. In contrast, the traditional reinforcement learning algorithms with linear function approximation usually have faster convergence and better stability, although they easily suffer from the curse of dimensionality. In recent years, many improvements to DQN have been made, but they seldom make use of the advantage of traditional algorithms to improve DQN. In this paper, we propose a novel Q-learning algorithm with linear function approximation, called the minibatch recursive least squares Q-learning (MRLS-Q). Different from the traditional Q-learning algorithm with linear function approximation, the learning mechanism and model structure of MRLS-Q are more similar to those of DQNs with only one input layer and one linear output layer. It uses the experience replay and the minibatch training mode and uses the agent's states rather than the agent's state-action pairs as the inputs. As a result, it can be used alone for low-dimensional problems and can be seamlessly integrated into DQN as the last layer for high-dimensional problems as well. In addition, MRLS-Q uses our proposed average RLS optimization technique, so that it can achieve better convergence performance whether it is used alone or integrated with DQN. At the end of this paper, we demonstrate the effectiveness of MRLS-Q on the CartPole problem and four Atari games and investigate the influences of its hyperparameters experimentally. [ABSTRACT FROM AUTHOR]

Ship radiated noise is an important information source of underwater acoustic targets, and it is of great significance to the identification and classification of ship targets. However, there are a lot of interference noises in the water, which leads to the reduction of the model recognition rate. Therefore, the recognition results of radiated noise targets are severely affected. This paper proposes a machine learning Dempster–Shafer (ML-DS) decision fusion method. The algorithm combines the recognition results of machine learning and deep learning. It uses evidence-based decision-making theory to realize feature fusion under different neural network classifiers and improve the accuracy of judgment. First, deep learning algorithms are used to classify two-dimensional spectrogram features and one-dimensional amplitude features extracted from CNN and LSTM networks. The machine learning algorithm SVM is used to classify the chromaticity characteristics of radiated noise. Then, according to the classification results of different classifiers, a basic probability assignment model (BPA) was designed to fuse the recognition results of the classifiers. Finally, according to the classification characteristics of machine learning and deep learning, combined with the decision-making of D-S evidence theory of different times, the decision-making fusion of radiated noise is realized. The results of the experiment show that the two fusions of deep learning combined with one fusion of machine learning can significantly improve the recognition results of low signal-to-noise ratio (SNR) datasets. The lowest fusion recognition result can reach 76.01%, and the average fusion recognition rate can reach 94.92%. Compared with the traditional single feature recognition algorithm, the recognition accuracy is greatly improved. Compared with the traditional one-step fusion algorithm, it can effectively integrate the recognition results of heterogeneous data and heterogeneous networks. The identification method based on ML-DS proposed in this paper can be applied in the field of ship radiated noise identification. [ABSTRACT FROM AUTHOR]

The reinforcement learning algorithms based on policy gradient may fall into local optimal due to gradient disappearance during the update process, which in turn affects the exploration ability of the reinforcement learning agent. In order to solve the above problem, in this paper, the cross-entropy method (CEM) in evolution policy, maximum mean difference (MMD), and twin delayed deep deterministic policy gradient algorithm (TD3) are combined to propose a diversity evolutionary policy deep reinforcement learning (DEPRL) algorithm. By using the maximum mean discrepancy as a measure of the distance between different policies, some of the policies in the population maximize the distance between them and the previous generation of policies while maximizing the cumulative return during the gradient update. Furthermore, combining the cumulative returns and the distance between policies as the fitness of the population encourages more diversity in the offspring policies, which in turn can reduce the risk of falling into local optimal due to the disappearance of the gradient. The results in the MuJoCo test environment show that DEPRL has achieved excellent performance on continuous control tasks; especially in the Ant-v2 environment, the return of DEPRL ultimately achieved a nearly 20% improvement compared to TD3. [ABSTRACT FROM AUTHOR]

In the research work of the brain-computer interface and the function of human brain work, the state classification of multitask state fMRI data is a problem. The fMRI signal of the human brain is a nonstationary signal with many noise effects and interference. Based on the commonly used nonstationary signal analysis method, Hilbert–Huang transform (HHT), we propose an improved circle-EMD algorithm to suppress the end effect. The algorithm can extract different intrinsic mode functions (IMFs), decompose the fMRI data to filter out low frequency and other redundant noise signals, and more accurately reflect the true characteristics of the original signal. For the filtered fMRI signal, we use three existing different machine learning methods: logistic regression (LR), support vector machine (SVM), and deep neural network (DNN) to achieve effective classification of different task states. The experiment compares the results of these machine learning methods and confirms that the deep neural network has the highest accuracy for task-state fMRI data classification and the effectiveness of the improved circle-EMD algorithm. [ABSTRACT FROM AUTHOR]

The age of algorithms is here, and it is really changing people's lives. More and more ethical problems related to algorithms have attracted people's attention, but the related ethical research is still far behind the research of algorithms. As more intelligent algorithms emerge in an endless stream, there will also be a lot of algorithmic ethical issues. On the other hand, with the continuous improvement of the development level of the automobile industry, people have a stronger demand for the safety and stability of modern transportation, and more and more autonomous driving technology has been promoted and applied in the market. At present, most of the studies on the longitudinal collision avoidance system of vehicles use collision warning or emergency braking to avoid collision. However, when the vehicle is in a special situation such as high speed and slippery road, emergency steering is more effective. In order to further improve the vehicle safety and ethical algorithm design points, this article revolves around vehicle lateral active collision avoidance control method research, the collision avoidance decision-making, and path planning and collision avoidance transverse vehicle longitudinal motion control is analyzed, and based on automated driving simulation experiment, the tests carried out to verify the designed control strategy. The experimental results show that the proposed method not only has a good effect of preventing automatic driving collision but also can meet the requirements of algorithm ethics. This research can effectively guide the research of algorithmic ethics in the field of autonomous driving and effectively reduce the occurrence of traffic accidents. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is an emerging subdomain of machine learning (ML) in a distributed and heterogeneous setup. It provides efficient training architecture, sufficient data, and privacy-preserving communication for boosting the performance and feasibility of ML algorithms. In this environment, the resultant global model produced by averaging various trained client models is vital. During each round of FL, model parameters are transferred from each client device to the server while the server waits for all models before it can average them. In a realistic scenario, waiting for all clients to communicate their model parameters, where client models are trained on low-power Internet of Things (IoT) devices, can result in a deadlock. In this paper, a novel temporal model averaging algorithm is proposed for asynchronous federated learning (AFL). Our approach uses a dynamic expectation function that computes the number of client models expected in each round and a weighted averaging algorithm for continuous modification of the global model. This ensures that the federated architecture is not stuck in a deadlock all the while increasing the throughput of the server and clients. To implicate the importance of asynchronicity in cybersecurity, the proposed algorithm is tested using NSL-KDD intrusion detection system datasets. The performance accuracy of the global model is about 99.5% on the dataset, outperforming traditional FL models in anomaly detection. In terms of asynchronicity, we get an increased throughput of almost 10.17% for every 30 timesteps. [ABSTRACT FROM AUTHOR]

As a new brain-inspired computational model of artificial neural networks, spiking neural networks transmit and process information via precisely timed spike trains. Constructing efficient learning methods is a significant research field in spiking neural networks. In this paper, we present a supervised learning algorithm for multilayer feedforward spiking neural networks; all neurons can fire multiple spikes in all layers. The feedforward network consists of spiking neurons governed by biologically plausible long-term memory spike response model, in which the effect of earlier spikes on the refractoriness is not neglected to incorporate adaptation effects. The gradient descent method is employed to derive synaptic weight updating rule for learning spike trains. The proposed algorithm is tested and verified on spatiotemporal pattern learning problems, including a set of spike train learning tasks and nonlinear pattern classification problems on four UCI datasets. Simulation results indicate that the proposed algorithm can improve learning accuracy in comparison with other supervised learning algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of deep learning algorithms, it is gradually applied in UAV (Unmanned Aerial Vehicle) driving, visual recognition, target tracking, behavior recognition, and other fields. In the field of sports, many scientists put forward the research of target tracking and recognition technology based on deep learning algorithms for athletes' trajectory and behavior capture. Based on the target tracking algorithm, a regional proposal network RPN algorithm combined with the twin regional proposal network Siamese algorithm is proposed to study the tracking and recognition technology of athletes' behavior. Then, the adaptive updating network is used to track the behavior target of athletes, and the simulation model of behavior recognition is established. This algorithm is different from the traditional twin network algorithm. It can accurately take the athlete's behavior as the target candidate box in model training and reduce the interference of environment and other factors on model recognition. The results show that the Siamese-RPN algorithm can reduce the interference from the background and environment when tracking the athletes' target behavior trajectory. This algorithm can improve the training behavior recognition model, ignore the background interference elements of the behavior image, and improve the accuracy and overall performance of the model. Compared with the traditional twin network method for sports behavior recognition, the Siamese-RPN algorithm studied in this paper can perform offline operations and distinguish the interference factors of athletes' background environment. It can quickly capture the characteristic points of athletes' behavior as the data input of the tracking model, so it has excellent popularization and application value. [ABSTRACT FROM AUTHOR]

To study incremental machine learning in tensor space, this paper proposes incremental tensor discriminant analysis. The algorithm employs tensor representation to carry on discriminant analysis and combine incremental learning to alleviate the computational cost. This paper proves that the algorithm can be unified into the graph framework theoretically and analyzes the time and space complexity in detail. The experiments on facial image detection have shown that the algorithm not only achieves sound performance compared with other algorithms, but also reduces the computational issues apparently. [ABSTRACT FROM AUTHOR]

This paper proposes a novel test generation algorithm based on extreme learning machine (ELM), and such algorithm is costeffective and low-risk for analog device under test (DUT). This method uses test patterns derived from the test generation algorithm to stimulate DUT, and then samples output responses of the DUT for fault classification and detection. The novel ELM-based test generation algorithm proposed in this paper contains mainly three aspects of innovation. Firstly, this algorithm saves time efficiently by classifying response space with ELM. Secondly, this algorithm can avoid reduced test precision efficiently in case of reduction of the number of impulse-response samples. Thirdly, a new process of test signal generator and a test structure in test generation algorithm are presented, and both of them are very simple. Finally, the abovementioned improvement and functioning are confirmed in experiments. [ABSTRACT FROM AUTHOR]

Inspired by the behavior of dandelion sowing, a new novel swarm intelligence algorithm, namely, dandelion algorithm (DA), is proposed for global optimization of complex functions in this paper. In DA, the dandelion population will be divided into two subpopulations, and different subpopulations will undergo different sowing behaviors. Moreover, another sowing method is designed to jump out of local optimum. In order to demonstrate the validation of DA, we compare the proposed algorithm with other existing algorithms, including bat algorithm, particle swarm optimization, and enhanced fireworks algorithm. Simulations show that the proposed algorithm seems much superior to other algorithms. At the same time, the proposed algorithm can be applied to optimize extreme learning machine (ELM) for biomedical classification problems, and the effect is considerable. At last, we use different fusion methods to form different fusion classifiers, and the fusion classifiers can achieve higher accuracy and better stability to some extent. [ABSTRACT FROM AUTHOR]

Due to the development and application of information technology, a series of modern information technologies represented by 5G, big data, and artificial intelligence are changing rapidly, and people's requirements for video coding standards have become higher. In the High-Efficiency Video Coding (HEVC) standard, the coding block division is not flexible enough, and the prediction mode is not detailed enough. A new generation of Versatile Video Coding (VVC) standards was born. VVC inherits the hybrid coding framework adopted by HEVC, improves the original technology of each module, introduces a series of new coding technologies, and builds on this greatly improving the coding efficiency. Compared with HEVC, the block division structure of VVC has undergone great changes, retaining the quad-tree (QT) division method and increasing the multi-type tree (MTT) division method, which brings high coding complexity. To reduce the computational complexity of VVC coding block division, a fast decision algorithm for VVC intra-frame coding based on texture characteristics and machine learning is proposed. First, we analyze the characteristics of the CU partition structure decision and then use the texture complexity of the CU partition structure decision to terminate the CU partition process early; for CUs that do not meet the early termination of the partition, use the global sample information, local sample information, and context information. The three-category feature-trained tandem classifier framework predicts the division type of CU. The experimental results show that in the full intra mode, compared with the existing VTM10.0, the encoding output bit rate is increased by 1.36%, and the encoding time is saved by 52.63%. [ABSTRACT FROM AUTHOR]

In recent years, imbalanced learning problem has attracted more and more attentions from both academia and industry, and the problem is concerned with the performance of learning algorithms in the presence of data with severe class distribution skews. In this paper, we apply the well-known statistical model logistic discrimination to this problem and propose a novel method to improve its performance. To fully consider the class imbalance, we design a new cost function which takes into account the accuracies of both positive class and negative class as well as the precision of positive class. Unlike traditional logistic discrimination, the proposed method learns its parameters by maximizing the proposed cost function. Experimental results show that, compared with other state-of-the-art methods, the proposed one shows significantly better performance on measures of recall, g-mean, f-measure, AUC, and accuracy. [ABSTRACT FROM AUTHOR]

Nowadays, so many people are living in world. If so many people are living, then the diseases are also increasing day by day due to adulterated and chemical content food. The people may suffer either from a small disease such as cold and cough or from a big disease such as cancer. In this work, we have discussed on the encephalon tumor or cancer which is a big problem nowadays. If we will consider about the whole world, then there are deficiency of clinical experts or doctors as compared to the encephalon tumor affected person. So, here, we have used an automatic classification of tumor by the help of particle swarm optimization (PSO)-based extreme learning machine (ELM) technique with the segmentation process by the help of improved fast and robust fuzzy C mean (IFRFCM) algorithm and most commonly feature reduction method used gray level co-occurrence matrix (GLCM) that may helpful to the clinical experts. Here, we have used the BraTs ("Multimodal Brain Tumor Segmentation Challenge 2020") dataset for both the training and testing purpose. It has been monitored that our system has given better classification accuracy as an approximation of 99.47% which can be observed as a good outcome. [ABSTRACT FROM AUTHOR]

A novel learning algorithm for solving global numerical optimization problems is proposed. The proposed learning algorithm is intense stochastic search method which is based on evaluation and optimization of a hypercube and is called the hypercube optimization (HO) algorithm. The HO algorithm comprises the initialization and evaluation process, displacement-shrink process, and searching space process. The initialization and evaluation process initializes initial solution and evaluates the solutions in given hypercube. The displacement-shrink process determines displacement and evaluates objective functions using new points, and the search area process determines next hypercube using certain rules and evaluates the new solutions. The algorithms for these processes have been designed and presented in the paper. The designed HO algorithm is tested on specific benchmark functions. The simulations of HO algorithm have been performed for optimization of functions of 1000-, 5000-, or even 10000 dimensions. The comparative simulation results with other approaches demonstrate that the proposed algorithm is a potential candidate for optimization of both low and high dimensional functions. [ABSTRACT FROM AUTHOR]

In the past few years, the Internet has become more and more popular, and more and more people use the Internet. A lot of new software has been developed on the Internet, so the network traffic has increased rapidly. A company once clearly stated that, in the future, the network volume in our country will reach nearly 5 zb. In addition, the network is comprehensively unified, and the learning of the Internet is strengthened by the way of suggesting errors. It is also necessary to learn from the external environment to make the finite value of the network as good as possible. Reinforcement learning is about solving many difficult problems. Use reinforcement learning to promote and change this state, so that the advantages of the network can be fully developed. Regarding the environment and actions at the time as the basic mapping requirements, and the network technology strategy can be best developed. In order to solve the QoS optimization scheme of the current mainstream heuristic algorithm in the software-defined network scene, the software-defined network QoS optimization algorithm is proposed. First, the network resources and status information are unified into the network model, and then, the long- and short-term memory network is used to improve the algorithm's flow perception ability. Finally, based on the deep reinforcement learning algorithm, a dynamic traffic scheduling strategy that satisfies the QoS objective is constructed. Among them, QoS refers to the main functions of the entire network system, especially for some new users, but for many old users, this system can represent a certain application, for example, whether a certain software can get timely, whether it can work smoothly when processing videos, and whether it can be interrupted when making a voice call for improvement. [ABSTRACT FROM AUTHOR]

A large amount of patient information has been gathered in Electronic Health Records (EHRs) concerning their conditions. An EHR, as an unstructured text document, serves to maintain health by identifying, treating, and curing illnesses. In this research, the technical complexities in extracting the clinical text data are removed by using machine learning and natural language processing techniques, in which an unstructured clinical text data with low data quality is recognized by Halve Progression, which uses Medical-Fissure Algorithm which provides better data quality and makes diagnosis easier by using a cross-validation approach. Moreover, to enhance the accuracy in extracting and mapping clinical text data, Clinical Data Progression uses Neg-Seq Algorithm in which the redundancy in clinical text data is removed. Finally, the extracted clinical text data is stored in the cloud with a secret key to enhance security. The proposed technique improves the data quality and provides an efficient data extraction with high accuracy of 99.6%. [ABSTRACT FROM AUTHOR]

With the increased development of information technology, almost all the sectors have been developed. Age, educational qualifications, gender, and other factors have no bearing on acquiring knowledge in information technology.Most humans use mobile phones and other gadgets to make their lives easier. Machine Learning techniques are used to analyse the given data and aid in the classification or prediction of the dataset depending on the problem statement. It is significant to determine human behaviour analysis in the context of sports. In this research, the Deep Learning-Deep Belief Network (DL-DBN) algorithm is implemented with probability to analyse human behaviour in sports and implement a distributed probability model for classifying the behavior. The classification results have shown that the accuracy for strength training is both the maximum and the smallest, reaching 99% and 71%, respectively. [ABSTRACT FROM AUTHOR]

The unavailability of large amounts of well-labeled data poses a significant challenge in many medical imaging tasks. Even in the likelihood of having access to sufficient data, the process of accurately labeling the data is an arduous and time-consuming one, requiring expertise skills. Again, the issue of unbalanced data further compounds the abovementioned problems and presents a considerable challenge for many machine learning algorithms. In lieu of this, the ability to develop algorithms that can exploit large amounts of unlabeled data together with a small amount of labeled data, while demonstrating robustness to data imbalance, can offer promising prospects in building highly efficient classifiers. This work proposes a semisupervised learning method that integrates self-training and self-paced learning to generate and select pseudolabeled samples for classifying breast cancer histopathological images. A novel pseudolabel generation and selection algorithm is introduced in the learning scheme to generate and select highly confident pseudolabeled samples from both well-represented classes to less-represented classes. Such a learning approach improves the performance by jointly learning a model and optimizing the generation of pseudolabels on unlabeled-target data to augment the training data and retraining the model with the generated labels. A class balancing framework that normalizes the class-wise confidence scores is also proposed to prevent the model from ignoring samples from less represented classes (hard-to-learn samples), hence effectively handling the issue of data imbalance. Extensive experimental evaluation of the proposed method on the BreakHis dataset demonstrates the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

With the growing information on web, online movie review is becoming a significant information resource for Internet users. However, online users post thousands of movie reviews on daily basis and it is hard for them to manually summarize the reviews. Movie review mining and summarization is one of the challenging tasks in natural language processing. Therefore, an automatic approach is desirable to summarize the lengthy movie reviews, and it will allow users to quickly recognize the positive and negative aspects of a movie. This study employs a feature extraction technique called bag of words (BoW) to extract features from movie reviews and represent the reviews as a vector space model or feature vector. The next phase uses Naïve Bayes machine learning algorithm to classify the movie reviews (represented as feature vector) into positive and negative. Next, an undirected weighted graph is constructed from the pairwise semantic similarities between classified review sentences in such a way that the graph nodes represent review sentences, while the edges of graph indicate semantic similarity weight. The weighted graph-based ranking algorithm (WGRA) is applied to compute the rank score for each review sentence in the graph. Finally, the top ranked sentences (graph nodes) are chosen based on highest rank scores to produce the extractive summary. Experimental results reveal that the proposed approach is superior to other state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

It is common in real-world data streams that previously seen concepts will reappear, which suggests a unique kind of concept drift, known as recurring concepts. Unfortunately, most of existing algorithms do not take full account of this case. Motivated by this challenge, a novel paradigm was proposed for capturing and exploiting recurring concepts in data streams. It not only incorporates a distribution-based change detector for handling concept drift but also captures recurring concept by storing recurring concepts in a classifier graph. The possibility of detecting recurring drifts allows reusing previously learnt models and enhancing the overall learning performance. Extensive experiments on both synthetic and real-world data streams reveal that the approach performs significantly better than the state-of-the-art algorithms, especially when concepts reappear. [ABSTRACT FROM AUTHOR]