A knowledge graph construction method, device, electronic device and readable storage medium
By collecting and preprocessing software information, analyzing and processing, expanding the knowledge graph knowledge base, and building a software knowledge graph, the problem of inability to build a software knowledge graph in the financial industry is solved, software impact assessment and dependency retrieval are realized, and software development efficiency is improved.
Patent Information
- Application Number
- CN202010695185.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-07-19
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2040-07-19
AI Technical Summary
In industries such as finance, resources such as source code, Q&A documents, etc. of software projects cannot be obtained, resulting in the inability to build a software knowledge graph, and the code-level knowledge graph cannot evaluate the impact of software version upgrades.
By collecting and preprocessing sample software information, determine the knowledge graph knowledge base, analyze and process mining feature data, expand the knowledge graph knowledge base, and build a software knowledge graph, including parsing directory structure and file formats, decompressing software packages or decompiling programs, and obtaining concepts Set and attribute set elements.
When software project information resources cannot be obtained, a knowledge base is established through diversified analysis and processing, entity extraction and association are realized, and software project knowledge graph is built, with a wide range of application, improving software development efficiency, and reducing version conflicts.
Smart Images

Figure CN111914098B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of information processing technology, and in particular to a method, device, electronic device and readable storage medium for constructing a knowledge graph. Background Art
[0002] Knowledge Graph, also known as knowledge domain visualization or knowledge domain mapping map, is a series of various graphics that show the development process and structural relationship of knowledge. It uses visualization technology to describe knowledge resources and their carriers, and mines, analyzes, constructs, draws and displays knowledge and their mutual connections. In the field of software technology, the construction of software knowledge graphs mainly relies on software resources such as source code, question and answer documents, and requirements / design documents of software projects. The generated knowledge graphs are mainly oriented to the code level. However, in industries such as finance, most software is developed by third-party commercial companies, and it is impossible to obtain software resources such as source code, question and answer documents, and requirements / design documents of software projects. Therefore, it is impossible to extract packages, classes, interfaces, methods, attributes, exceptions, method parameters and return values, and the relationship between these elements, so it is impossible to establish a knowledge graph for software projects. In addition, for the knowledge graph at the code level, it is impossible to evaluate the impact relationship such as software version upgrades. Summary of the invention
[0003] The purpose of this application is to solve at least one of the above technical defects. The technical solution adopted by this application is as follows:
[0004] In a first aspect, an embodiment of the present application provides a method for constructing a knowledge graph, the method comprising:
[0005] Collecting sample software information and preprocessing the sample software information to obtain preprocessed data;
[0006] Determine a knowledge graph knowledge base according to the preprocessed data and preset rules;
[0007] Analyze and process sample software information to mine feature data and expand the knowledge graph knowledge base;
[0008] A software knowledge graph is constructed based on the expanded knowledge graph knowledge base.
[0009] Optionally, the sample collection software information includes but is not limited to:
[0010] Collect sample software warehouse, software installation package name, directory structure information, build information and program running information.
[0011] Optionally, determining the knowledge graph knowledge base according to the preprocessed data and preset rules includes:
[0012] Determine a knowledge base of the knowledge graph based on preprocessed data and software domain expert knowledge, wherein the knowledge base includes a concept set and an attribute set of the sample software;
[0013] The concept set is used as the entity for constructing the knowledge graph, and the attribute set is used as the entity association for constructing the knowledge graph.
[0014] Optionally, the analyzing and processing of the sample software information to mine feature data and expand the knowledge graph knowledge base includes:
[0015] The software information of the sample software is analyzed and processed to expand the concept set and attribute set of the knowledge base.
[0016] Optionally, the analyzing and processing the software information of the sample software to expand the concept set and attribute set of the knowledge graph knowledge base includes at least one of the following:
[0017] Analyze the sample software directory structure information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0018] Parse the sample software file format construction information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0019] Decompress the software package in a specific format or decompile the software program to obtain the concept set elements and attribute set elements of the knowledge graph;
[0020] The elements of the concept set include, but are not limited to: the name, version, packaging mechanism, user description of the software, official address of the development team, classification, compilation information, and environment information of the sample software;
[0021] The attribute set elements include but are not limited to: belong to, include, plug-in, inherit, aggregate, and depend on.
[0022] Optionally, the method further comprises:
[0023] Analyze the process or directory relationship of the sample software program during runtime;
[0024] Mining the runtime relationships of sample software projects;
[0025] Associating the mined relationship during the running state with the determined knowledge graph knowledge base as knowledge items;
[0026] According to the association results, the dependencies of hot loading, distributed program deployment and calling of the sample software are obtained;
[0027] The dependencies of hot loading, distributed program deployment and calling are expanded into the attribute set of the knowledge graph knowledge base.
[0028] In a second aspect, an embodiment of the present application provides a knowledge graph construction device, the device comprising: a collection module, a processing module, a storage module and a construction module; wherein:
[0029] The acquisition module is used to acquire sample software information;
[0030] The processing module is used to pre-process the sample software information to obtain pre-processed data;
[0031] The processing module is further used to determine the knowledge graph knowledge base according to the preprocessed data and preset rules;
[0032] The processing module is also used to analyze and process the sample software information to mine feature data and expand the knowledge graph knowledge base;
[0033] The construction module is used to construct a software knowledge graph based on the expanded knowledge graph knowledge base;
[0034] The storage module is used to store preset rules, preprocessed data and knowledge graph knowledge base.
[0035] Optionally, the processing module is specifically used to determine a knowledge base of the knowledge graph based on the preprocessed data and software domain expert knowledge, wherein the knowledge base includes a concept set and an attribute set of the sample software;
[0036] The concept set is used as the entity for constructing the knowledge graph, and the attribute set is used as the entity association for constructing the knowledge graph.
[0037] Optionally, the processing module is further configured to perform at least one of the following:
[0038] Analyze the sample software directory structure information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0039] Parse the sample software file format construction information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0040] Decompress the software package in a specific format or decompile the software program to obtain the concept set elements and attribute set elements of the knowledge graph;
[0041] The elements of the concept set include, but are not limited to: the name, version, packaging mechanism, user description of the software, official address of the development team, classification, compilation information, and environment information of the sample software;
[0042] The attribute set elements include but are not limited to: belong to, include, plug-in, inherit, aggregate, and depend on.
[0043] Optionally, the processing module is further used for:
[0044] Analyze the process or directory relationship of the sample software program during runtime;
[0045] Mining the runtime relationships of sample software projects;
[0046] Associating the mined relationship during the running state with the determined knowledge graph knowledge base as knowledge items;
[0047] According to the association results, the dependencies of hot loading, distributed program deployment and calling of the sample software are obtained;
[0048] The dependencies of hot loading, distributed program deployment and calling are expanded into the attribute set of the knowledge graph knowledge base.
[0049] In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory;
[0050] The memory is used to store operation instructions;
[0051] The processor is used to execute the above-mentioned knowledge graph construction method by calling the operation instruction.
[0052] In a fourth aspect, a computer-readable storage medium is provided, wherein a computer program is stored on the storage medium, and when the computer program is executed by a processor, the method for constructing the knowledge graph is implemented.
[0053] The beneficial effects brought by the technical solution provided by the embodiment of the present application are as follows: the knowledge graph construction method provided by the embodiment of the present application includes: collecting sample software information and preprocessing the sample software information to obtain preprocessed data; determining the knowledge graph knowledge base according to the preprocessed data and preset rules; analyzing and processing the sample software information to mine feature data to expand the knowledge graph knowledge base; and constructing a software knowledge graph according to the expanded knowledge graph knowledge base. In the context of data sparsity caused by the inability to obtain software project information resources, the technical solution of the present application establishes a knowledge base through diversified analysis and processing of sample software to realize entity extraction and entity association extraction, and constructs a software project knowledge graph. The knowledge graph construction method has a wide range of applications and strong scalability, and can better help software developers to perform software impact assessment, dependency retrieval, and code generation or verification, etc., improve software development efficiency, and reduce problems such as software version conflicts. BRIEF DESCRIPTION OF THE DRAWINGS
[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in describing the embodiments of the present application.
[0055] Figure 1 A schematic diagram of a process for constructing a knowledge graph provided in an embodiment of the present application;
[0056] Figure 2 A schematic diagram of the structure of a knowledge graph construction device provided in an embodiment of the present application;
[0057] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0058] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and cannot be interpreted as limiting the present invention.
[0059] Those skilled in the art will appreciate that, unless otherwise stated, the singular forms "a", "an", "said" and "the" used herein may also include plural forms. It should be further understood that the term "comprising" used in the specification of the present application refers to the presence of the features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof. The term "and / or" used herein includes all or any unit and all combinations of one or more associated listed items.
[0060] The embodiments of the present application relate to the technology for constructing a knowledge graph for a software project. Based on the difficulties in constructing a knowledge graph for a software project introduced in the background technology, the present application proposes a method for constructing a knowledge graph. The technical scheme of the present application and how the technical scheme of the present application solves the above-mentioned technical problems will be described in detail below in conjunction with the accompanying drawings. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.
[0061] In order to make the purpose, technical solutions and advantages of this application clearer, Figure 1 A flowchart of a knowledge graph construction method provided in an embodiment of the present application is disclosed, such as Figure 1 As shown, the knowledge graph construction method includes:
[0062] S101, collecting sample software information and preprocessing the sample software information to obtain preprocessed data;
[0063] S102, determining a knowledge graph knowledge base according to the preprocessed data and preset rules;
[0064] S103, analyzing and processing the sample software information to mine feature data and expand the knowledge graph knowledge base;
[0065] S104. Construct a software knowledge graph based on the expanded knowledge graph knowledge base.
[0066] Furthermore, the sample collection software information in the embodiments of the present application includes but is not limited to:
[0067] Collect sample software warehouse, software installation package name, directory structure information, build information and program running information. The build information includes the build information included in the software files in formats such as pom.xml, build.gradle, build.sbt, and build.xml.
[0068] Further, in an embodiment of the present application, according to the preprocessed data and preset rules, determining the knowledge graph knowledge base includes: according to the preprocessed data, and in combination with the domain knowledge of software domain experts, establishing the top-level and core knowledge base core concept set and attribute set to determine the knowledge base of the knowledge graph, the knowledge base includes the concept set and attribute set of the sample software; wherein the concept set is used as an entity for constructing the knowledge graph, and the attribute set is used as an entity association for constructing the knowledge graph. This step should ensure the correctness of the established concepts and attributes, and the integrity can be temporarily not too high. The established knowledge base is an RDF / OWL file representing the definition of the core concept set and attribute set to solve the "cold start" problem of the core ontology of the knowledge base.
[0069] Furthermore, in an embodiment of the present application, the analyzing and processing of sample software information to mine feature data and expand the knowledge graph knowledge base includes: analyzing and processing the software information of the sample software to expand the concept set and attribute set of the knowledge base.
[0070] Optionally, the software information of the sample software may be analyzed and processed to expand the concept set and attribute set of the knowledge graph knowledge base through the following steps:
[0071] 1) Analyze the sample software directory structure information to obtain the knowledge graph concept set elements and attribute set elements; that is, extract the name, version, dependency and other information of the software project through the sample software deployment file structure information.
[0072] 2) Parse the sample software file format build information to obtain the knowledge graph concept set elements and attribute set elements; that is, by parsing the pom.xml, build.gradle, build.sbt, build.xml and other build information of the sample software package, obtain the sample software's project information, compilation information, environment information, inheritance, aggregation and dependency information.
[0073] 3) Unzip a software package in a specific format or decompile a software program to obtain the concept set elements and attribute set elements of the knowledge graph; that is, extract the name, version, dependency and other information of the sample software project by unzipping a sample software package in JAR format or decompiling a software program.
[0074] Among them, the concept set elements include but are not limited to: the name, version, packaging mechanism, user description of the software name, official address of the development team, classification, compilation information, and environmental information of the sample software; the attribute set elements include but are not limited to: belonging, including, plug-in, inheritance, aggregation, and dependency.
[0075] The above embodiments mainly perform a series of static and dynamic analysis and processing on the sample software project file structure, build information and decompilation results, etc., when it is impossible to obtain software resources such as software source code, question and answer documents, and requirement / design documents, extract feature data, and discover new concepts and attributes. The knowledge base concept set constructed in the above embodiments is expanded (including projects or organizations, common names of projects, versions of projects, packaging mechanisms, names of user-described projects, official addresses of development teams, classifications and other project information, compilation information, environmental information, etc.) as entities of the pre-built knowledge graph of sample software projects, and the attribute set of the above knowledge base is expanded (including relationships such as belonging, inclusion, plug-in, inheritance, aggregation and dependency) as entity associations of the pre-built knowledge graph.
[0076] In an optional embodiment, the method for expanding the attribute set of the knowledge base described in the present application can also be adopted: analyzing the process or directory relationship of the sample software program in the running state; mining the relationship of the sample software project in the running state; associating the mined relationship in the running state with the knowledge items of the determined knowledge graph knowledge base; according to the association result, obtaining the dependency relationship of hot loading, distributed program deployment and calling of the sample software; expanding the dependency relationship of hot loading, distributed program deployment and calling into the attribute set of the knowledge graph knowledge base.
[0077] Through the above embodiments, a software knowledge base including a concept set and an attribute set is obtained, with concept set elements as entities of the pre-constructed knowledge graph, and attribute set elements as entity associations of the pre-constructed knowledge graph. Furthermore, entities are used as nodes and entity associations as edges to complete the construction of the software knowledge graph disclosed in this application.
[0078] based on Figure 1 The knowledge graph construction method provided by the illustrated embodiment, Figure 2 It is shown that the present application embodiment provides a knowledge graph construction device, such as Figure 2 As shown, the device includes: 201 acquisition module, 202 processing module, 203 storage module and 204 construction module; wherein,
[0079] The acquisition module 201 is used to acquire sample software information;
[0080] The processing module 202 is used to pre-process the sample software information to obtain pre-processed data;
[0081] The processing module 202 is further used to determine a knowledge graph knowledge base according to the pre-processed data and preset rules;
[0082] The processing module 202 is also used to analyze and process the sample software information to mine feature data and expand the knowledge graph knowledge base;
[0083] The 204 construction module is used to construct a software knowledge graph according to the expanded knowledge graph knowledge base;
[0084] The 203 storage module is used to store preset rules, pre-processed data and knowledge graph knowledge base.
[0085] In an embodiment of the present application, the collection module is used to collect information such as sample software warehouse, software installation package name, directory structure information, build information and program running information.
[0086] In an embodiment of the present application, the processing module is specifically used to determine a knowledge base of the knowledge graph based on preprocessed data and software domain expert knowledge, wherein the knowledge base includes a concept set and an attribute set of the sample software;
[0087] The concept set is used as the entity for constructing the knowledge graph, and the attribute set is used as the entity association for constructing the knowledge graph.
[0088] In the embodiment of the present application, the processing module is further used to analyze and process the software information of the sample software to expand the concept set and attribute set of the knowledge base.
[0089] In the embodiment of the present application, the processing module is further configured to perform at least one of the following:
[0090] Analyze the sample software directory structure information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0091] Parse the sample software file format construction information to obtain the knowledge graph concept set elements and attribute set elements; or,
[0092] Decompress the software package in a specific format or decompile the software program to obtain the concept set elements and attribute set elements of the knowledge graph;
[0093] The elements of the concept set include, but are not limited to: the name, version, packaging mechanism, user description of the software, official address of the development team, classification, compilation information, and environment information of the sample software;
[0094] The attribute set elements include but are not limited to: belong to, include, plug-in, inherit, aggregate, and depend on.
[0095] In an embodiment of the present application, the processing module is also used to: analyze the process or directory relationship of the sample software program in the running state; mine the relationship of the sample software project in the running state; associate the mined relationship in the running state with the knowledge items of the determined knowledge graph knowledge base; obtain the dependency relationship of hot loading, distributed program deployment and calling of the sample software based on the association result; expand the dependency relationship of hot loading, distributed program deployment and calling into the attribute set of the knowledge graph knowledge base.
[0096] It can be understood that the above modules of the knowledge graph construction device in this embodiment have the function of realizing Figure 1 The functions of the corresponding steps of the method in the embodiment shown in . The function can be implemented by hardware, or by hardware executing the corresponding software. The hardware or software includes one or more modules corresponding to the above functions. The above modules can be software and / or hardware, and the above modules can be implemented separately or integrated with multiple modules. For the functional description of the above modules, please refer to Figure 1 The corresponding description of the method in the embodiment shown in will not be repeated here.
[0097] An embodiment of the present application provides an electronic device, including a processor and a memory;
[0098] A memory, used for storing operation instructions;
[0099] A processor is used to execute the knowledge graph construction method provided in any embodiment of the present application by calling an operation instruction.
[0100] As an example, Figure 3 A schematic diagram of the structure of an electronic device applicable to the embodiment of the present application is shown. Figure 3 As shown, the electronic device 2000 includes: a processor 2001 and a memory 2003. The processor 2001 and the memory 2003 are connected, such as through a bus 2002. Optionally, the electronic device 2000 may also include a transceiver 2004. It should be noted that in actual applications, the transceiver 2004 is not limited to one, and the structure of the electronic device 2000 does not constitute a limitation on the embodiments of the present application.
[0101] The processor 2001 is applied in the embodiment of the present application to implement the method shown in the above method embodiment. The transceiver 2004 may include a receiver and a transmitter. The transceiver 2004 is applied in the embodiment of the present application to implement the function of the electronic device of the embodiment of the present application communicating with other devices when executed.
[0102] Processor 2001 may be a CPU (Central Processing Unit), a general purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It may implement or execute various exemplary logic blocks, modules and circuits described in conjunction with the disclosure of this application. Processor 2001 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.
[0103] The bus 2002 may include a path to transmit information between the above components. The bus 2002 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus 2002 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0104] The memory 2003 can be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical disk storage, optical disk storage (including compressed optical disk, laser disk, optical disk, digital versatile disk, Blu-ray disk, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited to these.
[0105] Optionally, the memory 2003 is used to store application code for executing the solution of the present application, and the execution is controlled by the processor 2001. The processor 2001 is used to execute the application code stored in the memory 2003 to implement the knowledge graph construction method provided in any embodiment of the present application.
[0106] The electronic device provided in the embodiment of the present application is applicable to any embodiment of the above method and will not be described in detail here.
[0107] An embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the knowledge graph construction method shown in the above method embodiment is implemented.
[0108] The computer-readable storage medium provided in the embodiments of the present application is applicable to any embodiment of the above method and will not be described in detail here.
[0109] The knowledge graph construction scheme provided in the embodiment of the present application obtains preprocessed data by collecting sample software information and preprocessing the sample software information; determines the knowledge graph knowledge base according to the preprocessed data and preset rules; analyzes and processes the sample software information to mine feature data to expand the knowledge graph knowledge base; and constructs a software knowledge graph according to the expanded knowledge graph knowledge base. In the context of data sparsity due to the inability to obtain software project information resources, the technical scheme of the present application establishes a knowledge base by performing diversified analysis and processing on sample software to achieve entity extraction and entity association extraction, and constructs a software project knowledge graph. The knowledge graph construction method has a wide range of applications and strong scalability, and can better help software developers perform software impact assessment, dependency retrieval, and code generation or verification, etc., improve software development efficiency, and reduce problems such as software version conflicts.
[0110] It should be understood that, although the steps in the flowchart of the accompanying drawings are displayed in sequence as indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least a part of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.
[0111] The above are only some embodiments of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A knowledge graph construction method, characterized in that: The method comprises: Collecting sample software information and preprocessing the sample software information to obtain preprocessed data; Determine a knowledge graph knowledge base according to the preprocessed data and preset rules; Analyze and process sample software information to mine feature data and expand the knowledge graph knowledge base; Build a software knowledge graph based on the expanded knowledge graph knowledge base; The sample collection software information includes: Collect sample software warehouse, software installation package name, directory structure information, build information, and program running information; According to the preprocessed data and preset rules, the knowledge graph knowledge base is determined to include: Determine a knowledge base of the knowledge graph based on preprocessed data and software domain expert knowledge, wherein the knowledge base includes a concept set and an attribute set of the sample software; The concept set is used as the entity to construct the knowledge graph, and the attribute set is used as the entity association to construct the knowledge graph; The method further comprises: Analyze the process or directory relationship of the sample software program during runtime; Mining relationships when running status of sample software projects; Associating the mined relationship during the operation state with the determined knowledge graph knowledge base for knowledge items; According to the correlation results, the hot loading, distributed program deployment and calling dependencies of the sample software are obtained; The dependencies of hot loading, distributed program deployment and calling are expanded into the attribute set of the knowledge graph knowledge base.
2. The knowledge graph construction method according to claim 1, characterized in that: The analyzing and processing of the sample software information to mine feature data and expand the knowledge graph knowledge base includes: The software information of the sample software is analyzed and processed to expand the concept set and attribute set of the knowledge base.
3. The knowledge graph construction method according to claim 2, characterized in that: The step of analyzing and processing the software information of the sample software to expand the concept set and attribute set of the knowledge base includes at least one of the following: Analyze the sample software directory structure information to obtain the knowledge graph concept set elements and attribute set elements; or, Parse the sample software file format construction information to obtain the knowledge graph concept set elements and attribute set elements; or, Decompress the format software package or decompile the software program to obtain the knowledge graph concept set elements and attribute set elements; The elements of the concept set include: project information, compilation information, and environment information; the project information includes: the name, version, packaging mechanism, user description of the software, official address of the development team, and classification of the sample software; The attribute set elements include: belongs, includes, plug-in, inherits, aggregates, and depends on.
4. A knowledge graph construction device, characterized in that: The device comprises: a collection module, a processing module, a storage module and a construction module; wherein, The acquisition module is used to acquire sample software information; The processing module is used to pre-process the sample software information to obtain pre-processed data; The processing module is further used to determine the knowledge graph knowledge base according to the preprocessed data and preset rules; The processing module is also used to analyze and process the sample software information to mine feature data and expand the knowledge graph knowledge base; The construction module is used to construct a software knowledge graph based on the expanded knowledge graph knowledge base; The storage module is used to store preset rules, preprocessed data and knowledge graph knowledge base; The sample collection software information includes: Collect sample software warehouse, software installation package name, directory structure information, build information, and program running information; According to the preprocessed data and preset rules, the knowledge graph knowledge base is determined to include: The processing module is specifically used to determine a knowledge base of the knowledge graph based on preprocessed data and software domain expert knowledge, wherein the knowledge base includes a concept set and an attribute set of sample software; The concept set is used as the entity to construct the knowledge graph, and the attribute set is used as the entity association to construct the knowledge graph; The processing module is also used for: Analyze the process or directory relationship of the sample software program during runtime; Mining relationships when running status of sample software projects; Associating the mined relationship during the operation state with the determined knowledge graph knowledge base for knowledge items; According to the correlation results, the hot loading, distributed program deployment and calling dependencies of the sample software are obtained; The dependencies of hot loading, distributed program deployment and calling are expanded into the attribute set of the knowledge graph knowledge base.
5. An electronic device, characterized in that: including a processor and a memory; The memory is used to store operation instructions; The processor is used to execute the method according to any one of claims 1 to 3 by calling the operation instruction.
6. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.
