Data processing method for aviation intelligence service state

Abstract

The invention provides a data processing method for an aviation intelligence 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, a descriptor of the root node represents the aviation intelligence service state, and a descriptor of the third leaf node layer represents the aviation intelligence service state. The descriptor of each first leaf node in the leaf node layer represents a corresponding keyword, and the keyword is a keyword associated with an aviation intelligence 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 the text information needing to be processed is received, the state value corresponding to the text information can be rapidly obtained, the obtaining speed and accuracy of the aviation intelligence service state can be improved, and then the aviation intelligence service continuity service capability can be rapidly and accurately obtained.

Description

Technical Field

[0001] The invention relates to the field of aviation intelligence, and in particular to a data processing method for aviation intelligence service status. Background Art

[0002] Aeronautical intelligence services are an important part of ensuring the safe operation of air transport methods. In recent years, the aviation industry has faced increasingly complex challenges, with frequent air safety accidents and threats to the safe operation of aircraft. Therefore, the importance of aviation intelligence services has become increasingly prominent. First, the effective implementation of aviation intelligence services helps 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 to pilots and airlines, helping them make correct decisions and reduce accident risks. Secondly, the optimization of aviation intelligence services can improve the efficiency and process of air transport methods. By using advanced technical means, such as artificial intelligence and big data analysis, aviation intelligence can be quickly and accurately processed and analyzed, flight plans and resource allocation can be optimized, the operational efficiency of air transport can be improved, costs can be reduced, delays and cancellations can be reduced, and the satisfaction of passengers and airlines can be improved. In addition, the development of aviation intelligence services has also promoted cooperation and communication with other relevant stakeholders. The aviation intelligence department works closely with relevant parties such as air traffic control departments, airlines, airport management departments, etc. to share information, conduct risk assessments and coordinate actions to ensure the overall safety and reliable operation of aviation methods. Therefore, the status of aeronautical information services is crucial to ensuring the safety, efficiency and sustainability of air transport. Summary of the invention

[0003] In view of the above technical problems, the technical solution adopted by the present invention is:

[0004] An embodiment of the present invention provides a data processing method for aviation information service status. The method is implemented 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 information service status. The descriptor of each first leaf node in the first leaf node layer represents the corresponding first keyword. The descriptor of each second leaf node in the second leaf node layer represents the corresponding second keyword. The descriptor of each third leaf node in the third leaf node layer represents the corresponding third keyword. The first keyword, the second keyword and the third keyword are all keywords associated with the aviation information service status. 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 the descriptor corresponding to the first leaf node of the i-th node, NS1 i is the set of subordinate nodes of the i-th first leaf node, i ranges from 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 the descriptor corresponding to the jth second leaf node, NS2 j is the lower node set of the jth second leaf node, the value of j is 1 to n2, and n2 is the number of second leaf nodes; the node weight record table is used to record the descriptor and corresponding weight of each leaf node, and the node value rule table includes the descriptor and corresponding value rule of each leaf node in the third leaf node layer; the processor is used to execute the computer program to implement the following steps:

[0005] S100, obtaining text information that currently needs to be processed as the current text information to be processed; the text information includes description information of keywords 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, obtain the value corresponding to each keyword in the current text information to be processed as the value of the corresponding third leaf node; obtain 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, obtain the value corresponding to each second leaf node to obtain 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, obtain the value corresponding to each first leaf node to obtain the first leaf node value set.

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

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

[0011] The data processing method for aviation intelligence service status provided by the embodiment of the present invention is implemented based on a tree structure model and a node information table constructed with keywords associated with the aviation intelligence service status as nodes. When text information that needs to be processed is received, the status value corresponding to the text information can be quickly obtained, thereby improving the acquisition rate and accuracy of the aviation intelligence service status.

[0012] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0014] Figure 1 The present invention provides a flowchart of a method for processing aviation information service status data. DETAILED DESCRIPTION

[0015] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work 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 those commonly understood by those skilled in the art of the present invention. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more related listed items.

[0017] It should be noted that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but it can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0018] The embodiment of the present invention provides a data processing method for aviation intelligence service status, which is used to obtain the aviation intelligence service status of an airport based on the aviation intelligence service data of the airport. In the embodiment of the present invention, the aviation intelligence service data may include aviation laws and regulations, flight rules, airports, airspaces, routes, flight procedures, communication and navigation facilities, various aviation service procedures and other information and data, as well as charts, etc. In the embodiment of the present invention, the aviation intelligence service status is used to characterize the aviation intelligence service continuity service capability.

[0019] Furthermore, the data processing method of the aviation information service status provided in the embodiment of the present invention can be implemented based on a tree structure model and a node information table, and 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 aviation information service status, the descriptor of each first leaf node in the first leaf node layer represents the corresponding first keyword, the descriptor of each second leaf node in the second leaf node layer represents the corresponding second keyword, and the descriptor of each third leaf node in the third leaf node layer represents the corresponding third keyword. The first keyword, the second keyword and the third keyword are all keywords associated with the aviation information service status. 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 the descriptor corresponding to the first leaf node of the i-th node, NS1 i is the set of subordinate nodes of the i-th first leaf node, i ranges from 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 the descriptor corresponding to the jth second leaf node, NS2 j is the set of lower nodes of the jth second leaf node, the value of j is 1 to n2, and n2 is the number of second leaf nodes; the node weight record table is used to record the descriptor and corresponding weight of each leaf node, and the node value rule table includes the descriptor and corresponding value rule of each leaf node in the third leaf node layer.

[0021] In the embodiment of the present invention, the lower nodes of each leaf node are not repeated. The first keyword, the second keyword and the third keyword can be obtained by experts referring to relevant laws and regulations and investigating the actual aviation intelligence business capabilities of small and medium-sized airports. The value selection rules can be determined based on actual conditions and experts. In the embodiment of the present invention, 5 first keywords, 19 second keywords and 80 third keywords can be included.

[0022] Furthermore, in an embodiment of the present invention, the first keyword includes the following keywords: aviation original data notification, navigation notice, aviation information service, management and supply of aviation intelligence business related data, and operation guarantee of aviation intelligence business.

[0023] Furthermore, the second keywords corresponding to the aviation original data notification form include at least the following keywords: acceptance and review of the aviation original data notification form, verification, editing and reporting of the aviation original data notification form, and management system of the aviation original data notification form.

[0024] The third keyword corresponding to the acceptance and review of the aviation original data notification form may include the following 7 keywords: time requirements for the original data notification form, verification of consistency between the original materials and supporting materials when reviewing the aviation original data notification form, the handling process when the original data notification form has content errors or disputes when notifying the navigation, the handling process when the original data notification form has content errors or disputes when reporting, the progress of case analysis of common errors in the original data notification form, auxiliary means for the review of the original data notification form and the monitoring of duplicate notifications, and the archiving and recording forms of the original data notification form.

[0025] In the embodiment of the present invention, the supporting materials are materials approved by the competent authority.

[0026] The value rules for the third keyword corresponding to the acceptance and review of the aviation original data notification form can be shown in the following Table 1:

[0027] Table 1

[0028]

[0029]

[0030] Furthermore, the third keywords corresponding to the verification, editing and reporting of the aviation original data notification form include at least the following 7 keywords: original data reporting workflow, relevant regulations for reviewing and reporting original data, whether there is a classification and grading processing mechanism for sensitive data (including hierarchical classification management requirements for data information, for reported original data, equipment passwords, user information, etc.), whether the reporting time of major aviation intelligence data change plan is clear, implementation of major aviation intelligence data change plan, the situation of releasing materials for construction with complex content and longer term without stopping flights, and original data reporting tracking and issuance and proofreading process.

[0031] The value rules of the third keyword corresponding to the verification, editing and reporting of the aviation original data notification form are shown in Table 2 below:

[0032] Table 2

[0033]

[0034] Furthermore, the third keywords corresponding to the management system of the aviation original data notification form include at least the following 10 keywords: whether an original data provision agreement is signed with the aviation intelligence original data providing department or unit, whether the responsibilities and requirements of both parties are clear and the agreement is regularly updated, whether the original data providing department or unit designates an agency or a person to be responsible for providing aviation intelligence original data to the aviation intelligence service agency, and maintains direct and fixed contact with the aviation intelligence service agency, whether the "Aviation Intelligence Original Data Notice Form" is archived as a formal record for future reference, whether a regular coordination and regular training mechanism should be established with the aviation intelligence original data providing department or unit, whether a regular data compliance inspection mechanism is established and a comprehensive inspection and verification of the released data is conducted, whether a review mechanism for aviation data and aviation intelligence original data is established and the adoption of aviation intelligence original data is fed back to the aviation intelligence original data providing department or unit, a quarterly report is submitted to the regional administration on the situation where the original data provision time limit for non-stop construction and planned routine maintenance does not meet the requirements of regulations and specifications, the situation of participating in the coordination meeting of the original data providing department, and whether a verification and validation procedure for the original data notification form is established.

[0035] The value selection rules for the third keyword corresponding to the management system of the aviation original data notification form can be shown in the following Table 3:

[0036] Table 3

[0037]

[0038] Furthermore, the second keywords corresponding to the NOTAM include at least the following keywords: distribution of NOTAM, acceptance and processing of NOTAM, and NOTAM management system.

[0039] Among them, the third keywords corresponding to the distribution of the navigation notice include at least the following keywords: the deviation between the issuance of the navigation notice and the snow notice, the average time from the receipt of the original data notification to the issuance of the navigation notice, and whether there are auxiliary means for issuing the navigation notice.

[0040] The third keywords corresponding to the acceptance and processing of the navigation notice include at least the following keywords: whether to check the continuity and completeness of the navigation notices in the collection area, the frequency and frequency of receiving and processing navigation notices within a day, and whether there are auxiliary means for receiving and processing navigation notices (such as reminding that there are duplicate navigation notices and format errors in the library).

[0041] The third keyword corresponding to the navigation notice management system includes at least the following keywords: clear workflow and standards for issuing navigation notices and snow notices, clear workflow and standards for receiving, processing and storing navigation notices, snow notices, volcano notices and official reports, whether there are clear workflow and standards for verifying navigation notices, clear procedures for handling deviations when sending navigation notices and snow notices (correction methods, records, review and analysis, etc.), clear workflow for formulating abnormal situations during the issuance process (such as navigation notices and snow notices not jumping normally, alarms, etc.), and whether an inspection system has been established for the issuance, receipt, processing and notification of navigation notices.

[0042] In the embodiment of the present invention, the value selection rule of the third keyword corresponding to the NOTAM may be as shown in Table 4 below:

[0043] Table 4

[0044]

[0045]

[0046] Furthermore, the second keywords corresponding to the aviation intelligence service include at least the following keywords: pre-flight aviation situation service, post-flight aviation information service, other services and aviation intelligence service management system.

[0047] In the embodiment of the present invention, other services refer to services other than the pre-flight aviation situation service and the post-flight aviation information service.

[0048] In an embodiment of the present invention, the third keyword corresponding to the pre-flight aviation situation service includes at least the following three keywords: whether there is a long-term and stable demand for pre-flight aviation information service provision, whether pre-flight information bulletins are provided, and the provision of explanation service information query services.

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

[0050] The third keywords corresponding to the other services include at least the following two keywords: whether there is a long-term and stable demand for provision of other services, and the provision status of other services.

[0051] The third keywords corresponding to the aviation information service management system include at least the following keywords: clear pre-flight aviation information service provision workflow (such as pre-flight information announcements, explanation services, information inquiries, etc.), clear post-flight aviation information service provision workflow, and clear other service provision workflows.

[0052] Furthermore, the value selection rules of the third keyword corresponding to the aviation intelligence service are shown in Table 5 below:

[0053] Table 5

[0054]

[0055] Furthermore, the second keywords corresponding to the management and supply of aviation intelligence business-related information include at least the following keywords: notification of important navigation notices, provision of aviation information and aviation maps, maintenance and management intelligence services of aviation information and aviation maps, and aviation information management system.

[0056] Among them, the third keyword corresponding to the notification of the important navigation notice includes at least the following three keywords: the notification process of the important navigation notice, the relevant agreement signed with the operating department on the notification of the important navigation notice and its implementation status, and the types, methods and frequencies of notifications from civil-military airports to the troops.

[0057] The third keywords corresponding to the provision of aviation information and aviation maps include at least the following four keywords: methods of consulting international and domestic aviation information, the situation of providing information explanation services to the outside world, types of aviation information and aviation maps provided, and methods of providing aviation information and aviation maps.

[0058] The third keyword corresponding to the maintenance and management intelligence service of the aviation information and aviation maps includes at least the following two keywords: data update maintenance process and ledger records, and management of sensitive information.

[0059] The third keyword corresponding to the aviation information management system includes at least the following four keywords: information management system, storage and destruction process of aviation intelligence service products, sensitive information and management system of joint military and civil airports, and the work flow of domestic aviation information after paperless operation (including information ordering, etc., whether there is relevant work flow).

[0060] In the embodiment of the present invention, the value selection rules of the third keyword corresponding to the management and supply of the aviation intelligence service related information can be as shown in the following Table 6:

[0061] Table 6

[0062]

[0063]

[0064] Furthermore, the second keywords corresponding to the operational support of the aviation intelligence service include at least the following keywords: aviation intelligence automation system, network conditions corresponding to aviation intelligence, personnel conditions corresponding to aviation intelligence, emergency management corresponding to aviation intelligence, and operational support system corresponding to aviation intelligence.

[0065] Furthermore, the third keywords corresponding to the aviation intelligence automation system include at least the following keywords: whether the intelligence department has third-party system maintenance personnel for the civil aviation navigation management system, whether the civil aviation navigation management system has a backup mechanism, the number of failures of the civil aviation navigation management system within a preset time period, whether there are backup files for the main database, whether there are secondary personalized databases, the method for modifying static data in the civil aviation navigation management system, the number of servers, the service life of the servers, and whether it is a software system related to intelligence work (excluding production systems such as civil aviation navigation management).

[0066] The third keywords corresponding to the network situation corresponding to the aviation intelligence include at least the following keywords: the frequency of network equipment failures in a preset time period, the communication links currently in use and in standby, and whether services are provided externally.

[0067] The third keywords corresponding to the personnel situation corresponding to the aviation intelligence include at least the following keywords: whether there is a dedicated person to engage in the reporting of original data, whether there is a civil aviation navigation management system administrator who meets the capability requirements, whether the civil aviation navigation management system administrator has basic knowledge of network and information security, the status of formulating annual training plans, and the status of annual training implementation.

[0068] The third keyword corresponding to the emergency management corresponding to the aviation intelligence includes at least the following keywords: the activation time of the emergency equipment, whether the system administrator or intelligence officer has the ability to activate the emergency system, and whether the database has a disaster recovery plan (fire, earthquake, etc.).

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

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

[0071] In the embodiment of the present invention, the third keyword corresponding to the operation guarantee of the aviation intelligence service may be as shown in Table 7 below:

[0072] Table 7

[0073]

[0074]

[0075]

[0076] Furthermore, in an embodiment of the present invention, the method may include the following steps:

[0077] S100, obtaining text information that currently needs to be processed as the current text information to be processed; the text information includes description information of keywords corresponding to each leaf node in the third leaf node layer.

[0078] In an embodiment of the present invention, the description information of the keyword is determined based on the corresponding value-taking rules. For example, for the keyword "time requirement for original document notification form", its description information may be "there is a time requirement, which must be provided 24 hours in advance in accordance with regulations."

[0079] In the embodiment of the present invention, the text information currently to be processed may be obtained based on aviation intelligence service data of the corresponding airport.

[0080] S200, based on the obtained current text information to be processed and the node value rule table, obtain the value corresponding to each keyword in the current text information to be processed as the value of the corresponding third leaf node; obtain 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, obtain the value corresponding to each second leaf node to obtain the second leaf node value set.

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

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

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

[0085] S500, based on the first leaf node value set and the node weight record table, obtain 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 the weights.

[0087] In an embodiment of the present invention, the status value corresponding to the current text information to be processed is used to characterize the aviation information service status of the airport corresponding to the current text information to be processed. The larger the status value, the better the corresponding aviation information service status, that is, the stronger the aviation business continuity service capability, and vice versa.

[0088] Furthermore, in an embodiment of the present invention, the node weight record table is obtained by the following steps:

[0089] S10, respectively 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 in the tree structure model based on a preset weight obtaining method.

[0090] In the embodiment of the present invention, the preset weight acquisition method may be an existing weight acquisition method, such as a network hierarchy analysis method, a fuzzy evaluation method, a roughness method, etc. Preferably, it may be a network hierarchy analysis method.

[0091] Those skilled in the art are aware that 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 in the tree structure model based on a preset weight acquisition method falls within the scope of protection of the present invention.

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

[0093] In the embodiment of the present invention, w0 may be a set value, for example, w1 i k times of , 0<k<0.1.

[0094] S12, for the j-th leaf node in the second leaf node layer, if (w2 j -w2 j T ))>w0, based on w2 j Adjust the initial weights of all subordinate nodes of the jth leaf node; where w2 jis the adjustment weight of the j-th leaf node, w2 j T is the sum of the weights of all subordinate nodes of the j-th leaf node.

[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 an embodiment of the present invention, if the weight of a leaf node differs greatly from the sum of the weights of its lower leaf nodes, it indicates that the weights of the lower leaf nodes may have errors due to subjective reasons and need to be adjusted to minimize the errors caused by subjective reasons.

[0097] Further, in an exemplary embodiment, in S11, the initial weight w1 of the h1th subordinate node of the i-th leaf node is ih Adjust by:

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

[0099] Among them, w1 ih A is the adjusted weight of the h1th subordinate node of the i-th leaf node, and the value of h1 ranges from 1 to f(i), where f(i) is the number of subordinate leaf nodes of the i-th leaf node.

[0100] In S12, the initial weight w2 of the h2th subordinate node of the jth leaf node ih2 Adjust by:

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

[0102] Among them, W2 ih2 A is the adjusted weight of the h2th subordinate node of the jth leaf node, and the value of h2 ranges from 1 to g(j), where g(j) is the number of subordinate leaf nodes of the jth leaf node.

[0103] Further, in another exemplary embodiment, in S11, the initial weight w1 of the h1th subordinate node of the i-th leaf node is ihAdjust by:

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

[0105] Among them, w1 ih A is the adjusted weight of the h1th subordinate node of the i-th leaf node, the value of h1 ranges from 1 to f(i), f(i) is the number of subordinate leaf nodes of the i-th leaf node, w1 ir is the initial weight of the r1th subordinate node of the i-th leaf node, and the value of r1 ranges from 1 to f(i).

[0106] In S12, the initial weight w2 of the h2th subordinate node of the jth leaf node ih2 Adjust by:

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

[0108] Among them, W2 ih2 A is the adjusted weight of the h2th subordinate node of the jth leaf node, and the value of h2 ranges from 1 to g(j), where g(j) is the number of subordinate leaf nodes of the jth leaf node, and w2 jr2 is the initial weight of the r2th subordinate node of the jth leaf node, and the value of r2 ranges from 1 to g(j).

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

[0110] Furthermore, in an embodiment of the present invention, the method further includes the following steps:

[0111] S600, comparing the state value corresponding to the current text information to be processed with the corresponding target state value, 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 corresponding state value optimization text information.

[0112] In an embodiment of the present invention, the target state value may be an empirical value, such as a state value determined by an expert based on experience. The prompt information may 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 text information to be processed, which may be generated based on actual conditions. For example, the state value corresponding to a certain text information is 0.39366, and its corresponding target state value is 0.4. The corresponding state value optimization text information may be generated by combining the values ​​of each leaf node obtained and the expert experience.

[0113] Furthermore, in an embodiment of the present invention, the method further includes the following steps:

[0114] S700, based on the values ​​of each node obtained from the current text information to be processed, a tree structure corresponding to the current text information to be processed is generated, and visualized in 3D form, wherein each node of the tree structure is displayed as a sphere, and the outer surface of each sphere is provided with a descriptor and value of the corresponding node.

[0115] In an embodiment of the present invention, 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] Furthermore, in the embodiment of the present invention, the processor is further configured to execute a computer program to implement the following steps:

[0117] S800, in response to detecting a click on any sphere, visually displaying 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 invention, the tree structure corresponding to the current text information to be processed is visualized in 3D form, which can improve the user experience.

[0119] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution disclosed in the present invention can be achieved, and this document does not limit this.

[0120] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for processing data of aviation information service status, characterized in that: The method is implemented 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, wherein the descriptor of the root node represents the aviation information service state, the descriptor of each first leaf node in the first leaf node layer represents the corresponding first keyword, the descriptor of each second leaf node in the second leaf node layer represents the corresponding second keyword, and the descriptor of each third leaf node in the third leaf node layer represents the corresponding third keyword, and the first keyword, the second keyword and the third keyword are all keywords associated with the aviation 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, and the i-th row of the first node association relationship record table includes (Nd1 i , NS1 i ), Nd1 i is the descriptor corresponding to the first leaf node of the i-th node, NS1 i is the set of subordinate nodes of the i-th first leaf node, i ranges from 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 the descriptor corresponding to the jth second leaf node, NS2 j is the lower node set of the jth second leaf node, the value of j ranges from 1 to n2, and n2 is the number of second leaf nodes; the node weight record table is used to record the descriptor and corresponding weight of each leaf node, and the node value rule table includes the descriptor and corresponding value rule of each leaf node in the third leaf node layer; the method includes the following steps: S100, obtaining text information that needs to be processed currently as the current text information to be processed; the text information includes description information of keywords corresponding to each leaf node in the third leaf node layer; S200, based on the obtained current text information to be processed and the node value rule table, obtain the value corresponding to each keyword in the current text information to be processed as the value of the corresponding third leaf node; obtain the third leaf node value set; 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 to obtain the second leaf node value set; 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 to obtain the first leaf node value set; S500, based on the first leaf node value set and the node weight record table, obtain the value of the root node as the state value corresponding to the current text information to be processed.

2. The method according to claim 1, characterized in that The node weight record table is obtained by the following steps: S10, respectively 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 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, based on w1 i Adjust the initial weights of all subordinate nodes of the i-th leaf node; Get the adjusted weight of each leaf node in the second leaf node layer; where w1 i is the initial weight of the i-th leaf node, w1 i T is the sum of the weights of all subordinate nodes of the i-th leaf node; w0 is the preset weight error value; S12, for the j-th leaf node in the second leaf node layer, if (w2 j -w2 j T ))>w0, based on w2 j Adjust the initial weights of all subordinate nodes of the jth leaf node; where w2 j is the adjustment weight of the j-th leaf node, w2 j T is the sum of the weights of all subordinate nodes of the j-th leaf node; 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.

3. The method according to claim 2, characterized in that In S11, the initial weight w1 of the h1th subordinate node of the i-th leaf node ih Adjust by: w1 ih1 A =w1 ih1 +(w1 i -w1 i T ) / f(i); Among them, w1 ih A is the adjusted weight of the h1th subordinate node of the i-th leaf node, the value of h1 is 1 to f(i), and f(i) is the number of subordinate leaf nodes of the i-th leaf node; In S12, the initial weight w2 of the h2th subordinate node of the jth leaf node ih2 Adjust by: W2 ih2 A =w2 ih2 +(w2 i -w2 j T ) / g(j); Among them, W2 ih2 A is the adjusted weight of the h2th subordinate node of the jth leaf node, and the value of h2 ranges from 1 to g(j), where g(j) is the number of subordinate leaf nodes of the jth leaf node.

4. The method according to claim 2, characterized in that: In S11, the initial weight w1 of the h1th subordinate node of the i-th leaf node ih Adjust by: w1 ih1 A =w1 ih1 +(w1 i -w1 i T )(w1 ih1 / ∑ f(i) r1＝1 w1 ir1 ); Among them, w1 ih A is the adjusted weight of the h1th subordinate node of the i-th leaf node, the value of h1 ranges from 1 to f(i), f(i) is the number of subordinate leaf nodes of the i-th leaf node, w1 ir is the initial weight of the r1th subordinate node of the i-th leaf node, and the value of r1 ranges from 1 to f(i); In S12, the initial weight w2 of the h2th subordinate node of the jth leaf node ih2 Adjust by: W2 ih2 A =w2 ih2 +(w2 i -w2 j T )(w2 ih2 / ∑ g(j) r2＝1 w2 jr2 ); Among them, W2 ih2 A is the adjusted weight of the h2th subordinate node of the jth leaf node, and the value of h2 ranges from 1 to g(j), where g(j) is the number of subordinate leaf nodes of the jth leaf node, and w2 jr2 is the initial weight of the r2th subordinate node of the jth leaf node, and the value of r2 ranges from 1 to g(j).

5. The method according to claim 1, characterized in that The method further comprises the steps of: S600, comparing the state value corresponding to the current text information to be processed with the corresponding target state value, 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 corresponding state value optimization text information.

6. The method according to claim 1, characterized in that The method further comprises the steps of: S700, based on the values ​​of each node obtained from the current text information to be processed, a tree structure corresponding to the current text information to be processed is generated, and visualized in 3D form, wherein each node of the tree structure is displayed as a sphere, and the outer surface of each sphere is provided with a descriptor and value of the corresponding node.

7. The method according to claim 6, characterized in that in, 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.

8. The method according to claim 6, characterized in that The method further comprises the steps of: S800, in response to detecting a click on any sphere, visually displaying an associated sphere corresponding to the sphere.

Images