With the continuous rise of information technology and social networks, and the explosive growth of network text information, text sentiment analysis technology now plays a vital role in public opinion monitoring and product development analysis on networks. Text data are high-dimensional and complex, and traditional binary classification can only classify sentiment from positive or negative aspects. This does not fully cover the various emotions of users, and, therefore, natural language semantic sentiment analysis has limitations. To solve this deficiency, we propose a new model for analyzing text sentiment that combines deep learning and the bidirectional encoder representation from transformers (BERT) model. We first use an advanced BERT language model to convert the input text into dynamic word vectors; then, we adopt a convolutional neural network (CNN) to obtain the relatively significant partial emotional characteristics of the text. After extraction, we use the bidirectional recurrent neural network (BiGRU) to bidirectionally capture the contextual feature message of the text. Finally, with the MultiHeadAttention mechanism we obtain correlations among the data in different information spaces from different subspaces so that the key information related to emotion in the text can be selectively extracted. The final emotional feature representation obtained is classified using Softmax. Compared with other similar existing methods, our model in this research paper showed a good effect in comparative experiments on an e-commerce text dataset, and the accuracy and F1-score of the classification were significantly improved.

With the development of society and changes in the human living environment, people are increasingly attaching importance to their own health. Regarding medical imaging examinations of certain parts of the body, the process of medical image segmentation has become extremely important. This paper presents a novel hybrid algorithm: SAOBL-IA, a fusion of the Simulated Annealing(SA), Opposition-based Learning(OBL)and Island Algorithm(IA). The Island Algorithm itself suffers from slow convergence speed and the tendency to get stuck in local optimum. To address these limitations, we introduce opposition-based learning to enhance the search range and avoid local optimum. Furthermore, we leverage the simulated annealing approach to accelerate the convergence of SAOBL-IA. Comparing the experimental results, it can be seen that SAOBL-IA has better comprehensive performance. Subsequently, the SAOBL-IA algorithm is utilized in conjunction with an optimized two-dimensional OTSU fusion segmentation technique for the purpose of medical image processing. This study proposes an application of image segmentation based on the SAOBL-IA. The segmentation of pixels around the background and target regions using the two-dimensional OTSU method faces challenges in terms of accuracy. To address this issue, an adaptive thresholding technique known as Adaptive Forking is employed for optimization. By determining the slope of the fork based on the misclassified pixel ratio, enhanced segmentation accuracy can be achieved. This improved approach is then integrated with the SAOBL-IA algorithm and applied to the segmentation of lung medical images. The experimental findings show that the amalgamation of SAOBL-IA with the adaptive two-dimensional OTSU segmentation approach, as proposed in this study, manifests superior segmentation speed and enhanced precision in the context of medical image segmentation.

With the development of the Internet, the data we are dealing with is becoming more and more complex, which brings about various difficulties and problems when we process and use data. Feature selection methods are able to filter and remove redundant features, which is necessary to reduce the dimension of complex data. In this paper, the island algorithm is used to find the optimal feature subset in the set of feature subsets, but as the number of iterations increasing, the island algorithm tends to local optimization. To address this problem, a Gaussian mutation strategy is introduced to improve the island algorithm and proposed an island algorithm based on Gaussian mutation (IAGM). The main idea of the IAGM algorithm is to set a warning sign which aims to record the global optimum value generated by each iteration and judge whether the changes are less than a threshold value in the optimum value for three consecutive iterations. If it is less than the global optimum, the Gaussian mutation is applied to the current globally optimal plant location and then evaluates the new location and exchanges them when it is better than the global optimum. Otherwise, discard this plant and add a Gaussian mutation to the formula of the next new plant towards the global optimum, which is used to diversify the populations. Meanwhile, combining the IAGM algorithm with a support vector machine classifier, a feature selection method of the island algorithm based on Gaussian mutation (IAGMFS) is proposed. The UCI dataset is selected for simulation experiments and applied to classify images, which represents the advantages of the feature selection in IAGMFS proposed in this paper.

Aiming at the shortcomings of the original island algorithm (IA), which has a slow convergence speed and is prone to local optimality, the island algorithm with the characteristics of Levy flight (LevyIA) was proposed by introducing the Levy flight strategy, which replaced the position update method in the original algorithm and made use of the occasional long jump of Levy flight strategy to jump out of the local optimal solution. The simulation test of the improved algorithm is carried out with 6 test functions, and the experimental results show that the improved algorithm LevyIA can effectively solve the problems of slow convergence speed and local optimization of island algorithm. For the micro-soft robot model with multi-mode movement, IA and LevyIA algorithms were used to optimize the size of the robot and the appropriate magnetic field intensity needed to drive the robot to deform and move. Finally, the experimental data of swimming speed of the robot obtained by simulation shows that, among the three optimization results obtained by LevyIA algorithm and IA algorithm, LevyIA algorithm can make the robot swim faster when moving forward with minor perturbations.