Sentiment analysis of Chinese micro-blog based on sentiment dictionary has become a challenging research subject in the field of artificial intelligence. However, due to insufficient sentiment words, Chinese micro-blog sentiment analysis is difficult to process high accuracy. Aimed at this issue, we propose a method for constructing multiple sentiment dictionaries, which mainly constructs original sentiment dictionary, emoji dictionary, and other related dictionaries. Among them, we have innovatively constructed a Chinese micro-blog new word sentiment dictionary. Multiple sentiment dictionaries increase the coverage of sentiment words. At the same time, we further analyze semantic rule sets between Chinese micro-blog texts and take the inter-sentence analysis rules and sentence pattern analysis rules into the sentiment analysis of Chinese micro-blog, which further improves the accuracy of Chinese mi-cro-blog sentiment analysis. Finally, based on the method of multiple sentiment dictionaries and semantic rule sets, we propose an algorithm for Chinese micro-blog sentiment calculation from complex sentences to clauses and then from clauses to words, and finally combined with the emoji. This algorithm can accurately classify Chinese micro-blog into positive Chinese micro-blog, negative Chinese micro-blog, and neutral Chinese micro-blog. The experimental results show that this method has greatly improved the sentiment analysis of Chinese micro-blog.

This study proposes a novel lightweight grape detection method. First, the backbone network of our method is Uniformer, which captures long-range dependencies and further improves the feature extraction capability. Then, a Bi-directional Path Aggregation Network (BiPANet) is presented to fuse low-resolution feature maps with strong semantic information and high-resolution feature maps with detailed information. BiPANet is constructed by introducing a novel cross-layer feature enhancement strategy into the Path Aggregation Network, which fuses more feature information with a significant reduction in the number of parameters and computational complexity. To improve the localization accuracy of the optimal bounding boxes, a Reposition Non-Maximum Suppression (R-NMS) algorithm is further proposed in post-processing. The algorithm performs repositioning operations on the optimal bounding boxes by using the position information of the bounding boxes around the optimal bounding boxes. Experiments on the WGISD show that our method achieves 87.7% mAP, 88.6% precision, 78.3% recall, 83.1% F1 score, and 46 FPS. Compared with YOLOx, YOLOv4, YOLOv3, Faster R-CNN, SSD, and RetinaNet, the mAP of our method is increased by 0.8%, 1.7%, 3.5%, 21.4%, 2.5%, and 13.3%, respectively, and the FPS of our method is increased by 2, 8, 2, 26, 0, and 10, respectively. Similar conclusions can be obtained on another grape dataset. Encouraging experimental results show that our method can achieve better performance than other recognized detection methods in the grape detection tasks.

Dimensionality reduction is a hot research topic in pattern recognition. Traditional dimensionality reduction methods can be separated into linear dimensionality reduction methods and nonlinear dimensionality reduction methods. Linear dimensionality reduction methods usually utilize Euclidean distances to explore global geometric structures, and nonlinear dimensionality reduction methods can preserve local manifold structures in learned low-dimensional subspaces. However, redundant information and noises of the raw high-dimensional data restrict the classification performance of these methods. To solve the problem, we propose a novel orthogonal dimensionality reduction method based on twin eigen decomposition called orthogonal locality and globality preserving projections (OLGPP). Orthogonality, as a commonly used criterion in pattern recognition, is insensitive to the redundant information and the noises. OLGPP not only combines the advantages of global Euclidean structures and local manifold structures, but also is insensitive to the redundant information and noises of the raw high-dimensional data by embedding the orthogonality criterion. Additionally, the objective function based on twin eigen decomposition can be solved sequentially to obtain analytical solutions. On four well-known datasets, we design extensive experiments to evaluate the performance of OLGPP. From the experimental results, OLGPP has the optimal experimental results, and its average recognition rates are about 10% higher than the classic local dimensionality reduction method (i.e., locality preserving projection), which proves OLGPP is an effective dimensionality reduction method.

Multi-set canonical correlation analysis (MCCA) is a famous multi-modal coherent subspace learning method. However, sample-based between-modal and within-modal covariance matrices of MCCA usually deviate from real covariance matrices due to noise information and limited sample size. The deviation will weaken the performance of MCCA, especially in image recognition. Aiming at this challenging issue, we correct singular values of sample covariance matrices with the employment of Cauchy estimate theory and further obtain Cauchy covariance matrices that are closer to real covariance matrices. On the basis of Cauchy covariance matrices, we develop a novel multi-modal subspace fusion method, i.e. Cauchy multi-set canonical correlations. By maximizing Cauchy correlations between different modalities and constraining Cauchy scatters of within-modal data, the method can learn a Cauchy coherent fusion subspace with well discriminative power from a few images. Experiment results have shown the effectiveness of the proposed method, promising to the aims of this research.

Rotating machinery is one of the important parts of industrial production equipment, and it is of great practical significance for fault diagnosis. Aiming at the problem of classification difficulty caused by feature interleaving in complex working conditions and high-dimension of rotating machinery fault samples, a rotating machinery fault diagnosis method based on multi-structure fusion discriminative projection (MFDP) is proposed. MFDP constructed intraclass and interclass hypergraph structures with multivariate relationships, fully revealing the higher-order association information among multiple samples. Besides, a tangential graph structure of MFDP is further constructed by combining the tangential affine of local samples to preserve the local tangential information of the manifold space. In the method, a unified objective optimization model of the discriminative hypergraph structures and local tangential graph structures is developed, and by solving the model, we can obtain fault structure features with well intraclass compactness and interclass separability. Extensive experiments on the Case Western Reserve University bearing dataset and Connecticut gear dataset show that the method has a good diagnostic accuracy of rotating machinery in different working conditions.

Rolling bearings are essential in rotating machinery, and accurate remaining useful life (RUL) predictions are necessary for effective maintenance and optimal performance. Poor trend of health indicators (HI) and operating condition variations can reduce the reliability and accuracy of RUL predictions.To address these challenges, we propose a deep transfer network based on dual-task learning for predicting the remaining life of rolling bearings (DTLDL-RUL). This framework integrates health status assessment and RUL prediction, leveraging task commonalities and differences to create a robust model, then transfers it to improve generalization in the target domain. Specifically, we first mine spatiotemporal features from vibration signals to generate and classify HI, labeling them for subsequent tasks. Next, we use the shared feature extractors and private residual networks to capture common and specific features of each task, merge them with the multi-gate control networks, and adaptively adjust task weights in the loss function to enhance model adaptability. Finally, the trained model is transferred to the target domain using domain adaptation to extract domain invariant features and consider target-specific features, enhancing generalization. Furthermore, to enhance prediction accuracy, we incorporate physical models as constraints in the loss function, combining data-driven and physical principles to improve model interpretability. Experiments conducted on the 2012 PHM and XJTU-SY datasets demonstrate that the proposed method achieves high accuracy and generalization in RUL predictions.