Method for generating parameterized interactive graphical process tree for service log data

Abstract

The invention belongs to the technical field of data analysis and process mining, and particularly relates to a method for generating a parameterized interactive graphical process tree for business log data. The method comprises the following steps: firstly, collecting original business log data including database logs, application server logs, user behavior logs and the like, checking the integrity and timestamp accuracy of the original business log data, cleaning and standardizing the data, and extracting key process nodes; secondly, designing a tree data structure based on a DFG graph structure, defining attributes of nodes and connections, mapping data into the DFG structure to accurately represent the relationship between the nodes, and extracting key nodes; and then selecting a proper directed graph layout algorithm, optimizing node distribution, and distinguishing nodes by using visual elements. And finally, designing an interactive feedback system which comprises user interface design, specific service type screening and a real-time updating mechanism, so that the user can conveniently interact with the process tree, deeply analyze the service process and improve the understanding and optimization capability of the service process.

Description

Technical Field

[0001] The present invention belongs to the technical field of data analysis and process mining, and specifically is a method for generating a parameterized interactive graphical process tree for business log data. Background Art

[0002] With the rapid development of information technology, enterprises generate massive amounts of business log data in their daily operations. These data record detailed operational information of each business link of the enterprise, such as user behavior, system events, transaction records, etc., and contain rich business process knowledge. However, the original business log data usually exists in text form and has the following characteristics:

[0003] Large amount of data: Frequent business activities of enterprises lead to rapid growth of log data, which brings huge challenges to data processing and analysis.

[0004] Complex structure: Business log data contains multiple types of information, and the relationships between data are complex and diverse, making it difficult to directly extract valuable business process information from it.

[0005] Disorder: Log data is usually recorded in chronological order and lacks a clear organizational structure, making it difficult for users to fully understand the overall situation of the business process.

[0006] Traditional data analysis methods, such as data mining and statistical analysis, can find some rules and patterns from a large amount of data, but they are not effective in visualizing business processes. These methods can only provide abstract data results and cannot intuitively present the dynamic changes and detailed information of business processes, limiting users' in-depth understanding and optimization capabilities of business processes. Summary of the invention

[0007] In view of the shortcomings of the prior art, the present invention proposes a method for generating a parameterized interactive graphical process tree for business log data. This method can clearly display the various links of the business process, the relationship between nodes, and the execution order of the process through a graphical process tree, helping users to quickly understand the overall picture of the business process and discover potential problems and optimization points. At the same time, through parameterized interactive control, users can flexibly adjust the display content of the process tree according to their needs, deeply analyze the details of the business process, and thus better support the business decision-making of the enterprise.

[0008] The technical solution of the present invention is as follows:

[0009] The method for generating a parameterized interactive graphical process tree for business log data includes:

[0010] Collect raw business log data, clean and standardize it, and extract key process nodes;

[0011] Based on the DFG graph structure, a tree data structure is designed to represent the business process, and the key process nodes are mapped to the DFG structure to achieve accurate representation of the hierarchical relationship and connection between nodes;

[0012] By using the directed graph layout algorithm to process the DFG structure and optimize the process node distribution of the DFG structure, and using visual elements to distinguish different nodes, a parameterized process tree is generated;

[0013] Design interactive feedback systems in parameterized process trees, including user interface design, user input monitoring and verification, and real-time update mechanisms.

[0014] Further, the original business log data includes database logs obtained from the enterprise's database system, application server logs collected from application servers, and user behavior logs collected;

[0015] The original business log data extracts key process nodes by defining identification rules for key process nodes.

[0016] Furthermore, the DFG graph structure design includes defining a node ID, a node name and other attributes for each node, and defining a connection type and a connection weight between nodes.

[0017] Furthermore, the mapping of the process nodes to the DFG structure includes determining the node corresponding to each event according to the event information in the business log data, and adding it to the process tree, as well as determining the connection between the nodes according to the sequence relationship between the events, and setting the type and weight of the connection.

[0018] Furthermore, the selection of the directed graph layout algorithm includes a force-directed algorithm or a grid layout algorithm.

[0019] Furthermore, the node distribution optimization includes optimization based on weight information, node overlap optimization and optimization considering user interaction.

[0020] Furthermore, the visual element differentiation methods include color differentiation, shape differentiation and size differentiation.

[0021] Furthermore, the contents of the user interface design include tree depth and breadth control, node display threshold setting, and specific business type screening.

[0022] Furthermore, the tree depth and breadth control design content includes providing a slider or other interactive methods to allow the user to adjust the display depth and breadth of the process tree;

[0023] The node display threshold setting design content includes allowing the user to set the node display threshold through a numerical input box or other methods;

[0024] The specific business type screening design content provides a business type drop-down menu or other screening methods, allowing users to select a specific business type for display.

[0025] The beneficial effects of the present invention are as follows: 1. Improving the efficiency of business process analysis: This method can convert complex business log data into a parameterized interactive process tree, and help users quickly understand the overall picture of the business process through intuitive graphical display. Users can perform interactive operations on the visual interface, such as adjusting the display parameters of the node, filtering specific time periods and business types, and obtaining the optimized process structure in real time. In this way, the time required for users to understand and analyze the process is greatly reduced, and the efficiency of data analysis is improved.

[0026] 2. Optimize the human-computer interaction experience: Traditional data display methods are mostly tables or static charts. The present invention provides an interactive process tree through real-time dynamic rendering technology, allowing users to view and operate node information directly on the process diagram. Through custom parameter adjustment, users can display key information such as specific frequencies and performance indicators on demand, which enhances the convenience and flexibility of data exploration and provides a more friendly human-computer interaction experience.

[0027] 3. Enhanced visualization insight into business processes: This invention significantly improves the visualization of information through a weight-based directed graph layout algorithm, color and shape style differences. Users can clearly identify key nodes and high-frequency paths in the process and quickly discover bottlenecks or anomalies in the process. The visualized process tree structure not only improves the readability of the data, but also allows users to make business optimization decisions more intuitively.

[0028] 4. Support real-time decision-making and dynamic optimization: Since the process tree structure of the present invention can provide real-time feedback based on the user's interactive input, the user can dynamically adjust the display parameters during the process analysis and view different views of the business process in real time. This function can support decision makers to respond quickly during the process optimization process, adjust business strategies in a timely manner, and meet the company's needs for rapid optimization of business processes.

[0029] 5. Improve the accuracy and flexibility of business log mining: Through the extraction and construction of key process nodes and step information of business logs, the present invention has higher flexibility and accuracy in data model identification and construction, and dynamic update of process tree, making the process mining results closer to actual business operations. The system can accurately display the association, timing and frequency of each node in the process, which helps to more deeply explore the business models and process optimization opportunities hidden in the data. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is the overall flow chart of the present invention;

[0031] Figure 2 is a flowchart of method S100;

[0032] Figure 3 is a flow chart of method S200;

[0033] Figure 4 is a flow chart of method S300;

[0034] Figure 5 is a flow chart of method S400. DETAILED DESCRIPTION

[0035] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0036] See also Figure 1 , which shows a method for generating a parameterized interactive graphical process tree for business log data provided by an embodiment of the present invention, including:

[0037] S100. Collect original business log data, clean and standardize it, and extract key process nodes.

[0038] S200. Based on the DFG (Directly-Follows Graph) graph structure, a tree data structure is designed to represent the business process, and the key process nodes are mapped to the DFG structure to achieve accurate representation of the hierarchical relationship and connection between nodes.

[0039] S300, by adopting the directed graph layout algorithm to process the DFG structure, optimizing the distribution of process nodes of the DFG structure, and using visual elements to distinguish different nodes, a parameterized process tree is generated.

[0040] S400. Design an interactive feedback system in the parameterized process tree, including user interface design, specific business type screening, and real-time update mechanism.

[0041] S100 collects raw business log data from multiple data sources, including database logs, application server logs, and user behavior logs. After collection, it checks data integrity and verifies timestamp accuracy, then cleans and standardizes data, removes duplicate and invalid data, and unifies the format. Finally, it extracts key process nodes based on business process characteristics and requirements.

[0042] Please refer to Figure 2, which shows a flowchart of an exemplary method S100 of the present application for generating a parameterized interactive graphical process tree for business log data, and its contents include:

[0043] S110: Collecting original business log data.

[0044] Obtain logs from a variety of data sources, including database logs from the enterprise's database system, application server logs collected from application servers, and user behavior logs collected.

[0045] The database logs obtained from the enterprise's database system record various database operations, such as data insertion, update, deletion, etc. The application server logs collected from the application server contain detailed information about user requests, such as request time, URL, parameters, etc. The collected user behavior logs record various user operations in the application system, such as clicks, browsing, form submission, etc.

[0046] After the collection, the original business log data needs to be checked for data integrity and timestamp accuracy. Ensure that each log contains necessary information, such as timestamp, event type, related data, etc. If a log entry is found to be incomplete, mark it as invalid data or try to supplement it. Ensure that the timestamp format is correct and arranged in chronological order. Correct or adjust the timestamp if it is wrong or inconsistent.

[0047] S120: Data cleaning and standardization.

[0048] Deduplication, through a deduplication algorithm based on unique identifiers, identifies and deletes duplicate log records.

[0049] Identify and remove invalid data, such as log records containing illegal characters, null values, or outliers.

[0050] Standardize the data and convert data in different formats into a standard format. For example, standardize the date format into "YYYY-MM-DDHH:MM:SS" and convert string-type numbers into numeric types.

[0051] S130: Extraction of key process nodes.

[0052] According to the characteristics and requirements of the business process, the identification rules of key process nodes are defined. For example, frequently occurring events, events that have a significant impact on business results, or events with specific business significance are defined as key process nodes.

[0053] Traverse the cleaned business log data and extract key process nodes according to the identification rules.

[0054] S200 designs the DFG graph structure, including defining nodes and attributes as well as connection definitions and attributes, mapping the cleaned and standardized business log data to the DFG structure, and accurately representing the hierarchical relationship and connection relationship between each node in the business process based on the node mapping rules and connection mapping rules.

[0055] Please refer to Figure 3 , which shows a flowchart of an exemplary method S200 of the present application for generating a parameterized interactive graphical process tree for business log data, and its contents include:

[0056] S210: DFG graph structure design.

[0057] A DFG is a directed graph used to describe the direct sequence relationship between events. In the process tree, each node represents a key step or event in the business process, and the connection between nodes represents the execution order of events. Specifically, it includes:

[0058] S211: Defining nodes and attributes

[0059] Node ID: Each node is assigned a unique identifier that is used to uniquely identify the node in the process tree.

[0060] Node name: describes the business meaning represented by the node to help users understand the function of the node.

[0061] Other attributes: Based on business needs, you can also define other attributes for the node, such as the node type (such as start node, end node, ordinary node, etc.), execution time, resource consumption, etc.

[0062] S212: Connection Definition and Properties

[0063] Connection type: defines the connection type between nodes, such as sequential connection, parallel connection, conditional connection, etc. Different connection types represent different business logic relationships.

[0064] Connection weight: Assign a weight value to a connection to indicate the importance of the connection or the frequency of execution. Connection weight can be calculated based on business data, such as the number of times an event occurs, the time interval, and other factors.

[0065] For example, the number of times an event occurs is used as a weight indicator. Assuming that within a period of time, event A to event B occurs n times, the weight of connection AB is expressed as:

[0066] ω A-B =n.

[0067] S220: Map data to DFG structure.

[0068] Map the cleaned and standardized business log data into the designed DFG structure to build a process tree.

[0069] According to the event information in the business log data, determine the node corresponding to each event and add it to the process tree. The order of adding nodes should follow the execution order of the business process.

[0070] According to the order of events, determine the connection between nodes, and set the type and weight of the connection. If there is a direct order between two events, establish a sequential connection between the corresponding nodes; if two events can occur at the same time, establish a parallel connection; if there are conditional restrictions on the occurrence of events, establish a conditional connection.

[0071] S230: Accurately represent the hierarchical relationship and connection relationship between each node in the business process.

[0072] The node mapping rule is to match the business process nodes in the cleaned data with the nodes in the DFG structure. This requires clarifying the characteristics and attributes of each business process node in order to accurately find or create the corresponding node in the DFG structure.

[0073] Connection mapping rules are used to determine the connections between nodes in the DFG structure. Connections are established between corresponding nodes based on the order of events and logical relationships in the business process, such as sequential execution, parallel execution, or conditional execution. The type and direction of the connection should accurately reflect the actual situation of the business process. At the same time, weights can be assigned to connections based on business data to reflect the importance or frequency of different connections in the business process.

[0074] By strictly following these node mapping rules and connection mapping rules, the cleaned data can be completely and accurately mapped to the DFG structure. The DFG structure can clearly show the hierarchical relationship and connection relationship between each node in the business process, providing a reliable foundation for subsequent process tree construction and analysis.

[0075] S300 selects an appropriate directed graph layout algorithm, such as a force-directed algorithm or a grid layout algorithm, to optimize node distribution, including weight information, avoiding node overlap, and considering user interaction. It also applies visual elements such as color, shape, size distinction, and label display to enhance the visualization of the process tree.

[0076] Please refer to Figure 4 , which shows a flowchart of an exemplary method S300 of the present application for generating a parameterized interactive graphical process tree for business log data, and its contents include:

[0077] S310: Layout algorithm selection.

[0078] Choosing a suitable directed graph layout algorithm is crucial to generating a clear and beautiful process tree. Directed graph layout algorithms include force-directed algorithms, grid layout algorithms, etc.

[0079] Force-directed algorithm: Force-directed algorithm is a layout algorithm based on physical models. It simulates the interaction between nodes and continuously adjusts the positions of nodes to achieve a balanced state in the graph. Force-directed algorithm can better display the relationship between nodes.

[0080] Grid layout algorithm: The grid layout algorithm places nodes in a regular grid and adjusts the position and size of the nodes to make the layout of the graph more regular. The grid layout algorithm has high computational efficiency.

[0081] S320: Node distribution optimization.

[0082] No matter which layout algorithm is chosen, the node distribution needs to be optimized to ensure that the layout of the process tree is reasonable and beautiful. Node distribution optimization includes:

[0083] Optimization based on weight information: Combine the business data weights of nodes and connections (such as frequency, time cost, etc.) to adjust the positions of nodes. For example, nodes with larger weights are placed in more prominent positions, or related nodes are clustered together to highlight the relationship between them.

[0084] Node overlap optimization: During the layout process, it is necessary to avoid overlap between nodes to ensure that each node can be displayed clearly. The node overlap problem can be solved by adjusting the size and spacing of the nodes.

[0085] Consider user interaction optimization: When optimizing node distribution, you also need to consider the convenience of user interaction. For example, place nodes that users often pay attention to in easy-to-operate locations, or add interactive prompt information to nodes to facilitate user operation.

[0086] S330: Application of visual elements.

[0087] In order to enhance the visualization of the process tree and improve the user's understanding and analysis of the process tree, various visual elements need to be applied to distinguish different node and path types. Visual elements include:

[0088] Color differentiation: Set different colors for different types of nodes and paths. For example, you can set the start node to green, the end node to red, and the common node to blue; set different types of connections to different colors to indicate their connection relationships.

[0089] Shape differentiation: Set different shapes for different types of nodes. For example, you can set decision nodes to diamonds, operation nodes to rectangles, event nodes to circles, etc.

[0090] Size differentiation: Set different sizes for nodes based on their importance or other properties. For example, you can set a node with a larger weight to a larger size to highlight its importance.

[0091] Label display: Add a label to each node to display the node's name or other related information, making it easier for users to identify and understand the meaning of the node.

[0092] S400 is designed with a friendly and intuitive user interface, with functions such as tree depth and breadth control, node display threshold setting, and specific business type screening. It monitors user input in real time and verifies its legality and validity, updates the structure and display content of the process tree in real time according to user input parameters, and provides interactive feedback.

[0093] Please refer to Figure 5 , which shows a flowchart of an exemplary method S400 of the present application for generating a parameterized interactive graphical process tree for business log data, and its contents include:

[0094] S410: User interface design.

[0095] Design a friendly and intuitive user interface to enable users to easily interact with the process tree. The user interface content includes:

[0096] Tree depth and breadth control: Provide a slider or other interactive methods to allow users to adjust the display depth and breadth of the process tree. Users can choose to view the entire business process or drill down to specific sub-processes or operation steps according to their needs.

[0097] Node display threshold setting: Through the value input box or other methods, users can set the threshold for node display. For example, users can set it to only display nodes with a frequency higher than a certain value or a performance index lower than a certain value, so as to focus on key nodes and reduce unnecessary information interference.

[0098] Filtering by specific business type: Provide a business type drop-down menu or other filtering methods, allowing users to select specific business types for display. Users can filter out the business processes of interest for analysis based on their own focus.

[0099] Other interactive functions: Other interactive functions can be added according to user needs, such as node expansion and collapse, search, zoom, etc., to improve user experience.

[0100] S420: User input monitoring and verification.

[0101] The system monitors the user's input operations on the interface in real time and verifies the input to ensure the legality and validity of the input.

[0102] Input monitoring: Use JavaScript or other front-end technologies to monitor user operation events on the interface, such as dragging a slider, changing a numeric input box, selecting a drop-down menu, etc.

[0103] Input verification: Verify the parameters input by the user to check whether the parameters meet the requirements. For example, check whether the node display threshold is a legal value, whether the business type selection is within the predefined range, etc. If the input is illegal, prompt the user to correct it in time.

[0104] S430: The process tree is updated in real time.

[0105] Based on the user's input parameters, the structure and display content of the process tree are updated in real time to reflect the user's needs.

[0106] When users adjust the tree depth and breadth, node display threshold, or specific business type filter conditions, the system recalculates the structure of the process tree and generates a new process tree that meets the user's requirements. For example, if the user increases the depth of the tree, the system will add more levels of nodes to the process tree; if the user increases the node display threshold, the system will hide those nodes whose frequency is lower than the threshold.

[0107] According to the new process tree structure, update the displayed content on the interface, including displaying and hiding nodes, adjusting the position and size of nodes, drawing connections, etc. At the same time, update related visual elements such as color and shape to maintain the visualization of the process tree. For example, when the display status of a node changes, update the color and shape of the node accordingly; when the position of a node changes, redraw the connection lines to ensure that the layout of the process tree is reasonable.

[0108] In order to improve the user experience, timely interactive feedback is provided during the process tree update. For example, when the user adjusts the parameters, a loading animation is displayed to indicate that the system is updating the process tree; after the update is completed, the changed parts are highlighted so that the user can clearly see the update results. In addition, undo and redo functions can be provided to facilitate users to correct mistakes when they make operations.

[0109] The basic principles of the present application are described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, effects, etc. mentioned in the present application are only examples and not limitations, and it cannot be considered that these advantages, strengths, effects, etc. are required by each embodiment of the present application. In addition, the specific details disclosed above are only for the purpose of illustration and ease of understanding, not for limitation, and the above details do not limit the present application to being implemented by adopting the above specific details.

[0110] The block diagrams of the devices, apparatuses, equipment, and systems involved in this application are only illustrative examples and are not intended to require or imply that they must be connected, arranged, and configured in the manner shown in the block diagram. As will be appreciated by those skilled in the art, these devices, apparatuses, equipment, and systems can be connected, arranged, and configured in any manner. Words such as "including", "comprising", "having", etc. are open words, referring to "including but not limited to", and can be used interchangeably with them. The words "or" and "and" used here refer to the words "and / or" and can be used interchangeably with them, unless the context clearly indicates otherwise. The words "such as" used here refer to the phrase "such as but not limited to", and can be used interchangeably with them.

[0111] It should also be noted that in the apparatus, device and method of the present application, each component or each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present application.

[0112] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present application. Therefore, the present application is not intended to be limited to the aspects shown herein, but rather to the widest scope consistent with the principles and novel features of the present invention.

[0113] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent substitutions, etc. made within the spirit and principles of the present application shall be included in the protection scope of the present application.

Claims

1. A method for generating a parameterized interactive graphical process tree for business log data, characterized in that: include: Collect raw business log data, clean and standardize it, and extract key process nodes; Based on the DFG graph structure, a tree data structure is designed to represent the business process, and the key process nodes are mapped to the DFG structure to achieve accurate representation of the hierarchical relationship and connection between nodes; By using the directed graph layout algorithm to process the DFG structure and optimize the process node distribution of the DFG structure, and using visual elements to distinguish different nodes, a parameterized process tree is generated; Design interactive feedback systems in parameterized process trees, including user interface design, user input monitoring and verification, and real-time update mechanisms.

2. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The original business log data includes database logs obtained from the enterprise's database system, application server logs collected from application servers, and user behavior logs collected; The original business log data extracts key process nodes by defining identification rules for key process nodes.

3. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The DFG graph structure design includes defining a node ID, a node name and other attributes for each node, and defining a connection type and a connection weight between nodes.

4. The method for generating a parameterized interactive graphical process tree from business log data according to claim 3, characterized in that: The mapping of the process nodes to the DFG structure includes determining the node corresponding to each event according to the event information in the business log data and adding it to the process tree, as well as determining the connection between the nodes according to the sequence relationship between the events and setting the type and weight of the connection.

5. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The selection of the directed graph layout algorithm includes a force-directed algorithm or a grid layout algorithm.

6. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The node distribution optimization includes optimization based on weight information, node overlap optimization and optimization considering user interaction.

7. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The visual element differentiation methods include color differentiation, shape differentiation and size differentiation.

8. The method for generating a parameterized interactive graphical process tree from business log data according to claim 1, characterized in that: The contents of the user interface design include tree depth and breadth control, node display threshold setting, and specific business type screening.

9. The method for generating a parameterized interactive graphical process tree from business log data according to claim 8, characterized in that: The tree depth and breadth control design content includes providing a slider or other interactive methods to allow users to adjust the display depth and breadth of the process tree; The node display threshold setting design content includes allowing the user to set the node display threshold through a numerical input box or other methods; The specific business type screening design content provides a business type drop-down menu or other screening methods, allowing users to select a specific business type for display.

Images