Graph structure manufacturing method and device for project management

Abstract

The invention provides a graph structure manufacturing method and device for project management, relates to the technical field of project management, and aims to effectively improve project management efficiency and enhance data analysis capability and display capability. The method comprises the following steps: extracting effective information items in all data related to a project; constructing a graph structure relation based on the effective information items; and generating a graph structure representing the project data based on the graph structure relationship. The project management efficiency can be effectively improved.

Description

Background Art

[0002] In the field of modern project management, as the scale of projects expands and the complexity increases, how to efficiently manage, analyze and visualize project data has become a key challenge. Traditional project management tools mainly rely on tables and relational database structures to organize and process some structured data in projects. However, in the project management process, in addition to structured data, there is also a large amount of unstructured data, including tasks, resources, time nodes, contract terms and risk factors. Since there are often complex dependencies and nonlinear associations between these data, traditional linear data structures and relational databases have shown some limitations when processing this information: Data associations are difficult to represent: In project management, the relationships between tasks, resources, time nodes, and risk factors are complex and often expressed as many-to-many associations. Traditional linear data structures are difficult to effectively represent these complex associations, which results in reduced efficiency in data management and analysis, incomplete information acquisition, and thus affects the accuracy of project decisions and execution results.

[0003] Low efficiency in processing non-linear relationships: In project management scenarios, data associations are not always linear or hierarchical. Traditional relational databases are usually based on preset table structures. When processing non-linear data associations, they have problems such as structural rigidity and response delays, and are not suitable for data management needs of multi-dimensional and multi-layer non-linear relationships.

[0004] Insufficient visualization analysis capabilities: With the diversification of project management needs, the demand for data visualization analysis has become more urgent. Traditional tables and relational databases are limited in the visualization of data, and it is difficult to intuitively display complex dependencies, influencing factors and other information, making it difficult for managers to quickly discover key nodes or potential risks, affecting decision-making efficiency.

[0005] Insufficient processing capabilities for large-scale unstructured data: Modern project management involves massive amounts of unstructured data, including documents, contract terms, pictures, etc. These data are difficult to store and manage directly using table structures. Traditional project management tools lack effective unstructured data processing capabilities, which can easily lead to the creation of data islands, increasing the risk of information isolation and duplication of work.

[0006] Therefore, in order to meet the needs of modern project management for data structure, management and visual analysis, a new data structure and processing method is urgently needed to represent the relationships and dependencies between project data in a more flexible and intuitive way. Summary of the invention

[0007] In order to overcome the problems existing in the related art, the present invention provides a method and device for making a graph structure for project management.

[0008] According to a first aspect of an embodiment of the present invention, there is provided a method for producing a graph structure for project management, comprising: Extract valid information items from all data related to the project; Constructing a graph structure relationship based on the valid information items; Based on the graph structure relationship, a graph structure representing the project data is generated.

[0009] In some exemplary embodiments of the present invention, based on the above solution, extracting valid information items from all data related to the project includes: Collect all data related to the project, where all data related to the project comes from project documents, including contracts, forms, applications, correspondence and invoices; Preprocessing each of the data related to the project using natural language processing technology to obtain a set of structural information items; Merge all the sets of structural information items to obtain a set of global information items; The set of global information items is output as the valid information items.

[0010] In some example embodiments of the present invention, based on the aforementioned solution, constructing a graph structure relationship based on the valid information item includes: Classifying and parsing each of the valid information items to identify important elements that play a key role in project management; Mapping the important elements into nodes and edges, wherein the nodes represent entities in the project and the edges represent the relationships between the entities; Scoring the nodes and edges to obtain scoring results; According to the scoring results, target nodes and target edges with scores exceeding a preset threshold are screened out; The target node and the target edge are output as the graph structure relationship.

[0011] In some example embodiments of the present invention, based on the above solution, generating a graph structure representing the project data based on the graph structure relationship includes: The target nodes and the target edges are mapped into a graph structure representing the project data.

[0012] In some exemplary embodiments of the present invention, based on the above solution, the method for making a graph structure for project management further includes: Incremental update step: incrementally updating the graph structure based on changes in project data to obtain an updated graph structure; The first judgment step: judging whether the updated graph structure has an isolated subgraph or an invalid connection, if so, adjusting the updated graph structure to obtain an adjusted graph structure; otherwise, outputting the updated graph structure as the adjusted graph structure and entering the second judgment step; The second judgment step: judge whether the adjusted graph structure causes a conflict. If so, determine the optimal update path according to the project rules or priority strategy of the project to optimize and update the adjusted graph structure to obtain the final graph structure; otherwise, output the adjusted graph structure as the final graph structure.

[0013] In some example embodiments of the present invention, based on the above solution, the incremental updating of the graph structure based on the project data change includes: Add new nodes and edges, modify the properties of existing nodes and edges, and remove obsolete nodes and edges.

[0014] In some exemplary embodiments of the present invention, based on the above solution, the method for making a graph structure for project management further includes: The graph structure is periodically checked, data cleaned, and integrity checked to achieve maintenance of the graph structure.

[0015] According to a second aspect of an embodiment of the present invention, there is provided a graph structure making device for project management, comprising: An information item extraction module, used to extract valid information items from all data related to the project; A graph structure relationship building module, used to build a graph structure relationship based on the valid information items; A graph structure generation module is used to generate a graph structure representing the project data based on the graph structure relationship.

[0016] According to a third aspect of an embodiment of the present invention, there is provided an electronic device, comprising: a processor; and a memory, wherein the memory stores computer-readable instructions, and the computer-readable instructions implement the method in the first aspect when executed by the processor.

[0017] According to a fourth aspect of an embodiment of the present invention, there is provided a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the method in the first aspect when executed by a processor.

[0018] The technical solution provided by the embodiments of the present invention may have the following beneficial effects: The present invention can effectively filter out data information that is critical to project management by extracting valid information items from all data related to the project, avoid interference from redundant information, and improve the efficiency of data integration; because the graph structure can intuitively show the dependencies and correlations between data, therefore, constructing graph structure relationships based on valid information items can clearly express entities and relationships in project data, so that managers can more quickly identify key nodes and dependency paths in the project, which is helpful for project management decisions. In addition, the graph structure production method of the present invention can adapt to the dynamic changes of data during the project process, allowing nodes and relationships in the graph structure to be added, updated, or removed at any time during the project advancement process. This enables the management system to always maintain consistency with the actual situation of the project, effectively support dynamic management needs, and ensure the real-time and accuracy of project management information.

[0019] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0021] Figure 1 A schematic diagram showing a system architecture of an exemplary application environment in which a method and apparatus for making a graph structure for project management according to an embodiment of the present invention can be applied; Figure 2 A schematic diagram of a process flow of a method for making a graph structure for project management according to some embodiments of the present invention is shown; Figure 3 A schematic diagram schematically shows a diagram of a graph structure making device for project management according to some embodiments of the present invention; Figure 4 A schematic diagram schematically shows a structure of a computer system of an electronic device according to some embodiments of the present invention; Figure 5 A schematic diagram of a computer-readable storage medium according to some embodiments of the present invention is schematically shown. DETAILED DESCRIPTION

[0022] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Instead, they are merely examples of devices and methods consistent with some aspects of the present invention as detailed in the appended claims.

[0023] The terms used in the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The singular forms "a", "the" and "the" used in the present invention and the appended claims are also intended to include plural forms unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used herein refers to and includes any or all possible combinations of one or more associated listed items.

[0024] It should be understood that although the terms first, second, third, etc. may be used in the present invention to describe various information, these information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present invention, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0025] Figure 1 A schematic diagram of a system architecture of an exemplary application environment of a method and apparatus for producing a graph structure for project management, to which an embodiment of the present invention can be applied, is shown.

[0026] like Figure 1 As shown, the system architecture 100 may include one or more terminal devices such as a desktop computer 101, a portable computer 102, and a smart phone 103, a network 104, and a server 105. The network 104 is used to provide a medium for a communication link between the terminal device and the server 105. The network 104 may include various connection types, such as wired or wireless communication links or optical fiber cables, etc. The terminal device may be any electronic device with data processing capabilities, which has a display screen for displaying a graph structure to a user, including but not limited to the above-mentioned desktop computers, portable computers, smart phones, etc. It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. According to the implementation requirements, there may be any number of terminal devices, networks and servers. For example, the server 105 may be a sub-server cluster composed of multiple sub-servers.

[0027] The graph structure making method for project management provided in the embodiment of the present invention can generally be executed by a terminal device, and accordingly, the graph structure making device for project management is generally set in the terminal device. However, it is easy for a person skilled in the art to understand that the graph structure making method for project management provided in the embodiment of the present invention can also be executed by the server 105, and accordingly, the graph structure making device for project management can also be set in the server 105, which is not particularly limited in this exemplary embodiment.

[0028] In addition, it should be understood that the graph structure production method for project management of the embodiment of the present invention can be configured as a software module. In some implementation scenarios, the graph structure production scheme for project management of the present invention can be deployed separately to achieve the generation of different graph structures. In other implementation scenarios, the graph structure production scheme for project management of the present invention can be deployed in other software as a functional module of the software, such as deployed in analysis software for project management. The present invention does not place any particular restrictions on the application of the graph structure production method for project management.

[0029] Next, the embodiments of the present invention are described in detail.

[0030] like Figure 2 As shown, Figure 2 The flowchart of a method for making a graph structure for project management according to an exemplary embodiment of the present invention includes the following steps: S210: extracting valid information items from all data related to the project; S220: Constructing a graph structure relationship based on the valid information items; S230: Based on the graph structure relationship, generate a graph structure representing the project data.

[0031] In S210, all data related to the project may be various types of data related to project execution, management and decision-making. In some embodiments, all data related to the project may include project information (such as name, goal, scope, time plan, etc.), financial data (project budget, cost, expense expenditure, income, profit margin, etc.), progress data (task status, milestone, delay or acceleration information), personnel data (personnel allocation, workload, attendance, etc.), risk and problem data (potential risks and problems in the project, and measures taken to deal with these situations), quality data (related information such as quality inspection and quality standards of project deliverables), and feedback data from customers or stakeholders (feedback, evaluation, changes in requirements, etc.).

[0032] By extracting effective information items directly related to project management from these large amounts of project data, irrelevant or redundant data can be removed, thereby focusing on data that is of practical value to project management. This can not only reduce redundancy in data storage and processing, shorten processing time, and improve data processing efficiency, but also lay the foundation for the subsequent construction of the graph structure, ensuring that the nodes and edges in the graph structure can accurately and fully represent the key data and relationships in the project.

[0033] The present invention does not limit the method for extracting effective information items. For example, in some embodiments, the effective information items can be extracted by using the matched keywords based on the rule matching method of keywords, or a text classifier can be trained by machine learning and the effective information items can be extracted by using the text classifier.

[0034] However, the accuracy of keyword rule matching is limited, and the model training cost of machine learning is high and requires a large amount of data for training. Therefore, in order to efficiently and accurately extract project data while avoiding the high training cost of machine learning models, in some example embodiments of the present invention, by combining rule matching and natural language processing, valid information items in all data related to the project are extracted, including: Collect all data related to the project, where all data related to the project comes from project documents, including contracts, forms, applications, correspondence and invoices; Preprocessing each of the data related to the project using natural language processing technology to obtain a set of structural information items; Merge all the sets of structural information items to obtain a set of global information items; The set of global information items is output as the valid information items.

[0035] Here, all the data collected related to the project can be generated into the following collection:

[0036] in, Represents a document or unit of data.

[0037] Use natural language processing technology to analyze all the data related to the project Preprocessing is performed, including word segmentation, part-of-speech tagging, entity recognition, relationship extraction, etc., to extract entities (equipment, suppliers, payment nodes, tasks, etc.) and relationships (task dependencies, supplier-equipment relationships, etc.), and the resulting set of structural information items It can be expressed as:

[0038] in, Represents the data item Extracted from j Entity; Represents the data item Extracted from k a relationship, represents the natural language processing process, Represents an entity, Indicates relationship.

[0039] Merge all structure information item sets to get the global information item set I , which can be expressed as:

[0040] In S220, a graph structure relationship is constructed based on the valid information items.

[0041] Among the extracted valid information items, identifying the relationships between each information item (for example, the dependencies between tasks, the associations between resources and tasks, the relationships between payment nodes and contracts, etc.) is crucial in project management and can clearly present the project process and dependency chain.

[0042] The key entities in the valid information items (such as tasks, resources, payment nodes, etc.) are represented as "nodes" in the graph structure, and the relationships between these nodes (such as dependencies, associations, conditional restrictions, etc.) are represented as "edges". Nodes represent the main data points in the project, while edges represent the relationships between these data points. Subsequently, attributes are assigned to each node and edge, laying the foundation for the construction of the graph structure.

[0043] In some example embodiments of the present invention, constructing a graph structure relationship based on the valid information item includes: Classifying and parsing each of the valid information items to identify important elements that play a key role in project management; Mapping the important elements into nodes and edges, wherein the nodes represent entities in the project and the edges represent the relationships between the entities; Scoring the nodes and edges to obtain scoring results; According to the scoring results, target nodes and target edges with scores exceeding a preset threshold are screened out; The target node and the target edge are output as the graph structure relationship.

[0044] The present invention does not limit the way to implement node and edge scoring. In some embodiments, the attributes of nodes or edges can be used to determine their scores. For example, node scoring can be based on the attribute values ​​of nodes (such as popularity, access frequency, etc.), and edge scoring can be based on relationship strength (such as number of interactions, similarity, etc.). In other embodiments, scoring can be performed based on graph algorithms, by traversing the connection relationships in the graph structure, calculating the importance of nodes or the weight of edges.

[0045] However, scoring based on attributes depends on the attributes and may not fully reflect the actual importance of nodes or edges; scoring based on graph algorithms requires large amounts of computation. In this regard, the present invention fully considers the weight of scoring factors, node priority, resource availability, and node connectivity, and provides the following node scoring methods:

[0046] in, is the weight of each scoring factor, For Node The priority of For resource availability, is the connectivity of the node.

[0047] The edge scoring method is:

[0048] in, is the weight of each scoring factor, For edge The influence of For edge The frequency of changes.

[0049] Next, based on the predefined threshold, nodes and edges with scores exceeding the threshold are selected as important entities and relationships of the project.

[0050] Then, the selected important entities are mapped to nodes in the graph structure and assigned attributes (name, type, priority, status, etc.); the selected important relationships are mapped to edges in the graph and also assigned attributes (relationship type, strength, time constraint, etc.).

[0051] Therefore, the present invention classifies and analyzes valid information items to ensure that the core data that has a practical impact on project management is focused on; by mapping important elements into nodes and edges in a graph structure, the complex relationship between data is presented intuitively and clearly; by scoring nodes and edges, nodes and relationships that have a significant impact in the project are identified; in this way, a graph structure relationship that reflects key data in the project is effectively constructed. This graph structure relationship can help project managers identify important nodes and dependency chains in the project, clearly understand the relevance between tasks and the allocation of resources, and thus optimize the decision-making process of project management.

[0052] In S230, a graph structure representing the project data is generated based on the graph structure relationship.

[0053] In some example embodiments of the present invention, generating a graph structure representing the project data based on the graph structure relationship includes: The target nodes and the target edges are mapped into a graph structure representing the project data.

[0054] Here, the target node and the target edge are mapped to a graph structure representing the project data. It can be understood that the target node is represented as a "node" in the graph, and the target edge is represented as an "edge" in the graph.

[0055] All target nodes Add to the graph structure G to ensure that each project element has a corresponding node in the graph, represented as:

[0056] Indicates adding the target node to the graph structure. Represents all nodes.

[0057] All target edges Added to the graph structure G, it represents the relationship between nodes, expressed as:

[0058] Indicates adding the target edge to the graph structure. represents all edges, , Represents two nodes, represents the weight, A value representing the weight.

[0059] In addition, in order to ensure the integrity and correctness of the graph structure G, the present invention checks the definitions and connections of nodes and edges, identifies and processes duplicate, missing or erroneous nodes and edges, verifies the connectivity and accuracy of the attributes of the graph, and ensures that the relationships between all project elements are reasonable.

[0060] In this way, the mapped nodes and edges form an overall graph structure, representing the key information in the project. This graph structure is not only the connection relationship of the data, but also displays the multi-dimensional data of the project (such as the dependency between tasks, the allocation of resources, etc.) through the relationship between nodes and edges, which better meets the needs of project management.

[0061] That is, the graph structure generated to represent the project data based on the graph structure relationship only retains the most important nodes and edges, which simplifies the graph structure. This not only enables project managers to focus on key points more quickly and improve data management efficiency, but also provides a good foundation for project analysis.

[0062] In the present invention, a graph structure representing project data is generated based on the graph structure relationship. It can be expressed as:

[0063] in, is the key node set, is the set of critical edges.

[0064] In addition, based on the above technical solution, after step S230, the graph structure making method for project management of the present invention may further include: Incremental update step: incrementally updating the graph structure based on changes in project data to obtain an updated graph structure; The first judgment step: judging whether the updated graph structure has an isolated subgraph or an invalid connection, if so, adjusting the updated graph structure to obtain an adjusted graph structure; otherwise, outputting the updated graph structure as the adjusted graph structure and entering the second judgment step; The second judgment step: judge whether the adjusted graph structure causes a conflict. If so, determine the optimal update path according to the project rules or priority strategy of the project to optimize and update the adjusted graph structure to obtain the final graph structure; otherwise, output the adjusted graph structure as the final graph structure.

[0065] In the incremental update step, the graph structure is incrementally updated based on the changes in the project data to obtain an updated graph structure.

[0066] When project data changes, the graph structure is incrementally updated with the goal of updating only the affected parts without rebuilding the entire graph. Updates include: Adding new nodes and edges: When a new element appears, add it as a new node and add corresponding edges according to the new relationship. It can be expressed as:

[0067] in, Represents a newly added node. Represents a newly added edge.

[0068] Modify the properties of existing nodes and edges: When the properties of existing project elements change, modify the properties of the corresponding nodes or edges. It can be expressed as:

[0069] in, Represents a node or edge in the newly added node, Represents a newly added node. express Attributes, express New attributes.

[0070] Remove obsolete nodes and edges: When some elements are no longer valid, remove them from the graph. It can be expressed as:

[0071] in, Represents the graph structure after removing obsolete nodes and edges. Represents the graph structure before removing obsolete nodes and edges. and They represent the nodes and edges that need to be removed respectively.

[0072] Through the incremental update method, only the changed nodes and edges need to be updated without rebuilding the entire graph structure. This can quickly and accurately reflect changes in project data, keep the graph structure real-time, and significantly improve update efficiency.

[0073] In the first judgment step: determine whether the updated graph structure has isolated subgraphs or invalid connections. If so, adjust the updated graph structure to obtain an adjusted graph structure; otherwise, output the updated graph structure as the adjusted graph structure and enter the second judgment step.

[0074] Here, an isolated subgraph refers to a set of nodes that are not associated with other nodes. Such nodes may not be properly connected due to newly added or changed relationships, making it difficult to fully express key information in the project. Invalid connections refer to connections between nodes that have no actual business significance or do not conform to project logic, which may be caused by misoperation or inconsistent data changes.

[0075] The detection and adjustment of isolated subgraphs and invalid connections can ensure that the nodes and edges in the graph structure have good coherence, so that the graph structure can fully and accurately reflect the real situation of the project. By removing invalid connections and reasonably connecting isolated subgraphs, the rationality of the graph structure can be enhanced, making the display and analysis of project data more reliable, so that managers can accurately analyze and optimize the graph structure in subsequent steps, improve the accuracy of decision-making and project management efficiency.

[0076] In the second judgment step: determine whether the adjusted graph structure causes a conflict. If so, determine the optimal update path according to the project rules or priority strategy of the project to optimize and update the adjusted graph structure to obtain the final graph structure; otherwise, output the adjusted graph structure as the final graph structure.

[0077] When data is updated, conflicts may occur. Conflicts may manifest in the following ways: Priority conflict: The priorities of some tasks are inconsistent, such as low-priority tasks being executed before high-priority tasks.

[0078] Resource conflict: Some tasks compete for the same resource at the same time, resulting in resource unavailability or unreasonable allocation.

[0079] Task dependency conflict: Some task dependencies are unreasonable, resulting in illogical execution order of tasks.

[0080] If a conflict is detected, the optimal path to resolve the conflict is determined based on project management rules (such as priority strategies or resource allocation rules) so that the graph structure can be optimized and updated.

[0081] By detecting and resolving priority, resource or dependency conflicts, it can ensure that project tasks and resources are properly configured in the graph structure and avoid potential problems in project execution.

[0082] In addition, in order to prevent data from being outdated or wrong. In some exemplary embodiments of the present invention, the method for making a graph structure for project management further includes: The graph structure is periodically checked, data cleaned, and integrity checked to achieve maintenance of the graph structure.

[0083] Periodic inspection is to conduct a comprehensive inspection of the graph data set on a regular basis to ensure that the definitions and attributes of all nodes and edges are consistent with the current project status and maintain the validity and consistency of the data. By verifying the existence of nodes and edges, the accuracy of attributes, and the connectivity of the graph, potential problems can be discovered and resolved in a timely manner to prevent erroneous data from affecting project management.

[0084] Data cleaning can be to remove nodes and edges that are no longer valid in the graph data set, delete redundant or duplicate data, and keep the graph structure simple and efficient. By cleaning up outdated data and eliminating redundancy, the size and complexity of the graph data set can be kept within a controllable range, improving storage and processing efficiency.

[0085] Error detection and correction can be automatic or manual detection and correction of errors in graph datasets, such as incorrectly connected edges, attribute mismatches, or missing data. By using predefined rules or algorithms to identify and correct errors in a timely manner, the accuracy of the dataset is maintained, ensuring smooth project management.

[0086] Performance optimization can be achieved by optimizing the performance of graph datasets through technologies such as data compression, indexing, and graph segmentation, ensuring that they can still run efficiently as the data volume and complexity increase. Optimization operations reduce storage space usage and algorithm execution time, maintaining data processing efficiency and response speed.

[0087] According to a second aspect of the embodiment of the present invention, referring to Figure 3 As shown, a graph structure making device 300 for project management is provided, comprising: An information item extraction module 310 is used to extract valid information items from all data related to the project; A graph structure relationship building module 320, configured to build a graph structure relationship based on the valid information items; The graph structure generation module 330 is used to generate a graph structure representing the project data based on the graph structure relationship.

[0088] In an exemplary embodiment of the present invention, based on the above-mentioned solution, the graph structure making device 300 for project management may further include a data updating module for updating data of the graph structure.

[0089] In an exemplary embodiment of the present invention, based on the above solution, the data updating module may include: An incremental update submodule, used to incrementally update the graph structure based on changes in project data to obtain an updated graph structure; A first judgment submodule is used to judge whether the updated graph structure has an isolated subgraph or an invalid connection, and if so, adjust the updated graph structure to obtain an adjusted graph structure; otherwise, output the updated graph structure as the adjusted graph structure and enter the second judgment step; The second judgment submodule is used to judge whether the adjusted graph structure causes a conflict. If so, the optimal update path is determined according to the project rules or priority strategy of the project to optimize and update the adjusted graph structure to obtain the final graph structure; otherwise, the adjusted graph structure is output as the final graph structure.

[0090] In an exemplary embodiment of the present invention, based on the above-mentioned solution, the graph structure making device 300 for project management can also include a data maintenance module for periodically checking, cleaning data and verifying integrity of the graph structure to achieve maintenance of the graph structure.

[0091] It should be noted that although several modules and submodules of the graph structure making device for project management are mentioned in the above detailed description, this division is not mandatory. In fact, according to an embodiment of the present invention, the features and functions of two or more modules or submodules described above can be concretized in one module or unit. Conversely, the features and functions of one module or submodule described above can be further divided into multiple modules or submodules to be concretized.

[0092] In addition, in an exemplary embodiment of the present invention, an electronic device capable of implementing the above-mentioned graph structure making method for project management is also provided.

[0093] Those skilled in the art will appreciate that various aspects of the present invention may be implemented as systems, methods or program products. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: complete hardware embodiments, complete software embodiments (including firmware, microcode, etc.), or embodiments combining hardware and software aspects, which may be collectively referred to herein as "circuits", "modules" or "systems".

[0094] Refer to the following Figure 4 An electronic device 400 according to such an embodiment of the present invention is described. Figure 4 The electronic device 400 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0095] like Figure 4 As shown, the electronic device 400 is in the form of a general computing device. The components of the electronic device 400 may include but are not limited to: the at least one processing unit 410, the at least one storage unit 420, a bus 430 connecting different system components (including the storage unit 420 and the processing unit 410), and a display unit 440.

[0096] The storage unit stores program codes, which can be executed by the processing unit 410, so that the processing unit 410 performs the steps of various exemplary embodiments of the present invention described in the above “Exemplary Method” section. For example, the processing unit 410 can perform the following steps: Figure 2 As shown in S210: extracting valid information items from all data related to the project; S220: constructing a graph structure relationship based on the valid information items; S230: generating a graph structure representing the project data based on the graph structure relationship.

[0097] The storage unit 420 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 421 and / or a cache memory unit 422 , and may further include a read-only memory unit (ROM) 423 .

[0098] The storage unit 420 may also include a program / utility 424 having a set (at least one) of program modules 425, such program modules 425 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0099] Bus 430 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0100] The electronic device 400 may also communicate with one or more external devices 470 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 400, and / or communicate with any device that enables the electronic device 400 to communicate with one or more other computing devices (e.g., routers, modems, etc.). This communication may be performed through an input / output (I / O) interface 450. In addition, the electronic device 400 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter 460. As shown, the network adapter 460 communicates with other modules of the electronic device 400 through a bus 430. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0101] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the exemplary embodiments described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiment of the present invention.

[0102] In an exemplary embodiment of the present invention, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present invention is stored. In some possible embodiments, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to perform the steps of various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present invention.

[0103] refer to Figure 5 As shown, a program product 500 for implementing the above-mentioned method for making a graph structure for project management according to an embodiment of the present invention is described, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto. In the present invention, the readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0104] The program product may use any combination of one or more readable storage media. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0105] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0106] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0107] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the exemplary embodiments described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiment of the present invention.

[0108] Other embodiments of the invention will readily occur to those skilled in the art after considering the specification and practicing the invention disclosed herein. The invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of the invention are indicated by the claims.

[0109] It should be understood that the present invention is not limited to the exact construction that has been described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.

Claims

1. A method for making a graph structure for project management, characterized in that: include: Extract valid information items from all data related to the project; Constructing a graph structure relationship based on the valid information items; Based on the graph structure relationship, a graph structure representing the project data is generated.

2. The method for making a graph structure for project management according to claim 1, characterized in that: The extracting of valid information items from all data related to the project includes: Collect all data related to the project, where all data related to the project comes from project documents, including contracts, forms, applications, correspondence and invoices; Preprocessing each of the data related to the project using natural language processing technology to obtain a set of structural information items; Merge all the sets of structural information items to obtain a set of global information items; The set of global information items is output as the valid information items.

3. The method for making a graph structure for project management according to claim 1, characterized in that: Constructing a graph structure relationship based on the valid information items includes: Classifying and parsing each of the valid information items to identify important elements that play a key role in project management; Mapping the important elements into nodes and edges, wherein the nodes represent entities in the project and the edges represent the relationships between the entities; Scoring the nodes and edges to obtain scoring results; According to the scoring results, target nodes and target edges with scores exceeding a preset threshold are screened out; The target node and the target edge are output as the graph structure relationship.

4. The method for making a graph structure for project management according to claim 3, characterized in that: Based on the graph structure relationship, generating a graph structure representing the project data includes: The target nodes and the target edges are mapped into a graph structure representing the project data.

5. The method for making a graph structure for project management according to any one of claims 1 to 4, characterized in that: The graph structure production method for project management also includes: Incremental update step: incrementally updating the graph structure based on changes in project data to obtain an updated graph structure; The first judgment step: judging whether the updated graph structure has an isolated subgraph or an invalid connection, if so, adjusting the updated graph structure to obtain an adjusted graph structure; otherwise, outputting the updated graph structure as the adjusted graph structure and entering the second judgment step; The second judgment step: judge whether the adjusted graph structure causes a conflict. If so, determine the optimal update path according to the project rules or priority strategy of the project to optimize and update the adjusted graph structure to obtain the final graph structure; otherwise, output the adjusted graph structure as the final graph structure.

6. The method for making a graph structure for project management according to claim 5, characterized in that: The incremental updating of the graph structure based on the project data change includes: Add new nodes and edges, modify the properties of existing nodes and edges, and remove obsolete nodes and edges.

7. The method for making a graph structure for project management according to any one of claims 1 to 4 and 6, characterized in that: The graph structure production method for project management also includes: The graph structure is periodically checked, data cleaned, and integrity checked to achieve maintenance of the graph structure.

8. A graph structure making device for project management, characterized in that: include: An information item extraction module, used to extract valid information items from all data related to the project; A graph structure relationship building module, used to build a graph structure relationship based on the valid information items; A graph structure generation module is used to generate a graph structure representing the project data based on the graph structure relationship.

9. An electronic device, characterized in that: include: processor; as well as A memory having computer-readable instructions stored thereon, wherein the computer-readable instructions, when executed by the processor, implement the method for producing a graph structure for project management as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor, the method for producing a graph structure for project management as described in any one of claims 1 to 7 is implemented.

Images