Abstract

The development of the civil aviation industry has continuously increased the requirements for the efficiency of airport ground support services. In the existing ground support research, there has not yet been a process model that directly obtains support from the ground support log to study the causal relationship between service nodes and flight delays. Most ground support studies mainly use machine learning methods to predict flight delays, and the flight support model they are based on is an ideal model. The study did not conduct an in-depth study of the causal mechanism behind the ground support link and did not reveal the true cause of flight delays. Therefore, there is a certain deviation in the prediction of flight delays by machine learning, and there is a certain deviation between the ideal model based on the research and the actual service process. Therefore, it is of practical significance to obtain the process model from the guarantee log and analyze its causality. However, the existing process causal factor discovery methods only do certain research when the assumption of causal sufficiency is established and does not consider the existence of latent variables. Therefore, this article proposes a framework to realize the discovery of process causal factors without assuming causal sufficiency. The optimized fuzzy mining process model is used as the service benchmark model, and the local causal discovery algorithm is used to discover the causal factors. Under this framework, this paper proposes a new Markov blanket discovery algorithm that does not assume causal sufficiency to discover causal factors and uses benchmark data sets for testing. Finally, the actual flight service data are used for causal discovery among flight service nodes. The local causal discovery algorithm proposed in this paper has a certain competitive advantage in accuracy, F1, and other aspects of the existing causal discovery algorithm. It avoids the occurrence of its dimensional disaster. Through the in-depth analysis of the flight safety reason node discovered by this method, it is found that the unreasonable scheduling of flight support personnel is an important reason for frequent flight delays at the airport.

Highlights

  • Introduction e2019 Civil Aviation Industry Development Statistics Bulletin [1] shows that compared with 2018, the total civil aviation transportation turnover in 2019 has increased by 7.2%. e increase in the total airport transportation turnover requires the improvement of airport flight service efficiency

  • It is a topology-based method. e neighbor set and spouse set of the target variable is constructed by the method of scoring. en, according to the relevant definition and inference of the area set proposed by [7], the adjacent area set is determined, and the complete Markov blanket (MB) is searched. rough the advantages of the scoring method in searching the neighborhood set and spouses set of the target variable, the SMMB algorithm has a better performance on the F-measure evaluation index than the constraint-based maximal ancestral graph (MAG) MB algorithm proposed before

  • In practice, the network is usually relatively sparse, and the running time is significantly lower than the worst-case running time. e algorithm SMMB loops at most (n − 1)2 times and continuously calls the FINDDIS algorithm, the FINDNEIGHBORS algorithm, and the FINDSPOUSES algorithm in the loop. e algorithm SMMB runs at most O(((n − 1)3 + 1)n42n−1)

Read more

Summary

Related Work

Compared with the MB discovery algorithm that uses the independence test to find the target variable T, the scorebased MB discovery algorithm relies on certain scoring criteria to learn the most suitable network structure for the data sample It has the following characteristics: Definition 8 (local score consistency [28]). Erefore, this paper proposes a topology-based method to find the target node’s neighborhood set and spouse set using the SLL [30] method On this basis, use Corollary 1 to determine the bidirectional edge of the target node and the neighboring nodes. The FINDNEIGHBORS algorithm and the FINDSPOUSES algorithm use the while loop to iterate the subroutine to search for the potential parent and child set and potential mate set of the target node. In practice, the network is usually relatively sparse, and the running time is significantly lower than the worst-case running time. e algorithm SMMB loops at most (n − 1) times and continuously calls the FINDDIS algorithm, the FINDNEIGHBORS algorithm, and the FINDSPOUSES algorithm in the loop. e algorithm SMMB runs at most O(((n − 1)3 + 1)n42n−1)

Experiment
BRIDGEBRONEEQUIPMENTEND-BOARDINGEND
Findings
Conclusions and Future
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call