CN112035708A - Knowledge graph display method and device, computer device and readable storage medium - Google Patents

Knowledge graph display method and device, computer device and readable storage medium Download PDF

Info

Publication number
CN112035708A
CN112035708A CN202010671049.5A CN202010671049A CN112035708A CN 112035708 A CN112035708 A CN 112035708A CN 202010671049 A CN202010671049 A CN 202010671049A CN 112035708 A CN112035708 A CN 112035708A
Authority
CN
China
Prior art keywords
node
information
nodes
acquiring
knowledge graph
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
CN202010671049.5A
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.)
4Paradigm Beijing Technology Co Ltd
Original Assignee
4Paradigm Beijing Technology Co 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 4Paradigm Beijing Technology Co Ltd filed Critical 4Paradigm Beijing Technology Co Ltd
Priority to CN202010671049.5A priority Critical patent/CN112035708A/en
Publication of CN112035708A publication Critical patent/CN112035708A/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/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9024Graphs; Linked lists
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor

Abstract

The embodiment of the disclosure relates to a display method, a display device, a computer device and a readable storage medium of a knowledge graph, wherein the method comprises the following steps: acquiring attribute information of nodes in a knowledge graph to be displayed; acquiring display parameter information of the node based on the attribute information of the node; and generating and displaying the knowledge graph on a knowledge graph display interface according to the display parameter information of the nodes. By adopting the technical scheme, the display parameter information of different nodes is determined based on the corresponding attribute information, and then the knowledge graph can be displayed based on the display parameter information of the nodes, the complex underlying structure of the knowledge graph is displayed in a three-dimensional structure, so that a user can be helped to better understand the form and structure of the knowledge graph, and the user experience is improved.

Description

Knowledge graph display method and device, computer device and readable storage medium
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a method and an apparatus for displaying a knowledge graph, a computer apparatus, and a readable storage medium.
Background
With the continuous development of artificial intelligence technology, the knowledge graph technology, which is one of the important branches of artificial intelligence, is also increasingly applied in various industries.
The knowledge graph is a graph database for storing a large amount of knowledge, but the structure of the node-relation edge-node of the knowledge graph is greatly different from that of the traditional database, and the knowledge graph can realize a graphical display mode, so that a user can directly read related contents from the graphical knowledge graph. However, the inventors found in the process of implementing the present invention that: when the existing knowledge graph is displayed, the display modes of the nodes are not distinguished, and when the number of the nodes displayed on the knowledge graph is large, different nodes on the knowledge graph are difficult to distinguish, so that the user experience is influenced.
Disclosure of Invention
To solve the technical problem or at least partially solve the technical problem, the present disclosure provides a method, an apparatus, a computer apparatus, and a readable storage medium for displaying a knowledge graph.
The first aspect of the disclosed embodiments provides a method for displaying a knowledge graph, which includes:
acquiring attribute information of nodes in a knowledge graph to be displayed;
acquiring display parameter information of the node based on the attribute information of the node;
and generating and displaying the knowledge graph on a knowledge graph display interface according to the display parameter information of the nodes.
In some embodiments, the attribute information of the node includes at least one of a node density, a node type, a node hierarchy;
the display parameter information of the node includes at least one of brightness information, size information, color information, shape information, and transparency information.
In some embodiments, the obtaining of the display parameter information of the node based on the attribute information includes at least one of:
acquiring color information and/or shape information of the node based on the node type of the node;
acquiring transparency information and/or brightness information of the node based on the node level of the node;
and acquiring the size information of the node based on the node density of the node.
In some embodiments, the obtaining of the display parameter information of the node based on the attribute information includes:
acquiring nodes of which the node density meets a first preset condition based on the node density of the nodes;
taking the node meeting the first preset condition as a first central node, and acquiring a node of which the node level meets a second preset condition;
and acquiring display parameter information of the first central node and the nodes meeting the second preset condition.
In some embodiments, the obtaining of the display parameter information of the node based on the attribute information includes:
determining a second central node based on the search result information or the node selection operation, and acquiring nodes of which the node levels meet a third preset condition;
and acquiring display parameter information of the second central node and the nodes meeting the third preset condition.
In some embodiments, before determining the second central node based on the search result information, the method further comprises:
acquiring a search keyword input by a user through a search box;
determining nodes of which the node names and the search keywords meet preset matching conditions, and displaying the nodes as search result information;
the determining the second center node based on the search result information includes:
and acquiring a second central node selected by the user from the search result information.
In some embodiments, the preset matching condition includes at least two matching conditions of priority levels determined according to a matching degree, and the determining the node name and the node of which the search keyword satisfy the preset matching condition includes:
and preferentially acquiring the nodes meeting the matching conditions with high priority according to the priority levels of the matching conditions in sequence, and acquiring the nodes meeting the matching conditions with low priority when the matching conditions with high priority have no matching result.
In some embodiments, when there is no search result information satisfying the matching condition, prompt information for establishing a node with a node name as the search keyword is displayed to the user.
In some embodiments, the search input box is presented on the knowledge-graph presentation interface, and the search result information is presented on the knowledge-graph presentation interface.
In some embodiments, the attribute information of the node further includes at least one of a node data source and a node credibility, and the obtaining of the exposure parameter information of the node based on the attribute information includes at least one of:
acquiring nodes meeting first screening conditions based on the node types of the nodes, and acquiring display parameter information of the nodes meeting the first screening conditions;
acquiring nodes meeting second screening conditions based on the node data source of the nodes, and acquiring display parameter information of the nodes meeting the second screening conditions;
and acquiring the nodes meeting the third screening condition based on the node credibility of the nodes, and acquiring the display parameter information of the nodes meeting the third screening condition.
In some embodiments, the first filtering condition, the second filtering condition or the third filtering condition input by the user is obtained through a filtering control on the knowledge graph display interface.
In some embodiments, the method further comprises:
and displaying the map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface.
In some embodiments, displaying the example information of the knowledge-graph in the graph checking area of the knowledge-graph displaying interface comprises:
and displaying the overview map knowledge information or the display map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface.
In some embodiments, the displaying at least one of a confirmation control, a deletion control, an editing control, an adding control, a viewing source control, a hidden relationship name control, and a batch operation control in a map examination region of the knowledge-map display interface;
the method further comprises the following steps:
and receiving at least one of the confirmation control, the deletion control, the editing control, the addition control, the viewing source control and the batch operation control aimed at by the user, and executing corresponding operation.
In some embodiments, the knowledge-graph is a three-dimensional structure composed between nodes;
the method further comprises the following steps:
receiving at least one of full screen viewing operation, enlarged viewing operation, reduced viewing operation, translation operation, three-dimensional zooming-out operation and three-dimensional zooming-in operation input by a user, and executing corresponding operation.
In a second aspect of the disclosed embodiments, there is provided a display apparatus for knowledge-graph, the apparatus comprising:
the attribute information acquisition module is used for acquiring the attribute information of the nodes in the knowledge graph to be displayed;
the display parameter acquisition module is used for acquiring the display parameter information of the node based on the attribute information of the node;
and the map display module is used for generating and displaying the knowledge map on a knowledge map display interface according to the display parameter information of the nodes.
In some embodiments, the attribute information of the node includes at least one of a node density, a node type, a node hierarchy;
the display parameter information of the node includes at least one of brightness information, size information, color information, shape information, and transparency information.
In some embodiments, the presentation parameter obtaining module comprises at least one of:
a first parameter unit, configured to obtain color information and/or shape information of the node based on a node type of the node;
the second parameter unit is used for acquiring transparency information and/or brightness information of the node based on the node level of the node;
and the third parameter unit is used for acquiring the size information of the node based on the node density of the node.
In some embodiments, the display parameter obtaining module is specifically configured to:
acquiring nodes of which the node density meets a first preset condition based on the node density of the nodes;
taking the node meeting the first preset condition as a first central node, and acquiring a node of which the node level meets a second preset condition;
and acquiring display parameter information of the first central node and the nodes meeting the second preset condition.
In some embodiments, the display parameter obtaining module comprises:
the central unit is used for determining a second central node based on the search result information or the node selection operation and acquiring nodes of which the node levels meet a third preset condition;
and the fourth parameter unit is used for acquiring the display parameter information of the second central node and the nodes meeting the third preset condition.
In some embodiments, the display parameter obtaining module further includes a search unit, specifically configured to: before determining the second central node based on the search result information,
acquiring a search keyword input by a user through a search box;
determining nodes of which the node names and the search keywords meet preset matching conditions, and displaying the nodes as search result information;
the central unit is specifically configured to:
and acquiring a second central node selected by the user from the search result information.
In some embodiments, the preset matching conditions include at least two matching conditions of priority levels determined according to a matching degree, and the search unit is specifically configured to:
and preferentially acquiring the nodes meeting the matching conditions with high priority according to the priority levels of the matching conditions in sequence, and acquiring the nodes meeting the matching conditions with low priority when the matching conditions with high priority have no matching result.
In some embodiments, the apparatus further includes a node establishment prompting module, specifically configured to:
and when no search result information meeting the matching condition exists, displaying prompt information for establishing a node with a node name of the search keyword to the user.
In some embodiments, the apparatus further includes a search presentation module, specifically configured to:
displaying the search input box on the knowledge graph display interface, and displaying the search result information on the knowledge graph display interface.
In some embodiments, the attribute information of the node further includes at least one of a node data source and a node credibility, and the exposure parameter obtaining module includes at least one of:
the first screening unit is used for acquiring nodes meeting first screening conditions based on the node types of the nodes and acquiring display parameter information of the nodes meeting the first screening conditions;
the second screening unit is used for acquiring nodes meeting second screening conditions based on the node data sources of the nodes and acquiring display parameter information of the nodes meeting the second screening conditions;
and the third screening unit is used for acquiring the nodes meeting the third screening condition based on the node credibility of the nodes and acquiring the display parameter information of the nodes meeting the third screening condition.
In some embodiments, the apparatus further comprises a screening condition module, specifically configured to:
and acquiring a first screening condition, a second screening condition or a third screening condition input by a user through a screening control on the knowledge graph display interface.
In some embodiments, the apparatus further comprises a map verification module, specifically configured to:
and displaying the map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface.
In some embodiments, the map verification module is specifically configured to:
and displaying the overview map knowledge information or the display map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface.
In some embodiments, at least one of a confirmation control, a deletion control, an edit control, an add control, a view source control, a hidden relationship name control, and a batch operation control is displayed in a graph inspection region of the knowledge graph display interface;
the device further comprises a control triggering module, which is specifically configured to:
receiving the trigger of the user for at least one of the confirmation control, the deletion control, the editing control, the addition control, the viewing source control and the batch operation control, and executing corresponding operation.
In some embodiments, the knowledge-graph is a three-dimensional structure composed between nodes;
the device further comprises a user operation module, which is specifically configured to:
receiving at least one of full screen viewing operation, enlarged viewing operation, reduced viewing operation, translation operation, three-dimensional zooming-out operation and three-dimensional zooming-in operation input by a user, and executing corresponding operation.
In a third aspect of the disclosed embodiments, a computer apparatus is disclosed, the computer apparatus comprising:
a processor for implementing the steps of any of the above methods when executing a computer program stored in a memory.
In a fourth aspect of the disclosed embodiments, a computer-readable storage medium is disclosed, having stored thereon computer instructions, which, when executed by a processor, implement the steps of the method as in any of the above.
According to the technical scheme provided by the embodiment of the disclosure, the attribute information of the node in the knowledge graph to be displayed is acquired, the display parameter information of the node is acquired based on the attribute information of the node, and the knowledge graph is generated and displayed on the knowledge graph display interface according to the display parameter information of the node, so that the scheme for displaying the knowledge graph based on the attribute information of the node is provided. By adopting the technical scheme, the display parameter information of different nodes is determined based on the corresponding attribute information, and then the knowledge graph can be displayed based on the display parameter information of the nodes, the complex underlying structure of the knowledge graph is displayed in a three-dimensional structure, so that a user can be helped to better understand the form and structure of the knowledge graph, and the user experience is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
In order to more clearly illustrate the embodiments or technical solutions in the prior art of the present disclosure, the drawings used in the description of the embodiments or prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic flow chart of a method for displaying a knowledge graph according to an embodiment of the present disclosure;
FIG. 2 is an interface schematic diagram of a knowledge graph display interface provided by an embodiment of the present disclosure;
FIG. 3 is a diagram illustrating search result information provided by an embodiment of the present disclosure;
FIG. 4 is a schematic flow chart diagram illustrating another method for displaying a knowledge-graph according to an embodiment of the present disclosure;
FIG. 5 is a schematic structural diagram of a knowledge graph display apparatus provided in an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of another knowledge graph display apparatus provided in the embodiment of the present disclosure.
Detailed Description
In order that the above objects, features and advantages of the present disclosure may be more clearly understood, aspects of the present disclosure will be further described below. It should be noted that the embodiments and features of the embodiments of the present disclosure may be combined with each other without conflict.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, but the present disclosure may be practiced in other ways than those described herein; it is to be understood that the embodiments disclosed in the specification are only a few embodiments of the present disclosure, and not all embodiments.
In the embodiment of the disclosure, the related knowledge graph can be defined as an organization form of graph-like knowledge and data, and the entity node, the event node and the relationship edge are the main three constituent elements of the knowledge graph and can be a knowledge triple; in the knowledge graph, entity nodes and event nodes can be associated by different types of relationship edges.
The entity nodes in the knowledge graph refer to semantic words with specific meanings, such as people, places, mechanisms, numbers and other information.
Event nodes in the knowledge graph refer to 1 or more entity nodes with specific meanings and predefined event names which are connected by specific relation words to form a group of associated information, so that a dynamic behavior is described, and hereinafter, financing events and movie showing events are respectively explained.
For financing events, content may be included:
financing event-financing time-2020.5.20
Financing event-financing Party-XXX corporation
Financing event-financing amount-10 billion dollars
Financing event-investor-XXX corporation
For a movie show event, the content can be as follows:
movie and television work show event-movie and television work name-work name
Event-time mapping on film and television works
Movie work showing event-showing place-place
Event-director-name mapping on film and television works
Event-lead show-name of movie and television works
For a particular movie show event 01, the relationship edges that may be included may include the following:
movie work show event 01-movie work name-ironmen
Movie and television work showing event 01-showing time-2008, 4 months and 30 days
Movie work mapping event 01-mapping place-China
Event 01-director-Jone-Fibreuer on film and television works
Movie work mapping event 01-lead show-little robert-Tang
Movie work mapping event 01-lead actor-gurweneisi palo
Movie work mapping event 01-lead actor-tylens Howland
Event 01-lead actor-jeff brigies on film and television works
The knowledge graph in the embodiment of the disclosure can be extracted by manual labeling and/or model extraction, and then the knowledge graph is constructed based on the knowledge graph, and the knowledge graph needs to be displayed in the process of constructing the knowledge graph or after the construction of the knowledge graph is completed. In the display scheme of the knowledge graph provided by the embodiment of the disclosure, the attribute information of the node in the knowledge graph to be displayed is acquired, the display parameter information of the node is acquired based on the attribute information of the node, and the knowledge graph is generated and displayed on the knowledge graph display interface according to the display parameter information of the node, so that the scheme of displaying the knowledge graph based on the attribute information of the node is provided. By adopting the technical scheme, the display parameter information of different nodes is determined based on the corresponding attribute information, and then the knowledge graph can be displayed based on the display parameter information of the nodes, the complex underlying structure of the knowledge graph is displayed in a three-dimensional structure, so that a user can be helped to better understand the form and structure of the knowledge graph, and the user experience is improved.
Fig. 1 is a schematic flow chart of a method for displaying a knowledge graph according to an embodiment of the present disclosure, as shown in fig. 1, the method includes the following steps:
step 101, obtaining attribute information of nodes in a knowledge graph to be displayed.
The method comprises the steps of acquiring attribute information of each node in the knowledge graph to be displayed in the process of displaying the constructed knowledge graph, wherein the attribute information of the node refers to the characteristic information of the node and the distribution information of the node in the knowledge graph. After the knowledge graph is constructed, the data of the knowledge graph can be stored in a preset database, and the attribute information of the node can be obtained from the database.
The specific information included in the attribute information of the node may be various, and the attribute information of the node in the embodiment of the present disclosure may include at least one of a node density, a node type, a node hierarchy, and the like. The node density can reflect the number of other nodes connected with the current node, and the larger the node density is, the larger the number of connected nodes is. The nodes in the knowledge graph can be divided into three types based on events and relations, and can include nodes of a first entity type, nodes of a second entity type and entity nodes of the event type, wherein the nodes of the first entity type mainly represent entity nodes not belonging to any relation edge, the nodes of the second entity type mainly represent nodes with a front node and a back node related to the relation edge, and the nodes of the event type represent nodes included by the events. The node hierarchy may be understood as a degree of association between a current node and a central node when the central node exists in the knowledge graph, and may specifically be measured by a distance from the central node, that is, a number of relationship edges included in a shortest path between two nodes.
And 102, acquiring the display parameter information of the node based on the attribute information of the node.
The display parameter information of the node obtained in this step is related information used for representing the display style of the node, and may include various different types of information, for example, the display parameter information of the node may include at least one of luminance information, size information, color information, shape information, and transparency information, where the luminance information is highlight degree information, and the transparency information is specific display transparency.
In this step, the display parameter information of the node may be obtained based on the attribute information of the node obtained in step 101, the specific obtaining manner may be multiple, and for example, the display parameter information of the node obtained based on the attribute information may include at least one of the following: acquiring color information and/or shape information of the node based on the node type of the node; acquiring transparency information and/or brightness information of the node based on the node level of the node; and acquiring the size information of the nodes based on the node density of the nodes. Different node types can be distinguished by different color information and/or shape information, and color information and/or shape information corresponding to each node can be determined based on a pre-established corresponding relationship among the node types, the color information and the shape information in the step. The node levels are different, the transparency and/or brightness of the nodes can be different, and the larger the node level is, the lower the transparency and/or brightness of the nodes can be. The larger the density of the nodes is, the larger the size of the nodes may be, but the size is not infinite, for example, a preset number of node sizes may be preset, and the set number may be determined according to actual conditions, for example, the set number may be 6, corresponding to different node densities.
And 103, generating and displaying the knowledge graph on a knowledge graph display interface according to the display parameter information of the nodes.
The knowledge graph display interface in the step is an interface for displaying the constructed knowledge graph. Specifically, after the display parameter information of the nodes is acquired, the nodes included in the constructed knowledge graph can be rendered to obtain the knowledge graph with the display effect, and the knowledge graph is displayed on a knowledge graph display interface.
Exemplarily, fig. 2 is an interface schematic diagram of a knowledge graph display interface provided by the embodiment of the present disclosure, and as shown in fig. 2, each node in the knowledge graph in the frame selection interface labeled 3 is displayed based on its corresponding display parameter information, so as to form a three-dimensional structure. For example, the sizes of several nodes such as ironmen, Thamnce, revenge league 4, revenge league 3 and American captain 3 among the nodes shown in the figure are larger than those of other nodes, and the brightness is also different from that of other nodes.
According to the technical scheme provided by the embodiment of the disclosure, the attribute information of the node in the knowledge graph to be displayed is acquired, the display parameter information of the node is acquired based on the attribute information of the node, and the knowledge graph is generated and displayed on the knowledge graph display interface according to the display parameter information of the node, so that the scheme for displaying the knowledge graph based on the attribute information of the node is provided. By adopting the technical scheme, the display parameter information of different nodes is determined based on the corresponding attribute information, and then the knowledge graph can be displayed based on the display parameter information of the nodes, the complex underlying structure of the knowledge graph is displayed in a three-dimensional structure, so that a user can be helped to better understand the existence form and structure of the knowledge graph, and the user experience is improved.
In some embodiments, since the number of nodes is multiple, partial nodes may be considered to be selectively exposed when exposing the knowledge-graph. That is, in the above step, obtaining the display parameter information of the node based on the attribute information may include: acquiring nodes of which the node density meets a first preset condition based on the node density of the nodes; taking the node meeting the first preset condition as a first central node, and acquiring the node of which the node level meets the second preset condition; and acquiring the display parameter information of the first central node and the nodes meeting the second preset condition.
The central node may be a node that may be of interest or focus on by the user, the determination manner of the central node may be various, and the central node may have specific display parameter information to be highlighted in the knowledge graph, for example, the central node may be highlighted. The first preset condition may be a density threshold or a density sorting range, for example, the first preset condition may be that after the node densities are sorted from large to small, the sorting range is from first to fifth. The second preset condition may be a presentation level determined based on an actual situation, for example, the second preset condition may include a first level and a second level. In the above steps, after determining the first center node satisfying the first preset condition based on the node density, the node of the first center node satisfying the second preset condition is determined, and then the display parameters of the first center node and the node satisfying the second preset condition are determined for subsequent display, and the manner of determining the display parameters is as described in the above embodiments. For example, the first central nodes with the node density ranked in the top five (in fig. 2, the first central nodes are five nodes of ironmen, Thamnus, revenge alliance 4, revenge alliance 3 and American captain 3) can be highlighted on the knowledge graph, the nodes of the first level and the nodes of the second level of each first central node are also displayed, the nodes of the third level are in a blanking state, and the rest are in a normal state and are not displayed.
Referring to fig. 2, only a part of nodes are displayed based on the node density of the nodes, and nodes which do not satisfy the conditions are not rendered and displayed, so that the content of the knowledge graph is displayed to the user with emphasis, and the user is helped to better understand the knowledge graph.
In some embodiments, the knowledge-graph may also enable a user to search its content to help the user find points of interest, and thus may allow for rendering a knowledge-graph centered around the searched nodes for the user based on the user's search results. With respect to step 102, obtaining the display parameter information of the node based on the attribute information may include: determining a second central node based on the search result information or the node selection operation, and acquiring nodes of which the node levels meet a third preset condition; and acquiring display parameter information of the second central node and the nodes meeting the third preset condition. The search is an important entry for a user to search for information in the knowledge graph, and the search result information is a node result obtained based on keyword matching of the user search. In this step, one node may be selected from the search result information as the second central node, or one of the nodes may be determined as the second central node based on a click operation of the user in the search result information. The third predetermined condition is a display level based on the second center node, for example, the third predetermined condition may be the first level. Based on the determination method in the above embodiment, the display parameter information of the second central node and the node satisfying the third preset condition may be determined for subsequent display. For example, after the second central node is determined, the node of the first level of the second central node may be preferentially determined, and if the limit of the maximum node number is not reached at this time, the node of the second level may be further extended and determined.
In some embodiments, before determining the second central node based on the search result information, the method may further include: acquiring a search keyword input by a user through a search box; determining nodes of which the node names and the search keywords meet preset matching conditions, and displaying the nodes as search result information; the determining the second center node based on the search result information includes: and acquiring a second central node selected by the user from the search result information. In the above steps, a search input box can be displayed on the knowledge graph display interface, a user can input a search keyword in the search input box to search the content in the knowledge graph, and after the search result information is obtained, the search result information can be displayed on the knowledge graph display interface.
Because the search of the knowledge graph is different from the search of other articles, the search keyword can be matched in real time in the process of inputting the search keyword by the user, and the node meeting the preset matching condition is determined based on the matching degree of the search keyword and the node. In some embodiments, the determining the preset matching condition may include determining at least two matching conditions with priority levels according to the matching degree, and determining a node whose node name and the search keyword satisfy the preset matching condition may include: and preferentially acquiring the nodes meeting the matching conditions with high priority according to the priority levels of the matching conditions in sequence, and acquiring the nodes meeting the matching conditions with low priority when the matching conditions with high priority have no matching result. In some embodiments, when there is no search result information satisfying the matching condition, prompt information for establishing a node with a node name as a search keyword may be presented to the user, so that the user may establish a new node according to actual needs.
In the above step, the matching conditions of different priorities correspond to different matching degrees, illustratively, the matching conditions of three priorities are determined, and are respectively a first priority, a second priority and a third priority from top to bottom according to the priorities, and the matching condition of the first priority is that the node name is completely consistent with the search keyword; the matching condition of the second priority is that the search keyword is a part of the node name; the third-priority matching condition is that a part of the search keyword coincides with a part of the node name. And if the node does not exist, the priority level is sequentially reduced, and the node meeting the matching condition after the priority level is reduced is determined.
For example, referring to the box selection interface numbered 1 in fig. 2, a user can perform node name matching in real time when inputting a search keyword in a search input box without clicking a search control. Fig. 3 is a schematic diagram of search result information provided in an embodiment of the present disclosure, and as shown in fig. 3, the search result information is displayed in real time, a search keyword in the diagram is "apple", a word hit in a node name is shown in the diagram in a bold manner, a node name is shown on the left side in the search result information displayed in the diagram, and a category to which the node belongs is shown on the right side, for example, the category to which the node name in the diagram is "apple" belongs may include companies, fruits, and the like. The method comprises the steps that nodes with completely hit node names are the first two apples in search result information, matching conditions of high priority levels are met, nodes with completely contained search keywords in the node names are apple mobile phones and Fuji apples in the search result information, matching conditions of one lower priority level are met, nodes with partially contained search keywords in the node names are multi-beautiful, matching conditions of the other lower priority level are met, the last result is not found, prompt information of a new apple node is added, a node popup window can be popped up by clicking the prompt information, the apple is automatically brought in by default, and nodes with the node names of apples are established.
Further, referring to fig. 3, the search result information may be presented with a default number of results for presentation per page, and the number may be set to 10. When the user wants to view more, the "view more" control can be clicked to view more matching results. Optionally, when the user clicks the search control in the graph, the result of hit by the node name is displayed by default, that is, the result of complete coincidence between the node name and the search keyword is displayed, and if the result does not exist, the prompt information for establishing the node with the node name being the search keyword or viewing the related node may be displayed to the user, so as to establish a new node or display the related node with the node name being the search keyword to the user.
In the embodiment, a knowledge graph which takes the nodes matched with the search keywords as the center can be rendered for the user according to the search of the user, the related content can be visually displayed based on the points in which the user is interested, the requirement of the user for checking the graph can be met to a great extent, and the user can be helped to explore the graph.
In some embodiments, the knowledge-graph may also allow the user to perform a filtering of their content, whereby the user may be considered to be rendered a knowledge-graph centered on nodes that satisfy the filtering conditions. Specifically, the attribute information of the node may further include at least one of a node data source and a node reliability, and the obtaining of the display parameter information of the node based on the attribute information may include at least one of the following: acquiring nodes meeting a first screening condition based on the node types of the nodes, and acquiring display parameter information of the nodes meeting the first screening condition; acquiring nodes meeting second screening conditions based on the node data source of the nodes, and acquiring display parameter information of the nodes meeting the second screening conditions; and acquiring the nodes meeting the third screening condition based on the node credibility of the nodes, and acquiring the display parameter information of the nodes meeting the third screening condition.
The node data source refers to a source data set of original data used for constructing a knowledge graph, and corresponding graph knowledge can be obtained by analyzing and extracting the source data set. When the node data sources of the knowledge graph are different, the node credibility is correspondingly different, for example, when the node data sources are manually marked data sources such as service albums of the knowledge graph, the node credibility is the highest, when the node data sources are marked data sources in a user answering mode, the node credibility is higher, and when the node data sources are predicted by the machine model, the node credibility is lower. The first screening condition is a partial node type selected by a user, the second screening condition is a partial node data source selected by the user, the third screening condition is a partial node credibility selected by the user, and the user can determine the three screening conditions according to actual requirements.
All node data sources are selected by default through the knowledge graph, a user can designate the node data sources, so that the knowledge graph only displays graph contents corresponding to the node data sources screened by the user, the contents displayed on the left side of a knowledge graph display interface correspond to the contents in the knowledge graph, only the node data sources are screened, and the requirement that the user wants to delete all the contents of one node data source is met. The node types are selected by default, and the knowledge graph under part of the node types can be screened and displayed according to the user.
Furthermore, a first screening condition, a second screening condition or a third screening condition input by a user is obtained through a screening control on the knowledge graph display interface. Referring to the box selection interface labeled 1 in fig. 2, the user inputs different screening conditions by clicking the screening control on the knowledge graph display interface, so that the knowledge graph displays the knowledge graph according to the screening conditions of the user.
The data has various related information such as data sources, credibility and the like, the embodiment of the disclosure provides rich screening functions, and the knowledge graph which takes the node meeting the screening conditions as the center can be rendered for the user according to the screening of the user, so that the knowledge graph is displayed more flexibly, and the requirements of the user on screening and batch operation of the data under various conditions are further met.
In some embodiments, the knowledge graph can also enable a user to check and adjust graph content therein, and when the user has corresponding rights, specific operations can be performed in the knowledge graph display interface. Fig. 4 is a schematic flow chart of another method for displaying a knowledge graph according to an embodiment of the present disclosure, as shown in fig. 4, the method may further include steps 401 to 402 and/or step 403, specifically:
step 401, displaying the map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface.
The map checking area in this step may be an area set for a user with administrator authority in the knowledge map display interface, and the user may perform operations such as confirmation, deletion, and modification on map knowledge information in the area. The graph knowledge information may include node-related information for different node types.
Specifically, the overview map knowledge information or the display map knowledge information of the knowledge map is displayed in a map inspection area of a knowledge map display interface. The overview map knowledge information refers to all map knowledge information, and the display map knowledge information refers to part of map knowledge information corresponding to the currently displayed knowledge map. For example, referring to a box-selection interface labeled 2 in the knowledge graph display interface in fig. 2, graph knowledge information in two states can be displayed in the interface, and in an overview state, when a user just enters the interface and does not start to perform a search or click operation, all information of the entire knowledge graph is displayed in the interface; when the node details are entered by searching or clicking the node, the graph knowledge information displayed in the interface completely corresponds to the nodes of the knowledge graph displayed in the frame selection interface with the right label 3, namely, which nodes are on the graph, and the interface on the left side contains the information of which nodes.
Step 402, receiving a trigger of a user for at least one of confirming a control, deleting a control, editing a control, adding a control, viewing a source control and a batch operation control, and executing a corresponding operation.
In the embodiment of the disclosure, at least one of a confirmation control, a deletion control, an editing control, an addition control, a source viewing control, a hidden relationship name control, a batch operation control and the like can be displayed in the map checking area of the knowledge map display interface, and the functions corresponding to different controls are different.
After the atlas knowledge information of the knowledge atlas is displayed in the atlas checking area of the knowledge atlas display interface, corresponding operation can be performed on the atlas knowledge information based on the triggering of a user on a control. Referring to a frame selection interface labeled 2 in a knowledge map display interface in fig. 2, after a confirmation control is clicked, map knowledge information can be manually confirmed as a reliable result through a machine model estimation, for example, a problem corresponding to the map knowledge information is displayed, and confirmation can be achieved after manual answering; after clicking the view source control, displaying all data sets containing the node type on a popup window; after clicking the deleting control and the editing control, deleting and editing the map knowledge information, and correspondingly deleting or editing the relation edges connected with a certain node when deleting or editing the map knowledge information at the certain node; after clicking the adding control, a user can add new map knowledge information under the corresponding entity type, relationship type and event type, the user only needs to input the map knowledge information according to a prompt, the user can be automatically matched in the input process, and if the existing content in the map knowledge information is added, the user is prompted to be incapable of adding the new map knowledge information; after clicking the batch operation control, the user may perform a batch operation on a certain type of graph knowledge information, for example, delete all nodes under the node "company".
In addition, a node in a map checking area of the knowledge map display interface can be clicked, and the detail page of the node is skipped; and when the mouse is hovered at the corresponding node, the right-side knowledge graph can be highlighted in a matching manner, and the specific highlighting manner is not limited, for example, the highlighting manner can be highlighted.
And 403, receiving at least one of a full screen viewing operation, an enlarged viewing operation, a reduced viewing operation, a translation operation, a three-dimensional zooming-out operation and a three-dimensional zooming-in operation input by a user, and executing the corresponding operation.
The knowledge-graph may be a three-dimensional structure composed of nodes, i.e., a three-dimensional structure composed of nodes of three node types. Like the box-selected interface labeled 3 in the display interface of the knowledge graph of fig. 2, the knowledge graph can be displayed in a three-dimensional structure after being rendered based on the display parameter information of each node. After the knowledge graph is displayed to the user in this step, the user may perform an interactive operation on the knowledge graph with the three-dimensional structure at a knowledge graph display interface, where the specific operation may include at least one of a full-screen viewing operation, an enlarged viewing operation, a reduced viewing operation, a panning operation, a three-dimensional zooming-out operation, and a three-dimensional zooming-in operation. Illustratively, after the user inputs a full screen viewing operation, an interface of the full screen viewing knowledge base can be entered; based on the operation, the overall interaction of the size scaling, the three-dimensional zooming-in and zooming-out, the left-right translation and the like of the knowledge graph can be realized.
In some embodiments, the user can also adjust the overall display mode of the knowledge graph through local interaction operations such as dragging of a mouse, clicking of a switching center node and the like, and therefore the use experience of the user is improved. In addition, as for the box-selected interface labeled 3 in the knowledge graph display interface of fig. 2, the number of different types of nodes of the current page may also be displayed in the knowledge graph display interface, the number of the entity types and the number of the relationship types are both 21, and the number of the event types is 17, which is only an example; moreover, the relation name may also be displayed in the knowledge graph, and in the case of a large number of relations, the relation name may affect the user's view of the graph content, or the relation name may be selected not to be displayed, and the user may concentrate on the examination of the knowledge graph.
It is understood that, when all of the above steps 401 to 403 are included, the steps may be executed according to the execution sequence shown in fig. 4, or the step 403 may be executed first, and then the steps 401 to 402 are executed.
According to the display scheme of the knowledge graph, the complex underlying structure of the knowledge graph is abstracted into a three-dimensional structure consisting of points and edges, so that a user can better understand the existence form and structure of graph data, and certain user-defined configuration display structures, such as quantity, hierarchy and the like, of the user are supported; and the map checking area adopts the design of a left structure and a right structure, the left side is used for content addition and deletion, the right side displays the actual structure of the map, the situation that direct editing on the map is difficult is avoided, different functions can be automatically matched for users with different roles, and the labor division is clear.
Corresponding to the above method embodiment, the embodiment of the present disclosure further provides a display apparatus of a knowledge graph, fig. 5 is a schematic structural diagram of the display apparatus of a knowledge graph provided by the embodiment of the present disclosure, and as shown in fig. 5, the apparatus includes: an attribute information acquisition module 51, a presentation parameter acquisition module 52 and a map presentation module 53.
The attribute information obtaining module 51 is configured to obtain attribute information of nodes in a knowledge graph to be displayed, and obtain attribute information of each node in the knowledge graph to be displayed in a process of displaying the constructed knowledge graph, where the attribute information of the node refers to characteristic information of the node itself and distribution information of the node in the knowledge graph. After the knowledge graph is constructed, the data of the knowledge graph can be stored in a preset database, and the attribute information of the node can be obtained from the database.
The specific information included in the attribute information of the node may be various, and the attribute information of the node in the embodiment of the present disclosure may include at least one of a node density, a node type, a node hierarchy, and the like. The node density can reflect the number of other nodes connected with the current node, and the larger the node density is, the larger the number of connected nodes is. The nodes in the knowledge graph can be divided into three types based on events and relations, and can include nodes of a first entity type, nodes of a second entity type and nodes of the event type, wherein the nodes of the first entity type mainly represent entity nodes which do not belong to any relation edge, the nodes of the second entity type mainly represent nodes with a front node and a back node related to the relation, and the nodes of the event type represent nodes included by the events. The node hierarchy may be understood as a degree of association between a current node and a central node when the central node exists in the knowledge graph, and may specifically be measured by a distance from the central node, that is, a number of relationship edges included in a shortest path between two nodes.
And the display parameter acquiring module 52 is configured to acquire the display parameter information of the node based on the attribute information of the node. The display parameter information of the node is related information used for representing a display style of the node, and may include a plurality of different kinds of information, for example, the display parameter information of the node may include at least one of brightness information, size information, color information, shape information, and transparency information, where the brightness information is highlight degree information, and the transparency information is specific display transparency.
The display parameter information of the node may be obtained based on the obtained attribute information of the node, the specific obtaining manner may be multiple, and the exemplary method for obtaining the display parameter information of the node based on the attribute information may include at least one of the following: acquiring color information and/or shape information of the node based on the node type of the node; acquiring transparency information and/or brightness information of the node based on the node level of the node; and acquiring the size information of the nodes based on the node density of the nodes. Different node types can be distinguished by different color information and/or shape information, and the color information and/or the shape information corresponding to each node can be determined based on the corresponding relation of the node type, the color information and the shape information which are established in advance. The node levels are different, the transparency and/or brightness of the nodes can be different, and the larger the node level is, the lower the transparency and/or brightness of the nodes can be. The larger the density of the nodes is, the larger the size of the nodes may be, but the size is not infinite, for example, a preset number of node sizes may be preset, and the set number may be determined according to actual conditions, for example, the set number may be 6, corresponding to different node densities.
And the map display module 53 is configured to generate and display a knowledge map on the knowledge map display interface according to the display parameter information of the node. The knowledge graph display interface is used for displaying the constructed knowledge graph. Specifically, after the display parameter information of the nodes is acquired, the nodes included in the constructed knowledge graph can be rendered to obtain the knowledge graph with the display effect, and the knowledge graph is displayed on a knowledge graph display interface.
Exemplarily, fig. 2 is an interface schematic diagram of a knowledge graph display interface provided by the embodiment of the present disclosure, and as shown in fig. 2, each node in the knowledge graph in the frame selection interface labeled 3 is displayed based on its corresponding display parameter information, so as to form a three-dimensional structure. For example, the sizes of the nodes of ironmen, Thamnus, revenge league 4, revenge league 3 and American captain 3 are larger than those of other nodes, and the brightness is different from that of other nodes
In the embodiment of the disclosure, the scheme for displaying the knowledge graph based on the attribute information of the node is provided by acquiring the attribute information of the node in the knowledge graph to be displayed, acquiring the display parameter information of the node based on the attribute information of the node, and generating and displaying the knowledge graph on a knowledge graph display interface according to the display parameter information of the node. By adopting the technical scheme, the display parameter information of different nodes is determined based on the corresponding attribute information, and then the knowledge graph can be displayed based on the display parameter information of the nodes, the complex underlying structure of the knowledge graph is displayed in a three-dimensional structure, so that a user can be helped to better understand the form and structure of the knowledge graph, and the user experience is improved.
In some embodiments, since the number of nodes is multiple, partial nodes may be considered to be selectively exposed when exposing the knowledge-graph. The display parameter obtaining module 52 is specifically configured to: acquiring nodes of which the node density meets a first preset condition based on the node density of the nodes; taking the node meeting the first preset condition as a first central node, and acquiring the node of which the node level meets the second preset condition; and acquiring the display parameter information of the first central node and the nodes meeting the second preset condition.
The central node may be a node that may be of interest or focus on by the user, the determination manner of the central node may be various, and the central node may have specific display parameter information to be highlighted in the knowledge graph, for example, the central node may be highlighted. The first preset condition may be a density threshold or a density sorting range, for example, the first preset condition may be that after the node densities are sorted from large to small, the sorting range is from first to fifth. The second preset condition may be a presentation level determined based on an actual situation, for example, the second preset condition may include a first level and a second level. In the above embodiment, after determining the first center node satisfying the first preset condition based on the node density, the node of the first center node satisfying the second preset condition is determined, and then the display parameters of the first center node and the node satisfying the second preset condition are determined for subsequent display, and the manner of determining the display parameters is as described in the above embodiment. For example, the first central nodes with the node density ordered in the top five can be highlighted on the knowledge graph, the nodes of the first level and the nodes of the second level of each first centerline node are also displayed, the nodes of the third level are in a blank state, and the rest are in a normal state and are not displayed.
Referring to fig. 2, only a part of nodes are displayed based on the node density of the nodes, and nodes which do not satisfy the conditions are not rendered and displayed, so that the content of the knowledge graph is displayed to the user with emphasis, and the user is helped to better understand the knowledge graph.
In some embodiments, the knowledge-graph may also enable a user to search its content to help the user find points of interest, and thus may allow for rendering a knowledge-graph centered around the searched nodes for the user based on the user's search results. The display parameter acquiring module 52 includes: the central unit is used for determining a second central node based on the search result information or the node selection operation and acquiring nodes of which the node levels meet a third preset condition; and the fourth parameter unit is used for acquiring the display parameter information of the second central node and the nodes meeting the third preset condition. The search is an important entry for a user to search for information in the knowledge graph, and the search result information is a node result obtained based on keyword matching of the user search. Specifically, one node may be selected from the search result information as the second center node, or one of the nodes may be determined as the second center node based on a click operation of the user in the search result information. The third predetermined condition is a display level based on the second center node, for example, the third predetermined condition may be the first level. Based on the determination method in the above embodiment, the display parameter information of the second central node and the node satisfying the third preset condition may be determined for subsequent display. For example, after the second central node is determined, the node of the first level of the second central node may be preferentially determined, and if the limit of the maximum node number is not reached at this time, the node of the second level may be further extended and determined.
In some embodiments, the display parameter obtaining module further includes a search unit, specifically configured to: acquiring a search keyword input by a user through a search box before determining a second center node based on the search result information; determining nodes of which the node names and the search keywords meet preset matching conditions, and displaying the nodes as search result information; the central unit is specifically configured to: and acquiring the second central node selected by the user from the search result information. In some embodiments, the apparatus further includes a search presentation module, specifically configured to: and displaying the search input box on the knowledge graph display interface, and displaying the search result information on the knowledge graph display interface.
Because the search of the knowledge graph is different from the search of other articles, the search keyword can be matched in real time in the process of inputting the search keyword by the user, and the node meeting the preset matching condition is determined based on the matching degree of the search keyword and the node. In some embodiments, the preset matching conditions include at least two matching conditions of priority levels determined according to the matching degree, and the search unit is specifically configured to: and preferentially acquiring the nodes meeting the matching conditions with high priority according to the priority levels of the matching conditions in sequence, and acquiring the nodes meeting the matching conditions with low priority when the matching conditions with high priority have no matching result. In some embodiments, the apparatus further includes a node establishment prompting module, specifically configured to: and when no search result information meeting the matching piece exists, displaying prompt information for establishing a node with a node name of a search keyword to the user.
The matching conditions with different priorities correspond to different matching degrees, illustratively, the matching conditions with three priorities are determined, and are respectively a first priority, a second priority and a third priority from top to bottom according to the priorities, wherein the matching condition with the first priority is that the node name is completely consistent with the search keyword; the matching condition of the second priority is that the search keyword is a part of the node name; the third-priority matching condition is that a part of the search keyword coincides with a part of the node name. And if the node does not exist, the priority level is sequentially reduced, and the node meeting the matching condition after the priority level is reduced is determined.
For example, referring to the box selection interface numbered 1 in fig. 2, a user can perform node name matching in real time when inputting a search keyword in a search input box without clicking a search control. Fig. 3 is a schematic diagram of search result information provided in an embodiment of the present disclosure, and as shown in fig. 3, the search result information is displayed in real time, a search keyword in the diagram is "apple", a word hit in a node name is shown in the diagram in a bold manner, a node name is shown on the left side in the search result information displayed in the diagram, and a category to which the node belongs is shown on the right side, for example, the category to which the node name in the diagram is "apple" belongs may include companies, fruits, and the like. The method comprises the steps that nodes with completely hit node names are the first two apples in search result information, matching conditions of high priority levels are met, nodes with completely contained search keywords in the node names are apple mobile phones and Fuji apples in the search result information, matching conditions of lower priority levels are met, nodes with partially contained search keywords in the node names are multi-beautiful, matching conditions of the lower priority levels are met, the last search result information is ' not found ', a new prompt message of ' apple ' nodes ' is added, a node popup window can be popped up and added by clicking the prompt message, the ' apples ' are automatically brought in by default, and nodes with the node names of ' apples ' are established.
Further, referring to fig. 3, the search result information may be presented with a default number of results for presentation per page, and the number may be set to 10. When the user wants to view more, the "view more" control can be clicked to view more matching results. Optionally, when the user clicks the search control in the graph, the result of hit by the node name is displayed by default, that is, the result of complete coincidence between the node name and the search keyword is displayed, and if the result does not exist, the prompt information for establishing the node with the node name being the search keyword or viewing the related node may be displayed to the user, so as to establish a new node or display the related node with the node name being the search keyword to the user.
In the embodiment, a knowledge graph which takes the nodes matched with the search keywords as the center can be rendered for the user according to the search of the user, the related content can be visually displayed based on the points in which the user is interested, the requirement of the user for checking the graph can be met to a great extent, and the user can be helped to explore the graph.
In some embodiments, the knowledge-graph may also allow the user to perform a filtering of their content, whereby the user may be considered to be rendered a knowledge-graph centered on nodes that satisfy the filtering conditions. Specifically, the attribute information of the node further includes at least one of a node data source and a node reliability, and the display parameter obtaining module includes at least one of: the first screening unit is used for acquiring nodes meeting first screening conditions based on the node types of the nodes and acquiring display parameter information of the nodes meeting the first screening conditions; the second screening unit is used for acquiring nodes meeting second screening conditions based on the node data source of the nodes and acquiring display parameter information of the nodes meeting the second screening conditions; and the third screening unit is used for acquiring the nodes meeting the third screening condition based on the node credibility of the nodes and acquiring the display parameter information of the nodes meeting the third screening condition.
The node data source refers to a source data set of original data used for constructing a knowledge graph, and corresponding graph knowledge can be obtained by analyzing and extracting the source data set. When the node data sources of the knowledge graph are different, the node credibility is correspondingly different, for example, when the node data sources are manually marked data sources such as service albums of the knowledge graph, the node credibility is the highest, when the node data sources are marked data sources in a user answering mode, the node credibility is higher, and when the node data sources are predicted by the machine model, the node credibility is lower. The first screening condition is a partial node type selected by a user, the second screening condition is a partial node data source selected by the user, the third screening condition is a partial node credibility selected by the user, and the user can determine the three screening conditions according to actual requirements.
All node data sources are selected by default through the knowledge graph, a user can designate the node data sources, so that the knowledge graph only displays graph contents corresponding to the node data sources screened by the user, the contents displayed on the left side of a knowledge graph display interface correspond to the contents in the knowledge graph, only the node data sources are screened, and the requirement that the user wants to delete all the contents of one node data source is met. The node types are selected by default, and the knowledge graph under part of the node types can be screened and displayed according to the user.
In some embodiments, the apparatus further comprises a screening condition module, specifically configured to: and acquiring a first screening condition, a second screening condition or a third screening condition input by a user through a screening control on the knowledge graph display interface. Referring to the box selection interface labeled 1 in fig. 2, the user inputs different screening conditions by clicking the screening control on the knowledge graph display interface, so that the knowledge graph displays the knowledge graph according to the screening conditions of the user.
The data has various related information such as data sources, credibility and the like, the embodiment of the disclosure provides rich screening functions, and the knowledge graph which takes the node meeting the screening conditions as the center can be rendered for the user according to the screening of the user, so that the knowledge graph is displayed more flexibly, and the requirements of the user on screening and batch operation of the data under various conditions are further met.
In some embodiments, the knowledge graph can also enable a user to check and adjust graph content therein, and when the user has corresponding rights, specific operations can be performed in the knowledge graph display interface. Fig. 6 is a schematic structural diagram of another display apparatus of knowledge graph according to an embodiment of the present disclosure, as shown in fig. 6, the apparatus may further include a graph checking module 54, a control triggering module 55, and/or a user operation module 56, specifically:
the map checking module 54 is configured to display map knowledge information of the knowledge map in a map checking area of the knowledge map display interface. In some embodiments, map verification module 54 is specifically configured to: and displaying the overview map knowledge information or the display map knowledge information of the knowledge map in a map inspection area of the knowledge map display interface. The map checking area can be an area set for a user with administrator authority in the knowledge map display interface, and the user can confirm, delete, modify and the like the map knowledge information in the area. The graph knowledge information may include node-related information for different node types.
The overview map knowledge information refers to all map knowledge information, and the display map knowledge information refers to part of map knowledge information corresponding to the currently displayed knowledge map. For example, referring to a box-selection interface labeled 2 in the knowledge graph display interface in fig. 2, graph knowledge information in two states can be displayed in the interface, and in an overview state, when a user just enters the interface and does not start to perform a search or click operation, all information of the entire knowledge graph is displayed in the interface; when the node details are entered by searching or clicking the node, the graph knowledge information displayed in the interface completely corresponds to the nodes of the knowledge graph displayed in the frame selection interface with the right label 3, namely, which nodes are on the graph, and the interface on the left side contains the information of which nodes.
The control triggering module 55 is specifically configured to receive a trigger of a user for at least one of a confirmation control, a deletion control, an editing control, an addition control, a view source control, and a batch operation control, and execute a corresponding operation. In some embodiments, at least one of a confirm control, a delete control, an edit control, an add control, a view source control, a hide relationship name control, and a batch operation control is presented in a graph inspection area of a knowledge graph presentation interface. After the atlas knowledge information of the knowledge atlas is displayed in the atlas checking area of the knowledge atlas display interface, corresponding operation can be performed on the atlas knowledge information based on the triggering of a user on a control. Referring to a frame selection interface labeled 2 in a knowledge map display interface in fig. 2, after a confirmation control is clicked, map knowledge information can be manually confirmed as a reliable result through a machine model estimation, for example, a problem corresponding to the map knowledge information is displayed, and confirmation can be achieved after manual answering; after clicking the view source control, displaying all data sets containing the node type on a popup window; after clicking the deleting control and the editing control, deleting and editing the map knowledge information, and correspondingly deleting or editing the relation edges connected with a certain node when deleting or editing the map knowledge information at the certain node; after clicking the adding control, a user can add new map knowledge information under the corresponding entity type, relationship type and event type, the user only needs to input the map knowledge information according to a prompt, the user can be automatically matched in the input process, and if the existing content in the map knowledge information is added, the user is prompted to be incapable of adding the new map knowledge information; after clicking the batch operation control, the user may perform a batch operation on a certain type of graph knowledge information, for example, delete all nodes under the node "company".
In addition, a node in a map checking area of the knowledge map display interface can be clicked, and the detail page of the node is skipped; and when the mouse is hovered at the corresponding node, the right-side knowledge graph can be highlighted in a matching manner, and the specific highlighting manner is not limited, for example, the highlighting manner can be highlighted.
The user operation module 56 is specifically configured to: receiving at least one of full screen viewing operation, enlarged viewing operation, reduced viewing operation, translation operation, three-dimensional zooming-out operation and three-dimensional zooming-in operation input by a user, and executing corresponding operation. The knowledge-graph may be a three-dimensional structure composed of nodes, i.e., a three-dimensional structure composed of nodes of three node types. Like the box-selected interface labeled 3 in the display interface of the knowledge graph of fig. 2, the knowledge graph can be displayed in a three-dimensional structure after being rendered based on the display parameter information of each node. After the knowledge graph is displayed to the user, the user can perform interactive operation on the knowledge graph with the three-dimensional structure at a knowledge graph display interface, and the specific operation can include at least one of full-screen viewing operation, enlarged viewing operation, reduced viewing operation, translation operation, three-dimensional zooming-out operation and three-dimensional zooming-in operation. Illustratively, after the user inputs a full screen viewing operation, an interface of the full screen viewing knowledge base can be entered; based on the operation, the overall interaction of the size scaling, the three-dimensional zooming-in and zooming-out, the left-right translation and the like of the knowledge graph can be realized.
In some embodiments, the user can also adjust the overall display mode of the knowledge graph through local interaction operations such as dragging of a mouse, clicking of a switching center node and the like, and therefore the use experience of the user is improved. In addition, as for the box-selected interface labeled 3 in the knowledge graph display interface of fig. 2, the number of different types of nodes of the current page may also be displayed in the knowledge graph display interface, the number of the entity types and the number of the relationship types are both 21, and the number of the event types is 17, which is only an example; moreover, the relation name may also be displayed in the knowledge graph, and in the case of a large number of relations, the relation name may affect the user's view of the graph content, or the relation name may be selected not to be displayed, and the user may concentrate on the examination of the knowledge graph.
In the embodiment of the disclosure, through the cooperative execution among the modules, the complex underlying structure of the knowledge graph can be abstracted into a three-dimensional structure consisting of points and edges, so as to help a user to better understand the existence form and structure of graph data and support the user to configure and display structures, such as quantity, hierarchy and the like, in a certain self-defining way; and the map checking area adopts the design of a left structure and a right structure, the left side is used for content addition and deletion, the right side displays the actual structure of the map, the situation that direct editing on the map is difficult is avoided, different functions can be automatically matched for users with different roles, and the labor division is clear.
A further embodiment of the present disclosure provides a computer apparatus, including:
a processor for implementing the steps of the method of displaying a knowledge-graph as described above when executing a computer program stored in the memory.
The processor may be a Central Processing Unit (CPU) or other form of processing unit having data processing capabilities and/or instruction execution capabilities, and may control other components in the computer to perform desired functions.
The memory may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. Volatile memory can include, for example, Random Access Memory (RAM), cache memory (or the like). The non-volatile memory may include, for example, Read Only Memory (ROM), a hard disk, flash memory, and the like. One or more computer program instructions may be stored on a computer-readable storage medium and executed by a processor to implement the above method steps of the various embodiments of the present application and/or other desired functions.
The disclosed embodiments also provide a computer readable storage medium, on which computer instructions are stored, and when executed by a processor, the computer instructions implement the steps of the above method for displaying a knowledge-graph.
In addition to the methods and apparatus described above, embodiments of the present application may also be a computer program product comprising computer program instructions that, when executed by a processor, cause the processor to perform the method steps of the various embodiments of the present application.
The computer program product may include program code for carrying out operations for embodiments of the present invention in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like 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 computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.
Furthermore, embodiments of the present application may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform the method steps of the various embodiments of the present application.
A computer-readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing are merely exemplary embodiments of the present disclosure, which enable those skilled in the art to understand or practice the present disclosure. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A knowledge graph display method is characterized by comprising the following steps:
acquiring attribute information of nodes in a knowledge graph to be displayed;
acquiring display parameter information of the node based on the attribute information of the node;
and generating and displaying the knowledge graph on a knowledge graph display interface according to the display parameter information of the nodes.
2. The method of claim 1, wherein the attribute information of the node comprises at least one of a node density, a node type, and a node hierarchy;
the display parameter information of the node includes at least one of brightness information, size information, color information, shape information, and transparency information.
3. The method according to claim 2, wherein the obtaining of the exhibition parameter information of the node based on the attribute information comprises at least one of:
acquiring color information and/or shape information of the node based on the node type of the node;
acquiring transparency information and/or brightness information of the node based on the node level of the node;
and acquiring the size information of the node based on the node density of the node.
4. The method according to claim 2, wherein the obtaining of the display parameter information of the node based on the attribute information comprises:
acquiring nodes of which the node density meets a first preset condition based on the node density of the nodes;
taking the node meeting the first preset condition as a first central node, and acquiring a node of which the node level meets a second preset condition;
and acquiring display parameter information of the first central node and the nodes meeting the second preset condition.
5. The method according to claim 2, wherein the obtaining of the display parameter information of the node based on the attribute information comprises:
determining a second central node based on the search result information or the node selection operation, and acquiring nodes of which the node levels meet a third preset condition;
and acquiring display parameter information of the second central node and the nodes meeting the third preset condition.
6. The method of claim 5, wherein prior to determining the second central node based on the search result information, further comprising:
acquiring a search keyword input by a user through a search box;
determining nodes of which the node names and the search keywords meet preset matching conditions, and displaying the nodes as search result information;
the determining the second center node based on the search result information includes:
and acquiring a second central node selected by the user from the search result information.
7. The method according to claim 6, wherein the preset matching condition comprises at least two matching conditions with priority levels determined according to matching degrees, and the determining the node name and the node of which the search keyword satisfy the preset matching condition comprises:
and preferentially acquiring the nodes meeting the matching conditions with high priority according to the priority levels of the matching conditions in sequence, and acquiring the nodes meeting the matching conditions with low priority when the matching conditions with high priority have no matching result.
8. A knowledge-graph displaying apparatus, the apparatus comprising:
the attribute information acquisition module is used for acquiring the attribute information of the nodes in the knowledge graph to be displayed;
the display parameter acquisition module is used for acquiring the display parameter information of the node based on the attribute information of the node;
and the map display module is used for generating and displaying the knowledge map on a knowledge map display interface according to the display parameter information of the nodes.
9. A computer device, the computer device comprising:
a processor for implementing the steps of the method according to any one of claims 1 to 7 when executing a computer program stored in a memory.
10. A computer-readable storage medium having stored thereon computer instructions, which, when executed by a processor, carry out the steps of the method according to any one of claims 1 to 7.
CN202010671049.5A 2020-07-13 2020-07-13 Knowledge graph display method and device, computer device and readable storage medium Pending CN112035708A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010671049.5A CN112035708A (en) 2020-07-13 2020-07-13 Knowledge graph display method and device, computer device and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010671049.5A CN112035708A (en) 2020-07-13 2020-07-13 Knowledge graph display method and device, computer device and readable storage medium

Publications (1)

Publication Number Publication Date
CN112035708A true CN112035708A (en) 2020-12-04

Family

ID=73579511

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010671049.5A Pending CN112035708A (en) 2020-07-13 2020-07-13 Knowledge graph display method and device, computer device and readable storage medium

Country Status (1)

Country Link
CN (1) CN112035708A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112733019A (en) * 2020-12-31 2021-04-30 郑州轻工业大学 Open knowledge graph reasoning research system
CN112988950A (en) * 2021-03-12 2021-06-18 成都数联铭品科技有限公司 Front-end rendering method and system of knowledge graph, electronic device and storage medium
CN113010686A (en) * 2021-03-04 2021-06-22 北京顶象技术有限公司 Knowledge graph display method
CN113157945A (en) * 2021-05-11 2021-07-23 两比特(北京)科技有限公司 Cloud data movie & TV industry data knowledge map
CN113609282A (en) * 2021-08-09 2021-11-05 神州数码融信软件有限公司 Drawing method of automatic drawing engine
US11669556B1 (en) 2021-12-27 2023-06-06 Quantiphi Inc Method and system for document retrieval and exploration augmented by knowledge graphs
CN116910131A (en) * 2023-09-12 2023-10-20 山东省国土测绘院 Linkage visualization method and system based on basic geographic entity database

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018072071A1 (en) * 2016-10-18 2018-04-26 浙江核新同花顺网络信息股份有限公司 Knowledge map building system and method
CN109657067A (en) * 2018-11-19 2019-04-19 平安科技(深圳)有限公司 Methods of exhibiting, device, computer equipment and the storage medium of knowledge mapping

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018072071A1 (en) * 2016-10-18 2018-04-26 浙江核新同花顺网络信息股份有限公司 Knowledge map building system and method
CN109804364A (en) * 2016-10-18 2019-05-24 浙江核新同花顺网络信息股份有限公司 Knowledge mapping constructs system and method
CN109657067A (en) * 2018-11-19 2019-04-19 平安科技(深圳)有限公司 Methods of exhibiting, device, computer equipment and the storage medium of knowledge mapping

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112733019A (en) * 2020-12-31 2021-04-30 郑州轻工业大学 Open knowledge graph reasoning research system
CN113010686A (en) * 2021-03-04 2021-06-22 北京顶象技术有限公司 Knowledge graph display method
CN112988950A (en) * 2021-03-12 2021-06-18 成都数联铭品科技有限公司 Front-end rendering method and system of knowledge graph, electronic device and storage medium
CN112988950B (en) * 2021-03-12 2023-10-13 成都数联铭品科技有限公司 Front-end rendering method and system of knowledge graph, electronic equipment and storage medium
CN113157945A (en) * 2021-05-11 2021-07-23 两比特(北京)科技有限公司 Cloud data movie & TV industry data knowledge map
CN113609282A (en) * 2021-08-09 2021-11-05 神州数码融信软件有限公司 Drawing method of automatic drawing engine
US11669556B1 (en) 2021-12-27 2023-06-06 Quantiphi Inc Method and system for document retrieval and exploration augmented by knowledge graphs
CN116910131A (en) * 2023-09-12 2023-10-20 山东省国土测绘院 Linkage visualization method and system based on basic geographic entity database
CN116910131B (en) * 2023-09-12 2023-12-08 山东省国土测绘院 Linkage visualization method and system based on basic geographic entity database

Similar Documents

Publication Publication Date Title
CN112035708A (en) Knowledge graph display method and device, computer device and readable storage medium
WO2018072071A1 (en) Knowledge map building system and method
US8281238B2 (en) System, method and computer program for creating and manipulating data structures using an interactive graphical interface
CN106599039B (en) Statistical representation method supporting free combination nesting of relational database data
US20070244921A1 (en) Method, apparatus and computer-readable medium to provide customized classification of documents in a file management system
US20070185876A1 (en) Data handling system
US10565280B2 (en) Website content identification in a content management system
CN106708484B (en) Method and device for establishing page
US20110214080A1 (en) Taxonomy Editor
WO2022111249A1 (en) Information presentation method, apparatus, and computer storage medium
US9081767B2 (en) Browsing of contextual information
EP0897158B1 (en) Method for automatic processing of information materials for personified use
US20200342029A1 (en) Systems and methods for querying databases using interactive search paths
CA2556767A1 (en) Data handling system
CN113407678B (en) Knowledge graph construction method, device and equipment
JP7206632B2 (en) System, method and program for visual exploration of subnetwork patterns in bimodal networks
JP5298616B2 (en) Information presenting apparatus, information presenting method, and information presenting program
TWI579718B (en) System and Methods for Graphical Resources Management Application for Graphical Resources Management
CN112231802A (en) Multi-window examination method and device of BIM file and computer storage medium
JP7119550B2 (en) System and method, program, and computer device for visual search of search results in bimodal networks
CN113934893A (en) Method and device for displaying map, computer device and readable storage medium
CN112256573B (en) SIMSCRIPT language oriented simulation program visualization method
US20230376689A1 (en) Devices, systems, and methods for displaying and linking legal content
Jin et al. Design and implementation for report layout merging
CN117216182A (en) Method and device for generating document index page

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