Search

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Test & Measurement Technology is the property of Publishing Center of North University of China and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of CT Theory & Applications is the property of Editorial Department of CT Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The level of face recognition technology continues to improve, and has achieved an ideal recognition rate in identity authentication, human-computer interaction and other industrial applications, and the market scale keeps growing. However, the occlusion problem in real scenes has not been completely solved. How to restrain or eliminate the negative impact of occlusion on key facial feature, is one of the hot spots in the field of face recognition. Aiming at the problem of lack of face structure information caused by occlusion, this paper reviews the occluded face recognition datasets and the occluded face recognition methods. Firstly, this paper introduces and analyzes some important new occluded face recognition datasets; Secondly, this paper summarizes the traditional learning methods and deep learning based methods to solve occlusion problems, and emphasizes the deep learning based robustness feature extraction and occluded facial information recovery. Finally, this paper summarizes and analyzes the advantages and disadvantages of relevant methods, points out the problems and challenges of occluded face recognition, and prospects the future research directions. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to address the shortcomings of the facial landmarks detection models, which cannot model the relations between long-distance landmarks, this paper proposed a parallel multi-branch architecture combining with convolution and Transformer for facial landmarks tasks, called MCTN, it utilized the dynamic attention mechanism to model the long-distance relations between facial landmarks. The multi-branch parallel structure designing allowed MCTN to include shared weights, global information fusion and other merits. What’s more, this paper proposed the novel Transformer structure, Deformer, which could make the MCTN focused attention weights faster on sparse and meaningful locations and solved the problem of slow convergence of Transformer. MCTN reached 4.33%,3.12% and 3.15% normalized average error respectively on the WFLW,300W and COFW datasets, the results show that MCTN utilizes Transformer with CNN multi-branch parallel structure and Deformer structure to dramatically outperform other facial landmarks localization algorithms based on convolution network. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Local feature information plays an important role in image segmentation, however, the referring image segmentation task is dependent on the text expression, so it is impossible to extract local feature information directly from the original reference image. In order to solve this problem, this paper proposes a specific noun-guided local feature extraction deep neural network model（NgLFNet). The NgLFNet model can automatically mine the local feature information of the object to be segmented according to the key nouns in the input text expression. Specifically, the model first obtains key nouns in text through sentence analysis; secondly, extracting corresponding features through text and image encoders, and using the key nouns to obtain local features of high-interest regions through the multihead attention mechanism; then the multi-modal features are gradually fused to learn; Finally, the decoding and correction module uses the obtained local features to perform more detailed corrections on the prediction mask to obtain the final result. The method in this paper is compared with a variety of mainstream referring segmentation methods and the experimental results show that the proposed method improves the accuracy of text-based instance segmentation task. [ABSTRACT FROM AUTHOR]

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Donghua University (Natural Science Edition) is the property of Journal of Donghua University (Natural Science) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Guangdong University of Technology is the property of Journal of Guangdong University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of CT Theory & Applications is the property of Editorial Department of CT Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Pearl River is the property of Pearl River Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Central China Normal University is the property of Huazhong Normal University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to improve the search ability of AGV in complex unknown environment, this paper proposed an improved DDPG. It constructed the empirical playback matrix and double-layer network structure to improve the convergence speed of the algorithm ε-greedy in the green search strategy, to solve the local optimization problem of AGV in selecting the optimal action. To solve the problem of slow training speed of deep neural network, it applied priority sampling to depth deterministic strategy gradient algorithm. In order to solve the problem of high complexity of ordinary priority sampling, this paper proposed a small batch priority sampling method to train the network. In order to verify the effectiveness of the method, it used the grid method to model and compare the simulation experiments in different complex environments. It compared the loss function, iteration times and return value of different algorithms. The experimental results show that compared with the original algorithm, the improved algorithm reduces the loss function, reduces the number of iterations and increases the return value, which verifies the effectiveness of the algorithm. At the same time, it provides a new idea for AGV to complete the planning task more safely and quickly in complex environment. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin Institute of Technology. Social Sciences Edition / Haerbin Gongye Daxue Xuebao. Shehui Kexue Ban is the property of Harbin Institute of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The recommendation algorithm based on graph neural network can extract the association relationship between users and goods. Traditional methods can’t extract this relationship. At present, most of these algorithms ignore the general prefe-rences in the review data of users and products. In order to solve this problem, this paper proposed a new method. This me-thod used the graph neural network to extract association relations, and the advantage of deep learning to extract the general preferences, and carried out feature fusion to improve the recommendation effect. This paper conducted comparative experiments and ablation experiments on four sets of public data sets to verify the effectiveness of the proposed method. The evaluation indexes include the recall rate and normalized discounted cumulative gain. Experiments show that this method is more effective than the existing algorithms. The feature fusion of the two networks can improve the recommendation effect. [ABSTRACT FROM AUTHOR]

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

When the scale of data is large, the deep learning model will encounter the problem of time-consuming weight adjustment and easy to fall into the local optimal solution. In order to solve these problems, broad learning system comes into being. The broad learning system not only has the advantages of simple structure, fast training speed and high accuracy, but also has the advantage of incremental learning. This paper firstly introduced the background and development of broad learning system, then described the basic theory and implementation method of broad learning system, and compared its similarities and differences with deep network. Then this paper introduced the improvement of broad learning system on image classification, numerical regression, EEG signal processing, and analyzed the advantages and disadvantages of these algorithms. Finally, it summarized the shortcomings of existing broad learning algorithms, and prospected the future research direction. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper presented an image dehazing method based on deep learning to solve the problem that the remote sensing images had reduced image sharpness due to haze. Firstly, this algorithm distorted the original atmospheric scattering model to get an end-to-end defrosting model. Then, it unified several unknown parameters to one parameter and estimated the unknown parameters by using multiscale convolution neural network. Finally, it brought the parameter estimates into the defrosting model to get a haze-free image. For no reference image dataset, this paper used the existing dataset to preliminary train the network, then added the self-built dataset to secondary train the network. The experimental results show that, compared with the related defrosting algorithms, the proposed algorithm improves the visual effect and objective index to some extent, and effectively improves the clarity of remote sensing images in haze weather conditions. [ABSTRACT FROM AUTHOR]

There is a huge demand for weather cloud images in the observatory' s weather monitoring system. In order to solve the problems of model instability and loss of image features when the conventional generative adversarial network expands the dataset of the weather cloud images, this paper proposed a double-layer embedded adversarial image generation method based on SAU-Net DCGAN. This method consisted of two layers of networks which were nested within each other. Firstly,by the first layer of embedded network, it added the U-shaped network to the generator of the generative adversarial network. This network acted as the basic architecture and enhanced the feature recovery capability of the image by using the jump connection between the encoder and the decoder. Secondly,by the second layer of embedded network, it added SA to the U-shaped network. This attention mechanism reduced the complexity of the model by simplifying the parameters, improved effectively the feature loss in the dark part of the image. Finally, it developed a new weight calculation method to strengthen the connection between each features and improved the extraction of detail texture features from the images. The experimental results show that the quality of the images generated by this method is better than that of the conventional generative adversarial network in terms of sharpness and saturation. The evaluation indicators PSNR and SSIM have increased by 27. 06 dB and 0. 606 5 respectively. [ABSTRACT FROM AUTHOR]

For image denoising, this paper proposed CEANet which had a dual-channel dilated convolution with attention mechanism to solve the problem of information loss caused by deep neural network. Reserving block merged output feature maps of each layer to make up the loss of detail information during convolution. Dilated convolution achieved better balance between denoising performance and efficiency,extracting more features with less parameters and enhancing the representation capability of the model for noisy images. The sparse module of dilated convolution expanded the receptive field to extract significant structural information and edge features and recover details of complicated noisy images. The feature enhancement module based on attention mechanism further guided network for image denoising by fusing global features with local features. The experimental results show that CEANet achieves high peak signal-to-noise ratio and structure similarity mean value at Gaussian white noise level of 25 and 50, which can capture image detail information more efficiently and has better performance in edge retention and noise suppression. Through the above comparative experiments proved the effectiveness of the algorithm framework. [ABSTRACT FROM AUTHOR]

High-quality learning low-dimensional representation of nodes in the graph is a current research hotspot. The existing shallow model methods cannot capture the nonlinear relationship of the graph structure, and the graph convolution model in the graph neural network technology will cause an over-smoothing problem. At the same time, how to determine the role of different hop number relationships in graph representation learning is also a problem that needs to be solved in the research. To solve the above problems, this paper proposes a deep learning model based on T（T＞1） feedforward neural networks. The framework uses deep learning models to extract the nonlinear relationship of the graph structure, and T sub-models effectively capture the local and global（higher-order） relationship information of the graph, and they give different roles in the final vector representation to take advantage of different hop relations. Experimental results on vertex classification and link prediction tasks show that the framework is competitive with existing methods, the benchmark algorithm can be improved by about 20%. [ABSTRACT FROM AUTHOR]

As a key problem and hub link between problem discovery and problem solving, the current research on root cause analysis mainly includes two types of methods: data-driven and causality-driven. In view of the advantages of data-driven methods in narrowing the range of root causes, at present, root cause research mainly focusses on datadriven methods such as association rule mining, heuristic search, machine learning and deep learning. There are few root cause analysis from the perspective of causal knowledge, nor has it been based on method dimension. The inductive analysis of the root cause is carried out, and there is a lack of relevant research results. Therefore, this paper sorts out and summarizes the main results of root cause analysis in recent years, analyses the differences and advantages of root cause analysis under different method dimensions, and proposes a root cause analysis method that integrates causal knowledge, and combines asymmetric Shapley value with causal chain diagram to improve the accuracy of root cause analysis. Finally, the existing some research difficulties and development trends put forward scientific and meaningful future research directions. [ABSTRACT FROM AUTHOR]