CN115114452A - Method and device for converting Visio flow chart into knowledge graph - Google Patents

Method and device for converting Visio flow chart into knowledge graph Download PDF

Info

Publication number
CN115114452A
CN115114452A CN202210743275.9A CN202210743275A CN115114452A CN 115114452 A CN115114452 A CN 115114452A CN 202210743275 A CN202210743275 A CN 202210743275A CN 115114452 A CN115114452 A CN 115114452A
Authority
CN
China
Prior art keywords
information
graph
node
determining
nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210743275.9A
Other languages
Chinese (zh)
Inventor
郭少敏
韩英
吴树海
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bank of China Ltd
Original Assignee
Bank of China Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bank of China Ltd filed Critical Bank of China Ltd
Priority to CN202210743275.9A priority Critical patent/CN115114452A/en
Publication of CN115114452A publication Critical patent/CN115114452A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Animal Behavior & Ethology (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application provides a method and a device for converting a Visio flow chart into a knowledge graph, wherein the method comprises the following steps: the method comprises the steps of obtaining an extensible markup language file of a Visio flow chart, determining the graph information as node information of a knowledge graph and the connection information between two graphs according to a mapping relation, determining the connection information as relation information between the two nodes, and establishing the knowledge graph according to the node information and the relation information between the two nodes. That is, the graph information of the Visio flowchart and the connection information between two graphs can be determined as the node information of the knowledge graph through the mapping relationship and the connection information is determined as the relationship information between two nodes, so that the knowledge graph can be constructed by using the node information and the relationship information, and the Visio flowchart can be converted into the knowledge graph.

Description

Method and device for converting Visio flow chart into knowledge graph
Technical Field
The invention relates to the field of computers, in particular to a method and a device for converting a Visio flow chart into a knowledge graph.
Background
With the development of finance and computers in the current society, more and more financial trades are related, and as one of the important links for carrying out financial trades, a core system for carrying out data processing on the financial trades is required by banks.
The Visio tool software can be used for drawing a system architecture diagram, a flow chart or a system relation diagram and the like of the bank core system. However, these graphs only visually show the relationships between systems or within systems, and if automatic searching or learning through the relationships between nodes is desired, a knowledge graph with data of the association relationships between systems needs to be constructed.
Therefore, a method for converting a Visio flowchart into a knowledge graph is needed.
Disclosure of Invention
In view of the above, an object of the present application is to provide a method and an apparatus for converting a Visio flowchart into a knowledge graph, which can realize management and utilization of a system from visualization to a knowledge graph.
The embodiment of the application provides a method for converting a Visio flow chart into a knowledge graph, which comprises the following steps:
acquiring an extensible markup language file of a Visio flow chart, wherein the extensible markup language file comprises graphic information and connection information between two graphics;
according to the mapping relation, determining the graph information as node information of a knowledge graph and determining the connection information as relation information between two nodes;
and establishing a knowledge graph according to the node information and the relation information between the two nodes.
Optionally, the graph information includes a graph number, a graph type, and a graph name, and the node information includes a node number, a node tag, and a node attribute;
determining the graph information as node information of the knowledge graph according to the mapping relationship comprises:
and according to the mapping relation, determining the graph number as the node number of the knowledge graph, determining the graph type as the node label of the knowledge graph, and determining the graph name as the node attribute of the knowledge graph.
Optionally, the connection information between the two graphs includes a starting graph number, an ending graph number, a connection type between the two graphs, and a connection name between the two graphs, and the relationship information between the two nodes includes a starting node number, an ending node number, a relationship label between the two nodes, and a relationship attribute between the two nodes;
determining the connection information as relationship information between two nodes according to the mapping relationship includes:
and according to the mapping relation, determining the number of the starting graph as the number of the starting node, determining the number of the ending graph as the number of the ending node, determining the type of a connecting line between the two graphs as a relation label between the two nodes, and determining the name of the connecting line between the two graphs as a relation attribute between the two nodes.
Optionally, the method further comprises:
and monitoring the process of converting the Visio flow chart into the knowledge graph in real time.
Optionally, the method further comprises:
and pre-configuring a mapping relation between the graph information and node information of the knowledge graph and a mapping relation between the connection information and the relation information.
The embodiment of the application provides a device for converting a Visio flow chart into a knowledge graph, which comprises:
the acquiring unit is used for acquiring an extensible markup language file of the Visio flow chart, wherein the extensible markup language file comprises graphic information and connection information between two graphics;
the determining unit is used for determining the graph information as node information of a knowledge graph and determining the connection information as relationship information between two nodes according to the mapping relationship;
and the establishing unit is used for establishing a knowledge graph according to the node information and the relation information between the two nodes.
Optionally, the graph information includes a graph number, a graph type, and a graph name, and the node information includes a node number, a node tag, and a node attribute;
the determining unit is specifically configured to:
and according to the mapping relation, determining the graph number as the node number of the knowledge graph, determining the graph type as the node label of the knowledge graph, and determining the graph name as the node attribute of the knowledge graph.
Optionally, the connection information between the two graphs includes a starting graph number, an ending graph number, a connection type between the two graphs, and a connection name between the two graphs, and the relationship information between the two nodes includes a starting node number, an ending node number, a relationship label between the two nodes, and a relationship attribute between the two nodes;
the determining unit is specifically configured to:
and according to the mapping relation, determining the number of the starting graph as the number of the starting node, determining the number of the ending graph as the number of the ending node, determining the type of a connecting line between the two graphs as a relation label between the two nodes, and determining the name of the connecting line between the two graphs as a relation attribute between the two nodes.
Optionally, the apparatus further comprises:
and the monitoring unit is used for monitoring the process of converting the Visio flow chart into the knowledge graph in real time.
Optionally, the apparatus further comprises:
and the configuration unit is used for configuring the mapping relationship between the graph information and the node information of the knowledge graph and the mapping relationship between the connection information and the relationship information in advance.
The embodiment of the application provides a method for converting a Visio flow chart into a knowledge graph, which comprises the following steps: the method comprises the steps of obtaining an extensible markup language file of a Visio flow chart, determining the graph information as node information of a knowledge graph and the connection information between two graphs according to a mapping relation, determining the connection information as relation information between the two nodes, and establishing the knowledge graph according to the node information and the relation information between the two nodes. That is, the graph information of the Visio flowchart and the connection information between two graphs can be determined as the node information of the knowledge graph through the mapping relationship and the connection information is determined as the relationship information between two nodes, so that the knowledge graph can be constructed by using the node information and the relationship information, and the Visio flowchart can be converted into the knowledge graph.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a schematic flow chart diagram illustrating a method for converting a Visio flow chart into a knowledge graph according to an embodiment of the present application;
FIG. 2 is a schematic view illustrating a Visio process provided by an embodiment of the present application;
FIG. 3 illustrates a schematic view of a knowledge-graph provided by an embodiment of the present application;
fig. 4 shows a schematic structural diagram of an apparatus for converting a Visio flowchart into a knowledge graph according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application, but the present application may be practiced in other ways than those described herein, and it will be apparent to those of ordinary skill in the art that the present application is not limited by the specific embodiments disclosed below.
The method and the device for converting the Visio flow chart into the knowledge graph can be used in the financial field or other fields, for example, the method and the device can be used in a Viso flow chart and knowledge graph conversion application scene in the financial field. The other fields are arbitrary fields other than the financial field, for example, the computer field. The above is only an example, and the application fields of the method and the apparatus for converting the Visio flowchart into the knowledge graph provided by the invention are not limited.
With the development of finance and computers in the current society, more and more financial trades are related, and as one of the important links for carrying out financial trades, a core system for carrying out data processing on the financial trades is required by banks.
The system architecture diagram, the flow chart or the system relationship diagram of the bank core system can be drawn by using Visio tool software, the diagrams are visual representations of the association relationship between systems to be developed or existing systems and the mutual relationship between steps, but the diagrams basically only provide visual understanding, the association between the systems is searched by eyes, but if the automatic searching or learning is carried out through the relationship between nodes, a knowledge graph with the association relationship data between the systems needs to be constructed. The direct connection system and the indirect connection system of the N level of each system and the properties of the contact can be quickly obtained through the knowledge graph. The knowledge graph is constructed by converting the relations among all the systems into the form of graph data to be stored, and the relation contained in the Visio graph is arranged into a graph database model to be converted into the knowledge graph.
Therefore, a method for converting a Visio flowchart into a knowledge graph is needed.
Based on this, the embodiment of the present application provides a method for converting a Visio flowchart into a knowledge graph, where the method includes: the method comprises the steps of obtaining an extensible markup language file of a Visio flow chart, determining the graph information as node information of a knowledge graph and the connection information between two graphs according to a mapping relation, determining the connection information as relation information between the two nodes, and establishing the knowledge graph according to the node information and the relation information between the two nodes. That is, the graph information of the Visio flowchart and the connection information between two graphs can be determined as the node information of the knowledge graph through the mapping relationship and the connection information is determined as the relationship information between two nodes, so that the knowledge graph can be constructed by using the node information and the relationship information, and the Visio flowchart can be converted into the knowledge graph.
For a better understanding of the technical solutions and effects of the present application, specific embodiments will be described in detail below with reference to the accompanying drawings.
Referring to fig. 1, the figure is a schematic flow chart of a method for converting a Visio flow chart into a knowledge graph according to an embodiment of the present application.
The method for converting the Visio flowchart into the knowledge graph provided by the embodiment comprises the following steps:
s101, acquiring an extensible markup language file of the Visio flow chart.
In the embodiment of the application, the Visio flow chart file may be stored in a format of an EXtensible Markup Language (XML) file, and the storage by using the XML file format may be more beneficial to converting into a knowledge graph.
The extensible markup language file comprises graph (maps) information and connection (connections) information between two graphs.
As an example, refer to fig. 2, which is a schematic view of a Visio process provided in an embodiment of the present application. The Visio flow diagram is stored in an XML file format as follows:
Figure BDA0003718806520000061
Figure BDA0003718806520000071
-the start end of the arrow indicating shape id 3 is connected to the end of the box with shape id 14 to the box with shape id 1
The start end of the arrow with the ID of 20 is connected to the frame with the ID of 14, namely, < Connect fromsleet ═ 20'FromCell ═ BeginX' fromcart ═ 9 'tosleet ═ 14' ToCell ═ connections, x2'ToPart ═ 101'/>, where ID is 20
The end of the arrow with ID 20 is connected to the frame with ID 15 in < Connect fromsleet ═ 20'FromCell ═ EndX' fromcart ═ 12 'tosleet ═ 15' ToCell ═ connections, x1'ToPart ═ 100'/>, where ID is 20
</Connects>
-the start end of the arrow indicating shape id 20 is connected to the end of the box with shape id 14 to the end of the box with shape id 15
Wherein:
the Shapes segment is information of graphic elements in the graphic, such as: the Shape ID ═ '14' represents the box labeled SYS1, and the Shape ID ═ '2' represents the box labeled SYS 2.
The connections segment is an association relationship between graphic elements, such as: two rows of connection fromsleet ═ 2' represent that there is an association between shape '14' and shape '1' through an arrow with ID ═ 2.
That is, the graphic information includes a graphic number (Shape ID), a graphic type (master), and a graphic name (text), wherein the graphic type may be classified by the Shape of the graphic and may be set in advance.
The link information between two graphs includes a start graph number (begin to list), an end graph number (end to list), a link type between two graphs, and a link name (text) between two graphs.
S102, according to the mapping relation, the graph information is determined as node information of the knowledge graph and the connection information is determined as relation information between two nodes.
In the embodiment of the application, a mapping relationship between the graph information of the XML file of the Visio flowchart and the node information of the knowledge graph and a mapping relationship between the connection information and the relationship information of the XML file of the Visio flowchart may be configured in advance. The mapping relationship may then be used to determine the graphical information as node information of the knowledge-graph and to determine the connection information as relationship information between two nodes.
In practical application, the mapping relationship can be provided for a user to customize, so that the mapping relationship can be expanded and changed conveniently.
The basic elements in the graph model of the knowledge graph include nodes and Relationships. Both nodes and relationships may include Label (Label) and Properties (Properties) information.
Specifically, the node information may include a node number (node id), a node tag (node type), and a node attribute (name). The relationship information between two nodes includes a start node number, an end node number, a relationship label between two nodes, and a relationship attribute between two nodes.
As an example, the graph model may be a Neo4j graph database.
In the embodiment of the application, mapping between the graph information of the Visio flowchart and the node information of the knowledge graph may be performed first, and according to the mapping relationship, the graph number may be determined as the node number of the knowledge graph, the graph type may be determined as the node label of the knowledge graph, and the graph name may be determined as the node attribute of the knowledge graph.
Specifically, the graphs (maps) existing in the connection (connections) information between two graphs may be used as nodes.
Specifically, when the nodes needing mapping are screened, the graphs repeatedly appearing in the connections can be found, that is, the values of all the appeared ToSheets are found, and then duplication is removed. Then locate Shape ID ═ tosleet in Shape segment in XML file, and then map to node information of knowledge graph, such as: shape id is mapped to node id, Shape master is mapped to node type, and text is mapped to name. That is, the node information in the knowledge-graph may be as follows:
CREATE(sys1:System{name:'sys1'}),
wherein sys1 is the node number, System is the node label, i.e. graph type, name 'sys1' is the node attribute.
In the embodiment of the application, after the node mapping is completed, the connection information between two graphs of the Visio flowchart and the relationship information between the two nodes may be mapped, the number of the starting graph may be determined as the number of the starting node, the number of the ending graph may be determined as the number of the ending node, the type of the connection between the two graphs may be determined as the relationship label between the two nodes, and the name of the connection between the two graphs may be determined as the relationship attribute between the two nodes.
Specifically, a starting graph number and an ending graph number of connection information between two graphs are found, two records with the same fromshiet label value in connections are determined in an XML file, the connection information with the same records is determined to be connection information between the two graphs, then a ToSheet value in a record with FromCell ═ BeginX 'is found to be used as the starting graph number, a ToSheet value in a record with FromCell ═ EndX' is found to be used as the ending graph number, and then the starting node number and the ending node number are respectively determined according to the starting graph number and the ending graph number.
It may be determined that connection information between two graphs is mapped to relationship information between two nodes, for example: the type of join (text) between two graphs may be mapped as a relationship attribute. The line type (text) between two graphs can be predefined according to the Visio flowchart, for example, the line type is online for connection, and batch for batch.
That is, the relationship information between two nodes in the knowledge-graph may be as follows:
CREATE(sys1)-[:CALL{type:’online’}]->(sys3),
wherein sys1 is the number of a start node, sys3 is the number of an end node, CALL is a relationship label between two nodes and is a CALL label, and type: 'online' is the relationship attribute between the two nodes.
As an example, refer to fig. 3, which is a schematic diagram of a knowledge graph provided in the embodiment of the present application. The knowledge graph shown in fig. 3 is obtained by converting the Visio flowchart shown in fig. 2, and the node information and the relationship information between two nodes of the knowledge graph shown in fig. 3 may be as follows:
node information:
CREATE(sys1:System{name:'sys1'}),
CREATE(sys2:System{name:'sys2'}),
CREATE(sys3:System{name:'sys3'}),
relationship information between two nodes:
CREATE(sys1)-[:CALL{type:’online’}]->(sys3),
CREATE(sys1)-[:CALL{type:’batch’}]->(sys2)。
s103, establishing a knowledge graph according to the node information and the relation information between the two nodes.
In the embodiment of the application, after the node information of the knowledge graph and the relationship information between two nodes are obtained according to the mapping relationship, the knowledge graph can be established according to the node information and the relationship information between two nodes.
In the embodiment of the application, the process of converting the Visio flow chart into the knowledge graph can be monitored in real time. Specifically, a query interface for querying VISIO import graph model results can be provided for a user, and whether import is successful, how many nodes are imported, how many relationships and other information are displayed on the query interface.
That is to say, the method provided by the embodiment of the application converts the graphic file into the graph database data by reading the Visio flow chart file in the XML format and mapping the graphic elements therein to the elements such as nodes, relationships and the like of the graph model, thereby realizing the construction of the related knowledge graph.
The embodiment of the application provides a method for converting a Visio flow chart into a knowledge graph, which comprises the following steps: the method comprises the steps of obtaining an extensible markup language file of a Visio flow chart, determining the graph information as node information of a knowledge graph and the connection information between two graphs according to a mapping relation, determining the connection information as relation information between the two nodes, and establishing the knowledge graph according to the node information and the relation information between the two nodes. That is, the graph information of the Visio flowchart and the connection information between two graphs can be determined as the node information of the knowledge graph through the mapping relationship and the connection information is determined as the relationship information between two nodes, so that the knowledge graph can be constructed by using the node information and the relationship information, and the Visio flowchart can be converted into the knowledge graph.
Based on the method for converting the Visio flow chart into the knowledge graph provided by the embodiment, the embodiment of the application also provides a device for converting the Visio flow chart into the knowledge graph, and the working principle of the device is described in detail below by combining the attached drawings.
Referring to fig. 4, the figure is a schematic structural diagram of an apparatus for converting a Visio flowchart into a knowledge graph according to an embodiment of the present application.
The device 400 for converting the Visio flowchart into the knowledge graph provided by the embodiment of the application comprises:
an obtaining unit 410, configured to obtain an extensible markup language file of the Visio flowchart, where the extensible markup language file includes graph information and connection information between two graphs;
a determining unit 420, configured to determine the graph information as node information of a knowledge graph and determine the connection information as relationship information between two nodes according to a mapping relationship;
an establishing unit 430, configured to establish a knowledge graph according to the node information and the relationship information between the two nodes.
Optionally, the graph information includes a graph number, a graph type, and a graph name, and the node information includes a node number, a node tag, and a node attribute;
the determining unit is specifically configured to:
and according to the mapping relation, determining the graph number as a node number of the knowledge graph, determining the graph type as a node label of the knowledge graph, and determining the graph name as a node attribute of the knowledge graph.
Optionally, the connection information between the two graphs includes a starting graph number, an ending graph number, a connection type between the two graphs, and a connection name between the two graphs, and the relationship information between the two nodes includes a starting node number, an ending node number, a relationship label between the two nodes, and a relationship attribute between the two nodes;
the determining unit is specifically configured to:
and according to the mapping relation, determining the number of the starting graph as the number of the starting node, determining the number of the ending graph as the number of the ending node, determining the type of a connecting line between the two graphs as a relation label between the two nodes, and determining the name of the connecting line between the two graphs as a relation attribute between the two nodes.
Optionally, the apparatus further comprises:
and the monitoring unit is used for monitoring the process of converting the Visio flow chart into the knowledge graph in real time.
Optionally, the apparatus further comprises:
and the configuration unit is used for configuring the mapping relationship between the graph information and the node information of the knowledge graph and the mapping relationship between the connecting line information and the relationship information in advance.
Based on the method for converting the Visio flow chart into the knowledge graph provided by the embodiment, the embodiment of the application further provides equipment for converting the Visio flow chart into the knowledge graph, and the equipment for converting the Visio flow chart into the knowledge graph comprises the following steps:
a processor and a memory, and the number of the processors may be one or more. In some embodiments of the present application, the processor and memory may be connected by a bus or other means.
The memory may include both read-only memory and random access memory, and provides instructions and data to the processor. The portion of memory may also include NVRAM. The memory stores an operating system and operating instructions, executable modules or data structures, or subsets thereof, or expanded sets thereof, wherein the operating instructions may include various operating instructions for performing various operations. The operating system may include various system programs for implementing various basic services and for handling hardware-based tasks.
The processor controls the operation of the terminal device and may also be referred to as a CPU.
The method disclosed in the embodiments of the present application may be applied to a processor, or may be implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor described above may be a general purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
The embodiment of the present application further provides a computer-readable storage medium for storing a program code, where the program code is used to execute any one implementation of the methods of the foregoing embodiments.
In the context of this application, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
It should be noted that the computer readable medium mentioned above in the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
When introducing elements of various embodiments of the present application, the articles "a," "an," "the," and "said" are intended to mean that there are one or more of the elements. The terms "comprising," "including," and "having" are intended to be inclusive and mean that there may be additional elements other than the listed elements.
It should be noted that, as one of ordinary skill in the art would understand, all or part of the processes of the above method embodiments may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when executed, the computer program may include the processes of the above method embodiments. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points. The above-described apparatus embodiments are merely illustrative, and the units and modules described as separate components may or may not be physically separate. In addition, some or all of the units and modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The foregoing is merely a preferred embodiment of the present application and, although the present application discloses the foregoing preferred embodiments, the present application is not limited thereto. Those skilled in the art can now make numerous possible variations and modifications to the disclosed embodiments, or modify equivalent embodiments, using the methods and techniques disclosed above, without departing from the scope of the claimed embodiments. Therefore, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present application still fall within the protection scope of the technical solution of the present application without departing from the content of the technical solution of the present application.

Claims (10)

1. A method for converting a Visio flowchart to a knowledge graph, the method comprising:
acquiring an extensible markup language file of a Visio flow chart, wherein the extensible markup language file comprises graphic information and connection information between two graphics;
according to the mapping relation, determining the graph information as node information of a knowledge graph and determining the connection information as relation information between two nodes;
and establishing a knowledge graph according to the node information and the relation information between the two nodes.
2. The method of claim 1, wherein the graph information comprises a graph number, a graph type, and a graph name, and the node information comprises a node number, a node label, and a node attribute;
determining the graph information as node information of the knowledge graph according to the mapping relationship comprises:
and according to the mapping relation, determining the graph number as the node number of the knowledge graph, determining the graph type as the node label of the knowledge graph, and determining the graph name as the node attribute of the knowledge graph.
3. The method according to claim 2, wherein the connection information between the two graphs comprises a start graph number, an end graph number, a connection type between the two graphs, and a connection name between the two graphs, and the relationship information between the two nodes comprises a start node number, an end node number, a relationship label between the two nodes, and a relationship attribute between the two nodes;
determining the connection information as relationship information between two nodes according to the mapping relationship includes:
and according to the mapping relation, determining the number of the starting graph as the number of the starting node, determining the number of the ending graph as the number of the ending node, determining the type of a connecting line between the two graphs as a relation label between the two nodes, and determining the name of the connecting line between the two graphs as a relation attribute between the two nodes.
4. The method of claim 1, further comprising:
and monitoring the process of converting the Visio flow chart into the knowledge graph in real time.
5. The method according to any one of claims 1-4, further comprising:
and pre-configuring the mapping relation between the graph information and the node information of the knowledge graph and the mapping relation between the connection information and the relation information.
6. An apparatus for converting a Visio flowchart to a knowledge graph, the apparatus comprising:
the acquiring unit is used for acquiring an extensible markup language file of the Visio flow chart, wherein the extensible markup language file comprises graphic information and connection information between two graphics;
the determining unit is used for determining the graph information as node information of a knowledge graph and determining the connection information as relationship information between two nodes according to the mapping relationship;
and the establishing unit is used for establishing a knowledge graph according to the node information and the relation information between the two nodes.
7. The apparatus of claim 6, wherein the graph information comprises a graph number, a graph type, and a graph name, and the node information comprises a node number, a node label, and a node attribute;
the determining unit is specifically configured to:
and according to the mapping relation, determining the graph number as the node number of the knowledge graph, determining the graph type as the node label of the knowledge graph, and determining the graph name as the node attribute of the knowledge graph.
8. The apparatus of claim 7, wherein the connection information between the two graphs comprises a start graph number, an end graph number, a connection type between the two graphs, and a connection name between the two graphs, and the relationship information between the two nodes comprises a start node number, an end node number, a relationship label between the two nodes, and a relationship attribute between the two nodes;
the determining unit is specifically configured to:
and according to the mapping relation, determining the number of the starting graph as the number of the starting node, determining the number of the ending graph as the number of the ending node, determining the type of a connecting line between the two graphs as a relation label between the two nodes, and determining the name of the connecting line between the two graphs as a relation attribute between the two nodes.
9. The apparatus of claim 6, further comprising:
and the monitoring unit is used for monitoring the process of converting the Visio flow chart into the knowledge graph in real time.
10. The apparatus of any one of claims 6-9, further comprising:
and the configuration unit is used for configuring the mapping relationship between the graph information and the node information of the knowledge graph and the mapping relationship between the connection information and the relationship information in advance.
CN202210743275.9A 2022-06-28 2022-06-28 Method and device for converting Visio flow chart into knowledge graph Pending CN115114452A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210743275.9A CN115114452A (en) 2022-06-28 2022-06-28 Method and device for converting Visio flow chart into knowledge graph

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210743275.9A CN115114452A (en) 2022-06-28 2022-06-28 Method and device for converting Visio flow chart into knowledge graph

Publications (1)

Publication Number Publication Date
CN115114452A true CN115114452A (en) 2022-09-27

Family

ID=83330811

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210743275.9A Pending CN115114452A (en) 2022-06-28 2022-06-28 Method and device for converting Visio flow chart into knowledge graph

Country Status (1)

Country Link
CN (1) CN115114452A (en)

Similar Documents

Publication Publication Date Title
US20190129734A1 (en) Data collection workflow extension
EP3433732A1 (en) Converting visual diagrams into code
CN106657192B (en) Method and equipment for presenting service calling information
CN111522927A (en) Entity query method and device based on knowledge graph
CN113238740B (en) Code generation method, code generation device, storage medium and electronic device
CN114116065B (en) Method and device for acquiring topological graph data object and electronic equipment
CN110975293A (en) Method, device, server and medium for establishing resource reference relation table
CN110633959A (en) Method, device, equipment and medium for creating approval task based on graph structure
CN111435367A (en) Knowledge graph construction method, system, equipment and storage medium
CN105824647A (en) Form page generating method and device
CN110704099A (en) Alliance chain construction method and device and electronic equipment
CN115114452A (en) Method and device for converting Visio flow chart into knowledge graph
CN115935909A (en) File generation method and device and electronic equipment
CN114169318A (en) Process identification method, apparatus, device, medium, and program
CN110471708B (en) Method and device for acquiring configuration items based on reusable components
CN113806556A (en) Method, device, equipment and medium for constructing knowledge graph based on power grid data
CN114860566A (en) Source code testing method and device, electronic equipment and storage medium
CN111930377A (en) Topological relation display method and device, server and storage medium
CN114912544B (en) Training method of automatic feature engineering model and automatic feature engineering method
CN111610908A (en) Method for generating frame diagram, computer equipment and readable storage medium
CN115114451A (en) Method and device for converting mind map into knowledge map
CN116719949A (en) Self-help navigation method, device, equipment and storage medium of cross-media knowledge graph
CN116756460B (en) Combined data acquisition method and device and related equipment
CN117573199B (en) Model difference comparison analysis method, device, equipment and medium
US20230074230A1 (en) Automatic generation of exporter configuration rules

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination