Conference management method based on graph structure

Abstract

The invention relates to the technical field of conference management, in particular to a graph structure-based conference management method, which comprises the following steps of: extracting conference key information to form an abstract node which comprises a current conference mark and a front conference mark; the front abstract nodes are positioned through the front conference marks, the serial abstract nodes and the front abstract nodes are connected in series, and a conference chain is formed; traversing the front abstract nodes from any abstract node according to the conference chain to form a graph structure; and when traversing the front abstract node and accessing the abstract node serving as a starting point, judging that the graph structure has a ring problem. Conference management is optimized through a graph structure, key information is extracted to form abstract nodes which are connected in series to form a chain, ring problems are effectively detected and avoided, and system processing efficiency and data accuracy are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of conference management, and in particular, to a conference management method based on a graph structure. Background Art

[0002] Conferences are not only important venues for decision-making but also key links for information exchange and teamwork. However, with the expansion of enterprise scale and the increase in business complexity, the number and frequency of conferences have also increased, making the management and analysis of conference records extremely complex. Good conference management can not only ensure the accurate recording and effective transmission of conference information but also help managers quickly grasp the context of conferences and make scientific decisions.

[0003] In existing conference management systems, conference records are usually stored dispersedly in multiple entities, increasing the complexity of data management and query. The relationships between conference records are intricate, and how to reasonably establish the association between data is an urgent problem to be solved. When storing and retrieving conference records in the current system, a large amount of manual intervention is often required, reducing work efficiency.

[0004] In addition, when dealing with complex conference chains, most existing systems lack an effective loop detection mechanism and cannot detect and handle loop problems in a timely manner during the construction of conference chains. Circular references occur in the conference chains, which may lead to calculation errors or infinite loops, affecting the accuracy and integrity of the results. This not only increases the complexity of the system but also may result in incorrect result output, affecting users' trust in conference data. Summary of the Invention

[0005] In order to achieve the chain management of conferences and the search for loop problems, in the first aspect of the present invention, a conference management method based on a graph structure is proposed, including:

[0006] Extracting key conference information to form abstract nodes, where the abstract nodes include the current conference identifier and the identifier of the previous conference;

[0007] Locating the previous abstract node through the identifier of the previous conference, and connecting the abstract node and the previous abstract node in series to form a conference chain;

[0008] Starting from any one of the abstract nodes, traversing the previous abstract nodes according to the conference chain to form a graph structure;

[0009] When traversing the previous abstract nodes and accessing the abstract node that is the starting point, it is determined that there is a loop problem in the graph structure.

[0010] In one or more embodiments, starting from any one of the abstract nodes and traversing the previous abstract nodes specifically means

[0011] Starting from any of the aforementioned abstract nodes, perform a pre - traversal of the abstract nodes until there are no pre - abstract nodes for the current abstract node, and then connect the meeting chains.

[0012] After performing a pre - traversal of all abstract nodes, connect all the meeting chains to obtain a graph structure.

[0013] In one or more embodiments, performing a pre - traversal of the abstract nodes specifically involves:

[0014] Form a visited flag based on the traversed abstract nodes, and form a partial graph structure composed of the traversed abstract nodes.

[0015] When traversing to a visited abstract node again, call the partial graph structure to avoid repeated traversal of the abstract node.

[0016] In one or more embodiments, performing a pre - traversal of the abstract nodes specifically involves:

[0017] According to the number of pre - abstract nodes, call multi - thread processing to traverse the process.

[0018] In one or more embodiments, extracting the key information of the meeting specifically involves:

[0019] Extract the key information from the original meeting record through a semantic feature recognition method.

[0020] In one or more embodiments, the abstract nodes include the current meeting flag and the pre - meeting flag, specifically:

[0021] Set a unique flag for the meeting.

[0022] Define the abstract node through the current meeting flag, and define the pre - abstract node through the pre - meeting flag.

[0023] Connect the current abstract node and the pre - abstract node in series to form a meeting chain through the current meeting flag and the pre - meeting flag included in the abstract node.

[0024] In one or more embodiments, the aforementioned meeting management method based on the graph structure further includes:

[0025] Transmit the graph structure to the front - end for display, so as to manage the meeting through the graph structure.

[0026] When there is a loop problem in the graph structure, alarm the abstract nodes involved in the loop problem with different colors.

[0027] In the second aspect of the present invention, a meeting management device based on a graph structure is proposed, including:

[0028] An information extraction module for extracting key information of a meeting to form abstract nodes;

[0029] A data abstraction module for locating pre - abstract nodes through the pre - meeting flag, concatenating the abstract nodes and pre - abstract nodes to form a meeting chain, and traversing the pre - abstract nodes to form a graph structure;

[0030] A front - end display module for displaying the graph structure.

[0031] In the third aspect of the present invention, a computer - readable storage medium is proposed, which is used to store computer instructions for causing a computer to execute the meeting management method based on the graph structure.

[0032] In the fourth aspect of the present invention, an electronic device is proposed, including:

[0033] A memory for storing computer instructions;

[0034] A processor for implementing the meeting management method based on the graph structure when executing the computer instructions.

[0035] The beneficial effects of the present invention include:

[0036] 1. In the present invention, when traversing the pre - abstract nodes and accessing the abstract node as the starting point, it is determined whether there is a loop problem in the graph structure. By marking each node during the traversal process and using the historical access record to detect the loop, the meeting management method based on the graph structure proposed by the present invention effectively avoids the formation of loops, ensuring the accuracy and integrity of the results.

[0037] Specifically, this method not only significantly improves the processing efficiency and stability of the system, but also greatly enhances the user experience and work efficiency.

[0038] First, in terms of efficiency, the system significantly reduces the invalid calculation and resource waste by marking each node and immediately terminating the recursive process when a loop is found, thus greatly improving the overall processing speed.

[0039] Second, in terms of accuracy, this mechanism can effectively avoid calculation errors caused by loops, ensuring the consistency and reliability of data, enabling managers to make scientific decisions based on the accurate meeting chain information.

[0040] In addition, in terms of stability, through a reasonable task scheduling and data synchronization mechanism, the system enhances its own stability and scalability. Even when faced with large-scale data sets or complex meeting chains, it can still operate efficiently and provide complete and accurate results. This comprehensive optimization not only improves the reliability and performance of the system, but also simplifies the user operation process, making meeting management more intuitive and efficient, providing strong support for the efficient operation of enterprises.

[0041] In summary, through these improvement measures, the present invention provides a powerful tool for enterprises and organizations to help them better manage and analyze meeting data, thereby achieving more efficient decision-making and management.

[0042] 2. In the present invention, key information of a meeting is extracted to form abstract nodes, and the abstract nodes include the logo of the present meeting and the logo of the previous meeting; the previous abstract node is located through the logo of the previous meeting, and the abstract nodes and the previous abstract nodes are connected in series to form a meeting chain; starting from any one of the abstract nodes, according to the meeting chain, the previous abstract nodes are traversed to form a graph structure. By transforming the complex decision-making meeting chain into an intuitive and easy-to-process graph structure, the present invention greatly simplifies the complexity of data management and query.

[0043] Specifically, the system first extracts the key information of the meeting to form abstract nodes. These abstract nodes not only retain the key information of the present meeting and the previous meeting, but also clearly show the relationship between each node through the graph structure. This graph structure is not only intuitive and easy to understand, but also convenient for subsequent automated processing and analysis.

[0044] In addition, the data based on the graph structure enables users to easily browse and query the meeting chain without manually searching and comparing the relationships of each node. This mechanism not only improves the efficiency of data management, but also reduces the risk of data inconsistency caused by human errors.

[0045] Through the above improvement measures, the present invention significantly simplifies the complexity of data management and query and improves the overall performance of the system. The design of the graph structure enables the system to flexibly handle meeting chains of different scales and complexities and has good scalability and adaptability.

[0046] In summary, through the construction and abstraction of the graph structure and automated processing, the present invention effectively solves the problem of high complexity of data management and query in the prior art and provides a more efficient and accurate meeting management solution for enterprises and organizations. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other embodiments can be obtained based on these drawings.

[0048] Figure 1 It is a flowchart of the working process of the conference management method based on the graph structure under an embodiment of the present invention;

[0049] Figure 2 It is a schematic diagram of the conference chain under an embodiment of the present invention;

[0050] Figure 3 It is a schematic diagram of a partial structure diagram under an embodiment of the present invention;

[0051] Figure 4 It is a schematic diagram of the ring structure under an embodiment of the present invention. Detailed implementation manners

[0052] To make the purpose, technical solutions and advantages of the present invention more clear, the following will further describe the embodiments of the present invention in detail with reference to specific embodiments and the accompanying drawings.

[0053] It should be noted that all the expressions using "first" and "second" in the embodiments of the present invention are used to distinguish two entities or parameters with the same name but different, so "first" and "second" are only for the convenience of expression and should not be understood as a limitation to the embodiments of the present invention. This will not be elaborated one by one in the subsequent embodiments.

[0054] In order to realize the chain management of the conference and the search for loop problems, in the first aspect of the present invention, a conference management method based on the graph structure is proposed, as Figure 1 shown, including:

[0055] S100: Extract the key information of the conference to form abstract nodes, and the abstract nodes include the logo of this conference and the logo of the previous conference.

[0056] The main purpose of this step is to simplify the subsequent data management and query processes by extracting the key information of the conference and converting it into abstract nodes. Specifically, extract the core information (such as the conference logo and the previous conference logo) from the original conference records and structure it into abstract nodes. These abstract nodes not only retain the key features of the conference but also clearly show the relationships between the nodes through the graph structure, laying a foundation for subsequent automated processing and analysis.

[0057] Specifically, it includes information extraction: First, extract key information from the original meeting minutes, including but not limited to the meeting name, topic information, and its pre-meeting information, etc. This process is achieved through natural language processing technology to ensure accurate identification and extraction of relevant information.

[0058] Abstract node generation: The extracted key information is compressed into a one-dimensional structure to form abstract nodes. Each abstract node contains the unique identifier of this meeting and the identifier of the associated pre-meeting. This structured representation not only simplifies data storage but also facilitates subsequent querying and analysis.

[0059] The present invention effectively solves the problem of high complexity in data management and querying in the prior art by abstracting complex meeting key information into simple abstract nodes, which is conducive to improving the overall performance and processing efficiency of the system.

[0060] And the abstract node includes the meeting identifier and the pre-meeting identifier, which provides the association between the current abstract node and the pre-abstract node, facilitating the chain management of meetings and improving the systematicness of management.

[0061] S200: Locate the pre-abstract node through the pre-meeting identifier, concatenate the abstract node and the pre-abstract node to form a meeting chain, as Figure 2 shown.

[0062] The main purpose of this step is to associate each abstract node with each other through the pre-meeting identifier, thereby constructing a complete meeting chain. This process not only simplifies the sorting and management of the meeting chain but also provides a solid foundation for subsequent data querying and analysis.

[0063] Specifically, it includes pre-meeting identifier recognition: The system first recognizes the pre-meeting identifiers in each abstract node, and these identifiers are used to identify the pre-meeting nodes related to the current node.

[0064] Pre-abstract node location: Using the pre-meeting identifier, the system can accurately locate the corresponding pre-abstract node. This step ensures the establishment of the association relationship between each meeting node and its pre-meeting.

[0065] Node concatenation: Concatenate the current abstract node with the corresponding pre-abstract node to gradually construct a complete meeting chain. This concatenation method makes the complex meeting relationship intuitive and easy to manage.

[0066] By positioning and connecting nodes with the pre-conference logo, the conference chain can be automatically generated and maintained, reducing the workload of manually establishing associations and improving management efficiency. Automatic identification and association of pre-conference nodes ensures that the logical relationship between the nodes in the conference chain is accurate and enhances data consistency and reliability. Users can easily browse and query the conference chain without manually searching and comparing the relationship between the nodes, greatly simplifying the query process.

[0067] In summary, through the above steps, the present invention effectively solves the problem of complex conference chain management in the prior art and provides enterprises and organizations with a more efficient and accurate conference management solution. It not only improves the overall performance of the system, but also greatly improves the user's operating experience. These improvements make the management and query of conference chains easier, faster and more reliable.

[0068] S300: Starting from any of the abstract nodes, according to the conference chain, traverse the preceding abstract nodes to form a graph structure.

[0069] The main purpose of this step is to build a complete graph structure by traversing each abstract node and its predecessor node, so as to clearly display the relationship network of the conference chain. This process not only helps to fully understand the logical relationship of the conference chain, but also provides strong support for subsequent data query and analysis.

[0070] Specifically, it includes, selecting the starting node: the system starts from any abstract node as the starting point of the traversal. This starting node can be specified by the user or automatically selected by the system.

[0071] Traversing the predecessor nodes: Based on the association information in the conference chain, the system traverses the predecessor nodes of each abstract node in turn, gradually expanding the graph structure. This process ensures that all relevant nodes are included in the graph structure.

[0072] Forming a graph structure: As the traversal proceeds, the system integrates each node and its associated relationships into a complete graph structure. This graph structure intuitively displays the entire conference chain, making it easier for users to understand and analyze.

[0073] Through the above steps and strategies, the present invention effectively solves the complex management and query problems of multiple conference chains in the prior art, and provides enterprises and organizations with a more efficient and accurate conference management solution.

[0074] S400: When traversing the preceding abstract nodes and accessing the abstract node as the starting point, determining that a loop problem exists in the graph structure.

[0075] The main purpose of this step is to detect loop problems in the graph structure during the traversal process to ensure the correct logical relationship of the meeting chain. By real-time monitoring and handling loop problems, the system can avoid infinite loops and other potential data errors, thus ensuring data consistency and reliability.

[0076] Specifically, it includes node marking and recording: during the traversal process, the system marks each visited node and records it in the historical access list. This step ensures that the system can track all visited nodes and their paths.

[0077] Loop detection: when the system visits a certain pre-node, it checks whether the node is already in the historical access list. If it is found that the current node is already in the list, it means that there is a loop structure, and the system will immediately identify and mark the loop problem. As Figure 4 shown, starting from the No. 1 abstract node to perform the traversal of the pre-abstract node, after performing 4 traversals, reading the No. 1 abstract node again for traversal indicates the existence of a loop structure.

[0078] Terminate the recursive process: once a loop problem is detected, the system immediately terminates the current recursive process to prevent further in-depth traversal, thus avoiding infinite loops and unnecessary waste of computing resources.

[0079] This step can timely terminate the recursive process by real-time detecting loop problems, avoid infinite loops caused by loops, and ensure the stable operation of the system. The loop detection mechanism effectively reduces the problem of data inconsistency, ensures the accuracy and reliability of the meeting chain, and supports managers to make scientific decisions.

[0080] At the same time, timely terminating the invalid recursive process significantly reduces unnecessary consumption of computing resources and improves the overall processing efficiency. These improvement measures not only enhance the stability of the system, but also greatly improve the accuracy and processing speed of data.

[0081] In one implementation, starting from any one of the said abstract nodes, traverse the pre-abstract nodes. Specifically,

[0082] Starting from any one of the said abstract nodes, perform the traversal of the pre-abstract node until there is no pre-abstract node for the current abstract node, and connect the meeting chains;

[0083] After performing the traversal of the pre-abstract node for all abstract nodes, connect all the meeting chains to obtain a graph structure.

[0084] The main purpose of this implementation is to build a complete graph structure by traversing each abstract node and its pre-nodes, so as to clearly display the relationship network of the entire meeting chain. This not only helps to comprehensively understand the logical relationship of the meeting chain, but also provides strong support for subsequent data query and analysis.

[0085] Specifically, select the starting node: The system can automatically select the starting node according to preset rules (such as the earliest or latest meeting);

[0086] Alternatively, the user is allowed to manually select a specific starting node to meet different query requirements.

[0087] Preceding abstract node traversal: Depth-First Search (DFS). Using the DFS algorithm, start traversing layer by layer from the starting node until all preceding nodes are found;

[0088] Or, Breadth-First Search (BFS). Using the BFS algorithm, start expanding and traversing layer by layer from the starting node, which is suitable for scenarios where quick access to shallower-level information is required.

[0089] Connect the meeting chains: Dynamically update. When new meeting records are added to the system, automatically parse and update the associated abstract nodes to ensure the real-time nature and integrity of the graph structure.

[0090] Path optimization. Use intelligent algorithms to optimize the access paths between nodes to ensure an efficient and non-redundant traversal process.

[0091] Integrate all meeting chains: Merging strategy. The system merges all independent meeting chains according to the association relationships between nodes to form a complete graph structure.

[0092] Specifically, as Figure 3 shown, label 13 has three preceding nodes, and multi-threading is used to sequentially traverse nodes 14, 18, and 19; label 14 has two preceding nodes, and multi-threading is used to sequentially traverse nodes 15 and 18; label 15 has three preceding nodes, and multi-threading is used to sequentially traverse nodes 16, 17, and 19. After the traversal is completed, all meeting chains can be integrated to form a graph structure.

[0093] This embodiment adopts an adaptive traversal strategy, selects different traversal methods (such as DFS or BFS) according to the data scale and complexity, and dynamically adjusts during the traversal process to achieve the best performance. At the same time, the system saves the results of each traversal, generates a detailed historical report for the user's subsequent analysis and reference, helps better understand the complex relationships of the meeting chains, and supports more scientific decision-making.

[0094] In one embodiment, when performing the preceding abstract node traversal, specifically,

[0095] as Figure 3 shown, form an access mark based on the traversed abstract nodes to form a partial graph structure composed of the traversed abstract nodes;

[0096] When traversing to an abstract node that has been visited again, the partial graph structure is called to avoid repeated traversal of the abstract node.

[0097] The main purpose of this embodiment is to avoid repeated traversal of the same node during the traversal process by marking the visited abstract nodes and forming a partial graph structure. This not only improves the processing efficiency of the system but also ensures the accuracy and integrity of the graph structure, preventing performance degradation and data inconsistency problems caused by repeated traversal.

[0098] Specifically, it includes marking the visited nodes: during the traversal process, the system creates a mark (such as a boolean value or a status identifier) for each visited abstract node to indicate that the node has been visited.

[0099] For example, a status identifier (such as "not visited", "being visited", "visited") is set for each abstract node, and these identifiers are dynamically updated during the traversal process. A hash table or other efficient data structures are used to store the identifiers of the visited nodes for quick lookup and update of the node status.

[0100] Constructing the partial graph structure: as the traversal progresses, the system integrates the visited abstract nodes and their associated relationships into a partial graph structure. This partial graph structure records the currently traversed nodes and their path information.

[0101] For example, as the traversal progresses, the system gradually constructs and updates the partial graph structure, recording the currently visited nodes and their associated relationships. Path compression techniques are used to optimize the graph structure, reduce redundant paths, and improve query efficiency.

[0102] Calling the partial graph structure: when an abstract node that has been visited is encountered again, the system no longer performs repeated traversal on it but directly calls the constructed partial graph structure to obtain the associated information.

[0103] For example, when an already visited node is encountered again, the system quickly retrieves the relevant information of the node through efficient data structures such as a hash table to avoid repeated traversal. A caching mechanism is used to store the key information in the partial graph structure to further accelerate the retrieval speed.

[0104] This embodiment effectively solves the problems of complex conference chain management and query in the prior art, providing a more efficient and accurate conference management solution for enterprises and organizations. These steps make the management and query of the conference chain simpler, faster, and more reliable, significantly improving the processing efficiency of the system and the consistency of data.

[0105] In another embodiment, according to the number of pre - abstract nodes, multi - thread processing is called to traverse the process.

[0106] The main purpose of this embodiment is to optimize the traversal process using multi-threading technology. Especially when there are a large number of pre-abstraction nodes, the traversal efficiency is improved through parallel processing. This method can significantly reduce the traversal time, especially when dealing with large-scale data sets, ensuring that the system can operate efficiently while guaranteeing the accuracy and integrity of the results.

[0107] Specifically, it includes evaluating the number of pre-nodes: Before the traversal starts, the system first calculates the number of pre-nodes for each abstraction node.

[0108] During the process of constructing the graph structure, the system records the number of its pre-nodes for each abstraction node. According to actual requirements, the system can adjust the statistical method of the number of pre-nodes in real time to adapt to different application scenarios.

[0109] Dynamically allocate threads: According to the number of pre-nodes, the system dynamically determines the number of threads to be started and assigns a thread to each pre-node for independent traversal.

[0110] Use a thread pool to manage the creation and destruction of threads, avoiding the overhead caused by frequent creation and destruction of threads. Dynamically adjust the thread allocation according to the number of pre-nodes to ensure that the workload of each thread is relatively balanced, avoiding the situation where some threads are overloaded while others are idle.

[0111] Execute traversal tasks in parallel: Each thread concurrently executes its own traversal task without interference, completing the access to all nodes at the fastest speed.

[0112] Introduce appropriate synchronization mechanisms (such as locks, semaphores, etc.) to ensure that multiple threads do not conflict when accessing shared resources. The threads can exchange information through asynchronous communication to further improve the efficiency of parallel processing.

[0113] Merge results: After the traversal is completed, the system merges the results of each thread to form a complete graph structure or a partial graph structure.

[0114] The system designs a set of efficient result integration algorithms that can merge the traversal results of each thread into the final result in a short time. During the merging process, the system checks the consistency of the results to ensure that there is no missing or duplicate data.

[0115] This embodiment not only solves the problem of low efficiency of traditional single-threaded traversal but also greatly improves the processing ability of the system in complex conference chain management scenarios through multi-threaded parallel processing. These improvement measures make the management and query of conference chains more efficient and reliable, providing more powerful tool support for enterprises and organizations. Generally speaking, these optimization measures significantly improve the processing speed and stability of the system, greatly improving the user's operation experience.

[0116] In one implementation, the extraction of key information can be achieved by means of semantic feature recognition.

[0117] The main purpose of this implementation is to automatically extract key information (such as meeting name, topic information, pre - meeting flag, etc.) from the original meeting records through semantic feature recognition technology, thereby simplifying the data processing flow, reducing manual intervention, and ensuring data consistency and accuracy. This method can efficiently process a large amount of complex data, improving the overall performance of the system and the user experience.

[0118] Specifically, it includes preprocessing the original data: cleaning and standardizing the original meeting records, removing noise data and irrelevant information to prepare for subsequent semantic feature recognition.

[0119] Data cleaning can remove noise data, duplicate information, and irrelevant content in the meeting records to ensure the purity of the data.

[0120] Standardization processing converts meeting records in different formats into a unified standard format for subsequent processing.

[0121] Applying semantic feature recognition technology: Using semantic feature recognition methods in natural language processing (NLP) technology to extract key information from the cleaned data. These methods include but are not limited to named entity recognition (NER), keyword extraction, topic models, etc.

[0122] Among them, named entity recognition (NER) identifies key entities in the meeting records, such as meeting name, participants, time and location, etc.

[0123] Keyword extraction extracts core keywords in the meeting records through algorithms such as TF - IDF or TextRank to help understand the theme and key points of the meeting.

[0124] Using topic models such as LDA (Latent Dirichlet Allocation) to analyze the content of the meeting records to determine the main discussion topics and decision points.

[0125] Utilizing pre - trained language models (such as BERT, RoBERTa) for more complex semantic understanding and information extraction to further improve the recognition accuracy.

[0126] It can be understood that through multi - modal data processing, in addition to text data, multi - modal data such as audio and video can also be combined for comprehensive analysis to obtain more comprehensive meeting information. For example, extracting key information from the meeting recording through speech recognition technology.

[0127] The system can adopt an incremental learning method to automatically update the model each time new data is added to maintain the timeliness and accuracy of the model.

[0128] Enhance the effect of semantic feature recognition using context information. For example, combine the context before and after to better understand ambiguous or vague information in the meeting record.

[0129] Through the above steps, the present invention effectively solves the problem of low efficiency in traditional manual extraction of key meeting information, providing a more efficient and accurate meeting management solution for enterprises and organizations. It not only improves the overall performance of the system but also significantly enhances the user's operation experience. Generally speaking, these steps make the management and query of the meeting chain simpler, faster, and more reliable, significantly improving the processing efficiency of the system and the consistency of data.

[0130] In one implementation, the abstract node includes the current meeting flag and the previous meeting flag, specifically:

[0131] Set a unique flag for the meeting,

[0132] The current meeting flag defines the abstract node, and the previous meeting flag defines the previous abstract node.

[0133] The current abstract node and the previous abstract node are connected in series through the current meeting flag and the previous meeting flag included in the abstract node to form a meeting chain.

[0134] The main purpose of this implementation is to set a unique flag for each meeting and use these flags to associate each meeting with its previous meeting to form a complete meeting chain. This method not only simplifies the construction and management of the meeting chain but also ensures the consistency and accuracy of data, supporting efficient query and analysis.

[0135] Specifically, it includes setting a unique flag for the meeting: Each meeting is assigned a unique identifier (ID) to distinguish different meeting records.

[0136] Among them, set a globally unique ID, generate a globally unique identifier (such as UUID or auto-incrementing ID) for each meeting to ensure that each meeting has a unique identity.

[0137] At the same time, perform standardized naming, adopt standardized naming rules for easy subsequent data processing and recognition. For example, use a timestamp or a string in a specific format as part of the meeting ID.

[0138] Define the abstract node: Use the unique flag of the meeting to define the abstract node. Each abstract node contains the key information of the meeting (such as the meeting name, topic, etc.) and its previous meeting flag.

[0139] Structurally represent abstract nodes, where each abstract node contains the following information: the current meeting flag, which is the unique identifier of the current meeting; the key information of the meeting, such as the meeting name, topics, participants, etc.; the previous meeting flag, which is the unique identifier of the previous meeting associated with the current meeting.

[0140] Store the abstract nodes in a database or memory for easy access and operation.

[0141] Define the previous abstract nodes: Use the previous meeting flag to define the previous meeting nodes related to the current meeting, and these previous nodes are also abstract nodes with unique identifiers.

[0142] Among them, extract the previous relationship, extract the information of the previous meeting from the meeting record, and assign a unique identifier to it. When new meeting records are added, the system automatically parses and updates the associated previous meeting nodes to ensure the real-time nature and integrity of the data.

[0143] Form a meeting chain in series: Through the current meeting flag and the previous meeting flag in the abstract node, connect the current meeting node with its previous meeting nodes to gradually build a complete meeting chain.

[0144] Among them, build an association relationship. According to the current meeting flag and the previous meeting flag in the abstract node, connect the current meeting node with its previous meeting nodes to gradually build a complete meeting chain.

[0145] Through the above steps and strategic solutions, the present invention effectively solves the problem of complex management and query of the meeting chain in the prior art, and provides a more efficient and accurate meeting management solution for enterprises and organizations.

[0146] In one implementation, the meeting management method based on a graph structure further includes

[0147] Transmit the graph structure to the front end for display, so as to manage the meeting through the graph structure;

[0148] When there is a loop problem in the graph structure, alarm the abstract nodes involved in the loop problem with different colors.

[0149] The main purpose of this implementation is to transmit the constructed graph structure to the front end for visual display, enabling users to intuitively view and manage the meeting chain. In addition, when a loop problem is detected in the graph structure, relevant nodes are alarmed with different colors to help users quickly identify and handle these problems. This method not only improves the readability and usability of the data, but also enhances the stability and user experience of the system.

[0150] Specifically, it includes transmitting the graph structure to the front end: transmitting the generated graph structure to the front end through an API or other means for users to perform visual display and interactive operations.

[0151] Among them, design an efficient API interface for transmitting the graph structure data generated by the back end to the front end. Technologies such as RESTful API or GraphQL can be used.

[0152] Convert the data format, convert the graph structure data into a format suitable for front-end display (such as JSON) to facilitate the parsing and rendering of the front-end graphics library.

[0153] Front-end visual display: Use a graphics library (such as D3.js, Cytoscape.js, etc.) on the front end to present the graph structure to users in an intuitive manner, supporting interactive query and management.

[0154] Among them, select a suitable graphics library (such as D3.js, Cytoscape.js, etc.) to implement the visual display of the graph structure.

[0155] Design interactive functions, provide rich interactive functions, such as zooming, dragging, clicking on nodes to view details, etc., to enhance the user's operation experience.

[0156] Optimize the layout. According to the characteristics of the graph structure, select a suitable layout algorithm (such as force-directed layout, circular layout, etc.) to make the graph structure more beautiful and easy to understand.

[0157] Loop problem detection and warning: Real-time monitor the loop problem in the graph structure, mark the involved abstract nodes with different colors, and issue a warning to the user.

[0158] Among them, perform real-time monitoring, and real-time monitor whether there is a loop problem during the traversal process. Once a loop is detected, the system will immediately mark the relevant nodes.

[0159] Perform color marking, mark the abstract nodes involved in the loop problem with different colors (such as red) so that users can quickly identify these nodes.

[0160] Alarm prompt, display an alarm message on the interface to remind the user to pay attention to the existence of the loop problem and provide corresponding solutions or suggestions.

[0161] Through the above steps and strategic solutions, the present invention not only solves the problem of unintuitive data display in traditional meeting management, but also improves the stability of the system and the consistency of data through real-time monitoring and warning mechanisms. Generally speaking, these improvement measures make the management and query of the meeting chain simpler, faster and more reliable, significantly improving the processing efficiency of the system and the operation experience of users.

[0162] In a second aspect of the present invention, a conference management device based on a graph structure is proposed, including:

[0163] An information extraction module, configured to extract key conference information and form abstract nodes;

[0164] A data abstraction module, configured to locate pre - abstract nodes through the pre - conference flag, concatenate the abstract nodes and the pre - abstract nodes to form a conference chain, and traverse the pre - abstract nodes to form a graph structure;

[0165] A front - end display module, configured to display the graph structure.

[0166] It can achieve any effect in the conference management method based on the graph structure, so it will not be elaborated here.

[0167] In a third aspect of the present invention, a computer - readable storage medium is proposed. The computer - readable storage medium is used to store computer instructions, and the computer instructions are used to cause a computer to execute the above - mentioned conference management method based on the graph structure. Therefore, it can achieve any effect in the conference management method based on the graph structure, and it will not be elaborated here.

[0168] In a fourth aspect of the present invention, an electronic device is proposed, including:

[0169] A memory, configured to store computer instructions;

[0170] A processor, configured to implement the above - mentioned conference management method based on the graph structure when executing the computer instructions. Therefore, it can achieve any effect in the conference management method based on the graph structure, and it will not be elaborated here.

[0171] The above are exemplary embodiments disclosed by the present invention. However, it should be noted that various changes and modifications can be made without departing from the scope of the embodiments disclosed by the present invention as defined by the claims. The functions, steps, and / or actions of the method claims according to the disclosed embodiments here do not need to be executed in any specific order.

[0172] Those of ordinary skill in the art should understand that: the discussion of any of the above embodiments is only exemplary, and is not intended to imply that the scope of the embodiments disclosed by the present invention (including the claims) is limited to these examples; under the idea of the embodiments of the present invention, the technical features between the above embodiments or different embodiments can also be combined, and there are many other variations in different aspects of the above - mentioned embodiments of the present invention, which are not provided in detail for the sake of brevity. Therefore, any omission, modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present invention shall be included in the protection scope of the embodiments of the present invention.

Claims

1. A conference management method based on a graph structure, characterized in that: include: Extracting key information of the conference to form an abstract node, wherein the abstract node includes a flag of the current conference and a flag of a previous conference; Locating the preceding abstract node through the preceding conference mark, connecting the abstract node and the preceding abstract node in series to form a conference chain; Starting from any of the abstract nodes, according to the conference chain, traverse the preceding abstract nodes to form a graph structure; When traversing the preceding abstract nodes and accessing the abstract node as the starting point, it is determined that a loop problem exists in the graph structure.

2. The conference management method based on graph structure according to claim 1 is characterized in that: Starting from any of the abstract nodes, traverse the preceding abstract nodes, specifically, Starting from any of the abstract nodes, traversing the preceding abstract nodes is performed until the current abstract node has no preceding abstract node, and the conference chain is connected; After performing the preceding abstract node traversal on all abstract nodes, all conference chains are connected to obtain a graph structure.

3. The conference management method based on graph structure according to claim 2 is characterized in that: Perform the preceding abstract node traversal, specifically, Form visited marks according to the traversed abstract nodes, and form a partial graph structure composed of the traversed abstract nodes; When traversing to the visited abstract node again, the partial graph structure is called to avoid repeated traversal of the abstract node.

4. The conference management method based on graph structure according to claim 2 is characterized in that: Perform the preceding abstract node traversal, specifically, According to the number of predecessor abstract nodes, multiple threads are called to handle the traversal process.

5. The conference management method based on graph structure according to claim 1, characterized in that: Extract key information of the meeting, specifically, Key information is extracted from the original meeting records by using a semantic feature recognition method.

6. The conference management method based on graph structure according to claim 1, characterized in that: The abstract node includes the current conference flag and the previous conference flag, specifically: Set a unique identifier for the conference. The present conference flag defines an abstract node, and the preceding abstract node is defined by the preceding conference flag. By including the present conference flag and the preceding conference flag in the abstract node, the present abstract node and the preceding abstract node are connected in series to form a conference chain.

7. The conference management method based on graph structure according to claim 1, characterized in that: Also includes, transmitting the graph structure to the front end for display so as to manage the meeting through the graph structure; When a ring problem occurs in the graph structure, an alarm is issued by using different colors for the abstract nodes involved in the ring problem.

8. A conference management device based on a graph structure, characterized in that: include: Information extraction module, used to extract key information of the meeting and form abstract nodes; A data abstraction module, used to locate the preceding abstract node through the preceding conference mark, connect the abstract node and the preceding abstract node in series to form a conference chain, and traverse the preceding abstract node to form a graph structure; The front-end display module is used to display the graph structure.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store computer instructions, and the computer instructions are used to enable a computer to execute the graph-structured conference management method described in any one of claims 1 to 7.

10. An electronic device, characterized in that: include: Memory, for storing computer instructions; A processor, used to implement the graph-structured conference management method described in any one of claims 1 to 7 when executing the computer instructions.

Images