A data processing method for an aeronautical information service state

Abstract

The application provides a data processing method for an aeronautical information service state, which is realized based on a tree structure model and a node information table. The tree structure model comprises a root node, a first leaf node layer, a second leaf node layer and a third leaf node layer. The descriptor of the root node represents the aeronautical information service state. The descriptor of each first leaf node in the leaf node layer represents a corresponding keyword. The keyword is a keyword associated with the aeronautical information service state. The node information table comprises a first node association relationship record table, a second node association relationship record table, a node weight record table and a node value rule table. When receiving text information that needs to be processed, the application can quickly obtain the state value corresponding to the text information, can improve the acquisition rate and accuracy of the aeronautical information service state, and can quickly and accurately obtain the aeronautical information service continuity service capability.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of aviation intelligence, in particular to a data processing method for aviation intelligence service state. BACKGROUND

[0002] Aviation intelligence business is an important part of ensuring the safe operation of air transportation methods. In recent years, the aviation industry is facing increasingly complex challenges, air safety accidents occur frequently, and the safe operation of aircraft is threatened, so the importance of aviation intelligence business is increasingly prominent. First, the effective implementation of aviation intelligence business helps to prevent accidents and unexpected events. By timely collecting, analyzing and transmitting various aviation intelligence, including weather information, flight routes, airspace conditions, etc., the aviation intelligence department can provide accurate information support for pilots and airlines, help them make correct decisions, and reduce the risk of accidents. Second, the optimization of aviation intelligence business can improve the efficiency and process of air transportation methods. By using advanced technical means such as artificial intelligence and big data analysis, aviation intelligence can be quickly and accurately processed and analyzed, which can optimize flight plans and resource allocation, improve the efficiency of air transportation, reduce costs, and reduce delays and cancellations, and improve the satisfaction of passengers and airlines. In addition, the development of aviation intelligence business also promotes cooperation and communication with other relevant stakeholders. Aviation intelligence departments closely cooperate with air traffic control departments, airlines, airport management departments and other relevant parties to share information, conduct risk assessment and coordinate actions to ensure the overall safety and reliability of air transportation methods. Therefore, the aviation intelligence service state is crucial to ensure the safety, efficiency and sustainability of air transportation. SUMMARY

[0003] To solve the above technical problems, the technical scheme adopted by the present application is as follows:

[0004] The data processing method for aviation intelligence service state provided by the embodiment of the present application is realized based on a tree structure model and a node information table. The tree structure model includes a root node, a first leaf node layer, a second leaf node layer and a third leaf node layer. The descriptor of the root node represents the aviation intelligence service state. The descriptor of each first leaf node in the first leaf node layer represents a corresponding first keyword. The descriptor of each second leaf node in the second leaf node layer represents a corresponding second keyword. The descriptor of each third leaf node in the third leaf node layer represents a corresponding third keyword. The first keyword, the second keyword and the third keyword are all keywords associated with the aviation intelligence service state. The node information table includes a first node association relationship record table, a second node association relationship record table, a node weight record table and a node value rule table. The i-th row of the first node association relationship record table includes (Nd1 i , NS1 i), Nd1 i is a descriptor corresponding to the i th first leaf node, NS1 i is a lower node set of the i th first leaf node, i is 1 to n1, n1 is the number of first leaf nodes; the j th row of the second node association relationship record table includes (Nd2 j , NS2 j ), Nd2 j is a descriptor corresponding to the j th second leaf node, NS2 j is a lower node set of the j th second leaf node, j is 1 to n2, n2 is the number of second leaf nodes; the node weight record table is used for recording the descriptor of each leaf node and the corresponding weight, and the node value rule table includes the descriptor of each leaf node in the third leaf node layer and the corresponding value rule; the processor is used for executing a computer program to realize the following steps:

[0005] S100, obtaining the text information currently needing to be processed as the current text information to be processed; the text information includes the description information of the keyword corresponding to each leaf node in the third leaf node layer.

[0006] S200, based on the obtained current text information to be processed and the node value rule table, obtaining the value corresponding to each keyword in the current text information to be processed as the value of the corresponding third leaf node; obtaining the third leaf node value set.

[0007] S300, based on the third leaf node value set, the second node association relationship record table and the node weight record table, obtaining the value corresponding to each second leaf node, obtaining the second leaf node value set.

[0008] S400, based on the second leaf node value set, the first node association relationship record table and the node weight record table, obtaining the value corresponding to each first leaf node, obtaining the first leaf node value set.

[0009] S500, based on the first leaf node value set and the node weight record table, obtaining the value of the root node as the state value corresponding to the current text information to be processed.

[0010] The present application has at least the following beneficial effects:

[0011] The data processing method of the aviation intelligence service state provided by the embodiment of the present application is realized based on the tree structure model and the node information table constructed by taking the keyword associated with the aviation intelligence service state as the node, when receiving the text information needing to be processed, the state value corresponding to the text information can be quickly obtained, and the acquisition rate and accuracy of the aviation intelligence service state can be improved.

[0012] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0014] Figure 1 A flowchart illustrating a data processing method for the status of aviation information services provided in an embodiment of the present invention. Detailed Implementation

[0015] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0016] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used herein in the description of this invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The term "and / or" as used herein includes any and all combinations of one or more of the associated listed items.

[0017] It should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe the steps as sequential processes, many of these steps can be performed in parallel, concurrently, or simultaneously. Furthermore, the order of the steps can be rearranged. A process can be terminated when its operation is complete, but it may also have additional steps not included in the figures. A process can correspond to a method, function, procedure, subroutine, subroutine, etc.

[0018] The embodiment of the present application provides a data processing method of an aeronautical information service state, which is used for obtaining the aeronautical information service state of an airport based on aeronautical information service data of the airport. In the embodiment of the present application, the aeronautical information service data can include aeronautical regulations, flight rules, airport, airspace, air route, flight procedure, communication navigation facilities, various aeronautical service procedures and the like, and aeronautical chart and the like. In the embodiment of the present application, the aeronautical information service state is used for representing the continuity service capability of the aeronautical information service.

[0019] Further, the data processing method of the aeronautical information service state provided by the embodiment of the present application can be realized based on a tree structure model and a node information table. The tree structure model and the node information table are stored in a database. The tree structure model includes a root node, a first leaf node layer, a second leaf node layer and a third leaf node layer.

[0020] The descriptor of the root node represents the aeronautical information service state, the descriptor of each first leaf node in the first leaf node layer represents a corresponding first keyword, the descriptor of each second leaf node in the second leaf node layer represents a corresponding second keyword, and the descriptor of each third leaf node in the third leaf node layer represents a corresponding third keyword. The first keyword, the second keyword and the third keyword are all keywords associated with the aeronautical information service state. The node information table includes a first node association relationship record table, a second node association relationship record table, a node weight record table and a node value rule table. The i-th row of the first node association relationship record table includes (Nd1 i , NS1 i ), Nd1 i is a descriptor corresponding to the i-th first leaf node, NS1 i is a lower node set of the i-th first leaf node, and i is valued from 1 to n1, where n1 is the number of the first leaf nodes. The j-th row of the second node association relationship record table includes (Nd2 j , NS2 j ), Nd2 j is a descriptor corresponding to the j-th second leaf node, NS2 j is a lower node set of the j-th second leaf node, and j is valued from 1 to n2, where n2 is the number of the second leaf nodes. The node weight record table is used for recording the descriptor of each leaf node and the corresponding weight. The node value rule table includes the descriptor of each leaf node in the third leaf node layer and the corresponding value rule.

[0021] In the embodiment of the present application, the lower nodes of each leaf node are not repeated. The first keyword, the second keyword and the third keyword can be obtained based on expert reference to relevant laws and regulations and investigation on actual occurrence of the air intelligence service ability of small and medium-sized airports. The value rule can be determined based on actual situation and experts. In the embodiment of the present application, 5 first keywords, 19 second keywords and 80 third keywords can be included.

[0022] Further, in the embodiment of the present application, the first keyword includes the following keywords: air original data notification sheet, navigation notice, air intelligence service, management and supply of air intelligence service related data, operation guarantee of air intelligence service.

[0023] Further, the second keyword corresponding to the air original data notification sheet includes at least the following keywords: acceptance and audit of the air original data notification sheet, verification, editing and reporting of the air original data notification sheet, management system of the air original data notification sheet.

[0024] The third keyword corresponding to the acceptance and audit of the air original data notification sheet can include the following 7 keywords: time requirement of the original data notification sheet, checking the consistency of the original material and the supporting material when auditing the air original data notification sheet, processing flow of the air original data notification sheet when the content is wrong or controversial in the navigation notice, processing flow of the air original data notification sheet when the content is wrong or controversial in the reporting, analysis of the development of common error cases of the original data notification sheet, auxiliary means of the original data notification sheet audit and repeated notice monitoring, and the original data notification sheet archive and record form.

[0025] In the embodiment of the present application, the supporting material is the material approved by the competent department.

[0026] The value rule of the third keyword corresponding to the acceptance and audit of the air original data notification sheet can be shown in Table 1 as follows:

[0027] Table 1

[0028]

[0029]

[0030] Further, the verification, editing and reporting of the aeronautical raw material notification sheet correspond to the third keyword, which at least includes the following 7 keywords: raw material reporting workflow, relevant regulations followed by the audit and reporting of raw materials, processing mechanism for classification and grading of sensitive data (including classification and management requirements of data information, for reported raw data, device password, user information, etc.), whether the reporting time of the aeronautical intelligence major data change plan is clear, implementation of the aeronautical intelligence major data change plan, content complex and long-term non-stop construction release material, raw material reporting tracking and issuing correction process.

[0031] The third keyword corresponding to the verification, editing and reporting of the aeronautical raw material notification sheet is shown in Table 2 as follows:

[0032] Table 2

[0033]

[0034] Further, the third keyword corresponding to the management system of the aeronautical raw material notification sheet at least includes the following 10 keywords: whether the raw material providing department or unit signs a raw material providing agreement with the aeronautical intelligence raw material providing department or unit, and whether the responsibilities and requirements of both parties are clear and the agreement is updated regularly, whether the raw material providing department or unit designates an agency or a person responsible for providing aeronautical intelligence raw material to the aeronautical intelligence service agency and maintaining direct and fixed contact with the aeronautical intelligence service agency, whether the aeronautical intelligence raw material notification sheet is archived as an official record for reference, whether a regular coordination and training mechanism should be established between the aeronautical intelligence raw material providing department or unit and the aeronautical intelligence service agency, whether a regular compliance check mechanism for raw materials is established and a comprehensive check and review of the released materials is conducted, whether a review mechanism for aeronautical materials and aeronautical intelligence raw materials is established, and the use of aeronautical intelligence raw materials is fed back to the aeronautical intelligence raw material providing department or unit, whether the non-stop construction and planned routine maintenance raw material providing time limit does not meet the requirements of the regulations and specifications, whether the raw material providing department coordination meeting is attended, and whether the verification and verification procedure of the raw material notification sheet is established.

[0035] The third keyword corresponding to the management system of the aeronautical raw material notification sheet corresponds to the value rule shown in Table 3 as follows:

[0036] Table 3

[0037]

[0038] Further, the second keyword corresponding to the navigation notice at least includes the following keywords: distribution of navigation notice, acceptance and processing of navigation notice, navigation notice management system.

[0039] The third keyword corresponding to the distribution of the navigation notice comprises at least the following keywords: deviation of the navigation notice and snow condition notice, average time from receiving the original information notice to publishing the navigation notice, and whether there is an auxiliary means for publishing the navigation notice.

[0040] The third keyword corresponding to the acceptance and processing of the navigation notice comprises at least the following keywords: whether the continuity and integrity of the collected regional navigation notice are checked, frequency of receiving and processing the navigation notice in a day, and whether there is an auxiliary means for receiving and processing the navigation notice (such as repeated navigation notice and format error in the reminder library).

[0041] The third keyword corresponding to the navigation notice management system comprises at least the following keywords: clear work flow and standard of publishing the navigation notice and the snow condition notice, clear work flow and standard of receiving, processing and storing the navigation notice, snow condition notice, volcano notice and official report, whether there is a clear work flow and standard for checking the navigation notice, clear processing flow of deviation of the navigation notice and the snow condition notice (rectification method, record and analysis), clear work flow of abnormal situation in the publishing process (such as non-normal number jump of the navigation notice and the snow condition notice, alarm and the like), and whether there is an inspection system for publishing, receiving, processing and reporting the navigation notice.

[0042] In the embodiment of the present application, the value rule of the third keyword corresponding to the navigation notice can be shown in Table 4 as follows:

[0043] Table 4

[0044]

[0045]

[0046] Further, the second keyword corresponding to the aviation information service comprises at least the following keywords: pre-flight aviation condition service, post-flight aviation information service, other service and aviation information service management system.

[0047] In the embodiment of the present application, the other service refers to the service other than the pre-flight aviation condition service and the post-flight aviation information service.

[0048] In the embodiment of the present application, the third keyword corresponding to the pre-flight aviation condition service comprises at least the following three keywords: whether there is a long-term stable demand for providing the pre-flight aviation information service, whether the pre-flight information bulletin is provided, and whether the explanation service and data query service are provided.

[0049] The third keyword corresponding to the post-flight aviation information service comprises at least the following two keywords: whether there is a long-term stable demand for providing the post-flight aviation information service, and post-flight aviation information collection condition.

[0050] The third keyword corresponding to the other service includes at least the following two keywords: whether there is a long-term stable other service providing demand, and other service providing conditions.

[0051] The third keyword corresponding to the aviation intelligence service management system includes at least the following keywords: a clear pre-flight aviation intelligence service providing work flow (such as pre-flight intelligence announcement, interpretation service, data query, etc.), a clear post-flight aviation intelligence service providing work flow, and a clear other service providing work flow.

[0052] Further, the third keyword corresponding to the aviation intelligence service is shown in Table 5 as follows:

[0053] Table 5

[0054]

[0055] Further, the third keyword corresponding to the aviation intelligence service related data management and supply includes at least the following keywords: important navigation notice announcement, aviation data and aviation map providing conditions, aviation data and aviation map maintenance and management intelligence service, and aviation data management system.

[0056] The third keyword corresponding to the important navigation notice announcement includes at least the following three keywords: important navigation notice announcement flow, important navigation notice announcement related agreement signing with the operation department and execution conditions, and types, ways and frequencies of announcements reported to the army by the civil-military airport.

[0057] The third keyword corresponding to the aviation data and aviation map providing conditions includes at least the following four keywords: international and domestic aviation data checking ways, external data interpretation service providing conditions, aviation data and aviation map types provided, and aviation data and aviation map providing ways.

[0058] The third keyword corresponding to the aviation data and aviation map maintenance and management intelligence service includes at least the following two keywords: data updating and maintaining flow and account record, and sensitive data management.

[0059] The third keyword corresponding to the aviation data management system includes at least the following four keywords: data management system, aviation intelligence service product storage and destruction flow, civil-military airport sensitive data and management system, and domestic aviation data paperless work flow (including data ordering, etc., whether there is a related work flow).

[0060] In the embodiment of the present application, the third keyword corresponding to the aviation intelligence service related data management and supply can be shown in Table 6 as follows:

[0061] Table 6

[0062]

[0063]

[0064] Further, the third keywords corresponding to the operation guarantee of the air intelligence service at least include the following keywords: whether the third party system maintenance personnel of the civil aviation navigation management system exist in the intelligence department, whether the civil aviation navigation management system has a backup mechanism, the number of faults of the civil aviation navigation management system within a preset time period, whether there is a main database backup file, whether there is a secondary personalized database, a civil aviation navigation management system static data modification method, a server quantity, a server service life, and whether the software system related to the intelligence work (excluding the production system such as the civil aviation navigation management system).

[0065] Further, the third keywords corresponding to the operation guarantee of the air intelligence service at least include the following keywords: whether the third party system maintenance personnel of the civil aviation navigation management system exist in the intelligence department, whether the civil aviation navigation management system has a backup mechanism, the number of faults of the civil aviation navigation management system within a preset time period, whether there is a main database backup file, whether there is a secondary personalized database, a civil aviation navigation management system static data modification method, a server quantity, a server service life, and whether the software system related to the intelligence work (excluding the production system such as the civil aviation navigation management system).

[0066] The third keywords corresponding to the network situation of the air intelligence at least include the following keywords: a network equipment fault frequency in a preset time period, a currently used and standby communication link, and whether the service is provided externally.

[0067] The third keywords corresponding to the personnel situation of the air intelligence at least include the following keywords: whether a special person is engaged in the original data reporting work, whether the civil aviation navigation management system administrator is equipped with the ability required, whether the civil aviation navigation management system administrator has the basic knowledge of network and information security, whether the annual training plan is formulated, and whether the annual training is carried out.

[0068] The third keywords corresponding to the emergency management of the air intelligence at least include the following keywords: an emergency equipment use time, whether the administrator or the intelligence personnel has the ability to use the emergency system, and whether the database has a disaster recovery plan (fire, earthquake, etc.).

[0069] The third keywords corresponding to the operation guarantee system of the air intelligence at least include the following keywords: a clear air intelligence service training system and a clear civil aviation navigation management system daily maintenance inspection process.

[0070] In the implementation of the present application, the preset time period can be set based on actual needs. In an illustrative embodiment, the preset time period is 5 years.

[0071] In the embodiment of the present application, the third keywords corresponding to the operation guarantee of the air intelligence service can be shown in Table 7 as follows:

[0072] Table 7

[0073]

[0074]

[0075]

[0076] Further, in the embodiments of the present application, the method can comprise the following steps:

[0077] S100, obtaining current text information to be processed as current text information to be processed; the text information comprises description information of a keyword corresponding to each leaf node in a third leaf node layer.

[0078] In the embodiments of the present application, the description information of the keyword is determined based on a corresponding value rule, for example, for the keyword "time requirement of original material notification sheet", the description information can be "there is a time requirement, and 24 hours in advance is provided according to the regulation requirement".

[0079] In the embodiments of the present application, the current text information to be processed can be obtained based on the aviation intelligence business data of the corresponding airport.

[0080] S200, based on the obtained current text information to be processed and the node value rule table, obtaining the value corresponding to each keyword in the current text information to be processed as the value of the corresponding third leaf node; obtaining the third leaf node value set.

[0081] S300, based on the third leaf node value set, the second node association relationship record table and the node weight record table, obtaining the value corresponding to each second leaf node, obtaining the second leaf node value set.

[0082] Specifically, the value of each second leaf node is equal to the sum of the product of the values and weights of all associated third leaf nodes.

[0083] S400, based on the second leaf node value set, the first node association relationship record table and the node weight record table, obtaining the value corresponding to each first leaf node, obtaining the first leaf node value set.

[0084] Specifically, the value of each first leaf node is equal to the sum of the product of the values and weights of all associated second leaf nodes.

[0085] S500, based on the first leaf node value set and the node weight record table, obtaining the value of the root node as the state value corresponding to the current text information to be processed.

[0086] Specifically, the value of the root node is equal to the sum of the products of the values of all first leaf nodes and weights.

[0087] In the embodiment of the present application, the state value corresponding to the current text information to be processed is used to represent the state of the aeronautical information service of the airport corresponding to the current text information to be processed. The greater the state value is, the better the corresponding aeronautical information service state is, that is, the stronger the aeronautical service continuity service capability is, and vice versa.

[0088] Further, in the embodiment of the present application, the node weight record table is obtained by the following steps:

[0089] S10, obtaining the initial weight of each leaf node in the first leaf node layer, the second leaf node layer and the third leaf node layer of the tree structure model based on a preset weight obtaining method.

[0090] In the embodiment of the present application, the preset weight obtaining method can be an existing weight obtaining method, for example, a network analytic hierarchy process, a fuzzy evaluation method, a roughness method, etc., and preferably, can be a network analytic hierarchy process.

[0091] As known by those skilled in the art, any method for obtaining the initial weight of each leaf node in the first leaf node layer, the second leaf node layer and the third leaf node layer of the tree structure model based on a preset weight obtaining method belongs to the protection scope of the present application.

[0092] S11, for the i-th leaf node in the first leaf node layer, if (w1 i -w1 i T )>w0, adjusting the initial weights of all lower nodes of the i-th leaf node based on w1 i to obtain the adjusted weight of each leaf node in the second leaf node layer; wherein w1 i is the initial weight of the i-th leaf node, w1 i T is the sum of the weights of all lower nodes of the i-th leaf node; and w0 is a preset weight error value.

[0093] In the embodiment of the present application, w0 can be a set value, for example, can be k times of w1 i , 0

[0094] S12, for the j-th leaf node in the second leaf node layer, if (w2 j -w2 j T ))>w0, adjusting the initial weights of all lower nodes of the j-th leaf node based on w2 j ; wherein w2 jw2 j T w2

[0095] S13, generating the node weight record table based on the initial weight of the first leaf node, the adjusted weight of the second leaf node and the adjusted weight of the third leaf node.

[0096] In the embodiment of the present application, if the weight of a certain leaf node and the sum of the weights of its lower leaf nodes differ greatly, it indicates that the weights of the lower leaf nodes may have errors caused by subjective reasons, and need to be adjusted to reduce the errors caused by subjective reasons as much as possible.

[0097] Further, in one illustrative embodiment, in S11, the initial weight w1 ih The adjustment is made in the following way:

[0098] w1 ih1 A = w1 ih1 + (w1 i -w1 i T ) / f(i);

[0099] wherein w1 ih A is the adjusted weight of the h1th lower node of the ith leaf node, and h1 takes a value from 1 to f(i), and f(i) is the number of lower leaf nodes of the ith leaf node.

[0100] In S12, the initial weight w2 ih2 The adjustment is made in the following way:

[0101] W2 ih2 A = w2 ih2 + (w2 i -w2 j T ) / g(j);

[0102] wherein W2 ih2 A is the adjusted weight of the h2th lower node of the jth leaf node, and h2 takes a value from 1 to g(j), and g(j) is the number of lower leaf nodes of the jth leaf node.

[0103] Further, in another illustrative embodiment, in S11, the initial weight w1 ihThe adjustment is performed in the following manner:

[0104] w1 ih1 A = w1 ih1 + (w1 i - w1 i T )(w1 ih1 / ∑ f(i) r1＝1 w1 ir1 );

[0105] wherein w1 ih A is the adjustment weight of the h1th lower node of the ith leaf node, and h1 takes a value from 1 to f(i), f(i) being the number of lower leaf nodes of the ith leaf node, w1 ir is the initial weight of the r1th lower node of the ith leaf node, and r1 takes a value from 1 to f(i).

[0106] In S12, the initial weight w2 ih2 of the h2th lower node of the jth leaf node is adjusted in the following manner:

[0107] w2 ih2 A = w2 ih2 + (w2 i - w2 j T )(w2 ih2 / ∑ g(j) r2＝1 w2 jr2 );

[0108] wherein w2 ih2 A is the adjustment weight of the h2th lower node of the jth leaf node, and h2 takes a value from 1 to g(j), g(j) being the number of lower leaf nodes of the jth leaf node, w2 jr2 is the initial weight of the r2th lower node of the jth leaf node, and r2 takes a value from 1 to g(j).

[0109] In this embodiment, since the initial weight is adjusted by considering the weight of the lower leaf node, the adjustment weight can be more accurate.

[0110] Further, in the embodiment of the present application, the method further comprises the following steps:

[0111] S600, comparing the state value corresponding to the current to-be-processed text information with the corresponding target state value, and outputting prompt information and state value optimization text information if the comparison result indicates that the state value corresponding to the current to-be-processed text information is less than the corresponding target state value.

[0112] In the embodiment of the present application, the target state value can be an empirical value, for example, a state value determined by an expert according to experience. The prompt information can be information indicating that the current state value is abnormal. The state value optimization text information includes optimization information for improving the state value corresponding to the current to-be-processed text information, which can be generated based on actual conditions. For example, the state value corresponding to a certain text information is 0.39366, and the corresponding target state value is 0.4. The corresponding state value optimization text information can be generated in combination with the obtained values of each leaf node and expert experience.

[0113] Further, in the embodiment of the present application, the method further includes the following steps:

[0114] S700, generating a tree structure corresponding to the current to-be-processed text information based on the values of each node obtained from the current to-be-processed text information, and visualizing the tree structure in a 3D form, wherein each node of the tree structure is displayed in a sphere, and a descriptor and a value of the corresponding node are arranged on the outer surface of each sphere.

[0115] In the embodiment of the present application, the radius of the sphere corresponding to the root node is greater than the radius of the sphere corresponding to the first leaf node, the radius of the sphere corresponding to the first leaf node is greater than the radius of the sphere corresponding to the second leaf node, and the radius of the sphere corresponding to the second leaf node is greater than the radius of the sphere corresponding to the third leaf node.

[0116] Further, in the embodiment of the present application, the processor is further used to execute a computer program to implement the following steps:

[0117] S800, in response to detecting that any sphere is clicked, visualizing the associated sphere corresponding to the sphere, for example, displaying the associated sphere in a set color and presenting the corresponding descriptor and value in a table form.

[0118] In the embodiment of the present application, the tree structure corresponding to the current to-be-processed text information is visualized in a 3D form, which can improve user experience.

[0119] It should be understood that the various forms of flow shown above can be reordered, added or deleted steps. For example, the steps described in the present application can be executed in parallel, sequentially or in different order, as long as the desired results of the technical solutions disclosed in the present application can be achieved, which is not limited herein.

[0120] The above detailed description does not limit the scope of the application. Various modifications, combinations, sub-combinations and alternatives can be made to the detailed embodiment within the scope of the application. Any modification, equivalent replacement and improvement made without departing from the spirit and principle of the application shall fall within the scope of the application.

Claims

1. A data processing method for an aeronautical information service state, characterized in that, The method is realized based on a tree structure model and a node information table, the tree structure model comprises a root node, a first leaf node layer, a second leaf node layer and a third leaf node layer, wherein a descriptor of the root node represents an aeronautical information service state, a descriptor of each first leaf node in the first leaf node layer represents a corresponding first keyword, a descriptor of each second leaf node in the second leaf node layer represents a corresponding second keyword, a descriptor of each third leaf node in the third leaf node layer represents a corresponding third keyword, and the first keyword, the second keyword and the third keyword are all keywords associated with the aeronautical information service state; the node information table comprises a first node association relationship record table, a second node association relationship record table, a node weight record table and a node value rule table, an ith row of the first node association relationship record table comprises (Nd1 i , NS1 i ), Nd1 i is a descriptor corresponding to an ith first leaf node, NS1 i is a lower node set of the ith first leaf node, i takes a value from 1 to n1, and n1 is the number of the first leaf nodes; a jth row of the second node association relationship record table comprises (Nd2 j , NS2 j ), Nd2 j is a descriptor corresponding to a jth second leaf node, NS2 j is a lower node set of the jth second leaf node, j takes a value from 1 to n2, and n2 is the number of the second leaf nodes; the node weight record table is used for recording a descriptor of each leaf node and a corresponding weight, and the node value rule table comprises a descriptor of each leaf node in the third leaf node layer and a corresponding value rule; and the method comprises the following steps: S100, obtaining current text information to be processed as current text information to be processed, wherein the text information comprises description information of keywords corresponding to each leaf node in the third leaf node layer; S200, obtaining a value corresponding to each keyword in the current text information to be processed based on the obtained current text information to be processed and the node value rule table, as a value of the corresponding third leaf node, and obtaining a third leaf node value set; S300, obtaining a value corresponding to each second leaf node based on the third leaf node value set, the second node association relationship record table and the node weight record table, and obtaining a second leaf node value set; S400, obtaining a value corresponding to each first leaf node based on the second leaf node value set, the first node association relationship record table and the node weight record table, and obtaining a first leaf node value set; S500, obtaining a value of the root node based on the first leaf node value set and the node weight record table as a state value corresponding to the current text information to be processed; The node weight record table is obtained by the following steps: S10, obtaining an initial weight of each leaf node in the first leaf node layer, the second leaf node layer and the third leaf node layer in the tree structure model based on a preset weight obtaining method; S11, for the i-th leaf node in the first leaf node layer, if (w1 i -w1 i T ) > w0, adjust the initial weights of all lower nodes of the i-th leaf node based on w1 i ; obtain the adjusted weights of each leaf node in the second leaf node layer; wherein w1 i is the initial weight of the i-th leaf node, w1 i T is the sum of the weights of all lower nodes of the i-th leaf node; and w0 is a preset weight error value. S12, for the jth leaf node in the second leaf node layer, if (w2 j -w2 j T ) > w0, adjust the initial weights of all lower nodes of the jth leaf node based on w2 j ; wherein w2 j is the adjustment weight of the jth leaf node, w2 j T is the sum of the weights of all lower nodes of the jth leaf node. S13, generating the node weight record table based on the initial weight of the first leaf node, the adjustment weight of the second leaf node and the adjustment weight of the third leaf node; In S11, the initial weight w1 of the h1th lower node of the ith leaf node ih1 The adjustment is made by w1 ih1 A =w1 ih1 +(w1 i -w1 i T ) / f(i); wherein w1 ih1 A is the adjustment weight of the h1th child node of the ith leaf node, h1 has a value of 1 to f(i), and f(i) is the number of child leaf nodes of the ith leaf node. In S12, the initial weight w2 of the h2th lower node of the jth leaf node jh2 The adjustment is made in the following way: W2 jh2 A = w2 jh2 + (w2 j - w2 j T ) / g (j); wherein W2 jh2 A is the adjustment weight of the h2th child node of the jth leaf node, h2 is valued from 1 to g(j), and g(j) is the number of child leaf nodes of the jth leaf node. Or, In S11, the initial weight w1 of the h1th lower node of the ith leaf node ih1 The adjustment is made in the following way: ; wherein w1 ih1 A is the adjustment weight of the h1th child node of the ith leaf node, h1 has a value of 1 to f(i), f(i) is the number of child leaf nodes of the ith leaf node, w1 ir1 is the initial weight of the r1th child node of the ith leaf node, r1 has a value of 1 to f(i). In S12, the initial weight w2 of the h2th lower node of the jth leaf node jh2 The adjustment is made by: ; wherein W2 jh2 A is the adjustment weight of the h2th child node of the jth leaf node, h2 is valued from 1 to g(j), g(j) is the number of child leaf nodes of the jth leaf node, w2 jr2 is the initial weight of the r2th child node of the jth leaf node, r2 is valued from 1 to g(j).

2. The method of claim 1, wherein, The method further comprises the following steps: S600, comparing the state value corresponding to the current text information to be processed with the corresponding target state value, and if the comparison result indicates that the state value corresponding to the current text information to be processed is less than the corresponding target state value, outputting prompt information and state value optimization text information corresponding thereto.

3. The method of claim 1, wherein, The method further comprises the following steps: S700, generating a tree structure corresponding to the current text information to be processed based on the values of the nodes obtained based on the current text information to be processed, and visually displaying the tree structure in a 3D form, wherein each node of the tree structure is displayed in a sphere, and a descriptor and a value corresponding to the node are arranged on the outer surface of each sphere.

4. The method of claim 3, wherein, Wherein, The radius of the sphere corresponding to the root node is greater than the radius of the sphere corresponding to the first leaf node, the radius of the sphere corresponding to the first leaf node is greater than the radius of the sphere corresponding to the second leaf node, and the radius of the sphere corresponding to the second leaf node is greater than the radius of the sphere corresponding to the third leaf node.

5. The method of claim 3, wherein, The method further comprises the following steps: S800, in response to detecting a click on any sphere, visually displaying the associated sphere corresponding to the sphere.

Images