CN112541043A - Method, device and equipment for detecting connectivity of nodes of knowledge graph - Google Patents
Method, device and equipment for detecting connectivity of nodes of knowledge graph Download PDFInfo
- Publication number
- CN112541043A CN112541043A CN202011550668.5A CN202011550668A CN112541043A CN 112541043 A CN112541043 A CN 112541043A CN 202011550668 A CN202011550668 A CN 202011550668A CN 112541043 A CN112541043 A CN 112541043A
- Authority
- CN
- China
- Prior art keywords
- node
- communication path
- attribute information
- connectivity
- person
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004891 communication Methods 0.000 claims abstract description 107
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/288—Entity relationship models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to the technical field of knowledge graphs, and discloses a method for detecting connectivity of nodes of a knowledge graph, which comprises the following steps: acquiring first attribute information of a first node and second attribute information of a second node; determining a first communication path between the first node and the second node according to the first attribute information and the second attribute information; and determining the connectivity of the first node and the second node according to the first communication path. The method can determine the connectivity of the first node and the second node through the first communication path between the first node and the second node, and can more quickly determine the connectivity between the first node and the second node without expanding all nodes having a relationship with the first node or the second node, thereby improving the efficiency of detecting the connectivity between the nodes in the knowledge graph. The application also discloses a device and equipment for detecting connectivity of the nodes of the knowledge graph.
Description
Technical Field
The present application relates to the field of knowledge graph technology, and for example, to a method, an apparatus, and a device for detecting connectivity of nodes of a knowledge graph.
Background
The knowledge graph is a data structure based on a graph and is a semantic network formed by connecting knowledge points. A knowledge graph is used to describe entities or concepts existing in the real world and the relationships between them; nodes in the knowledge-graph represent entities or concepts, and edges in the knowledge-graph represent relationships between nodes. People often obtain desired information through a knowledge graph, such as obtaining whether any node a is associated with a node B, etc. However, when determining whether node a is associated with node B, i.e. whether node a is connected to node B, it is often necessary to extend all nodes associated with node a to compare with node B, which consumes a lot of time.
In the process of implementing the embodiments of the present disclosure, it is found that at least the following problems exist in the related art: in the prior art, the detection efficiency of the connectivity among all nodes in the knowledge graph is low, and the user experience is poor.
Disclosure of Invention
The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed embodiments. This summary is not an extensive overview nor is intended to identify key/critical elements or to delineate the scope of such embodiments but rather as a prelude to the more detailed description that is presented later.
The embodiment of the disclosure provides a method, a device and equipment for detecting connectivity of nodes of a knowledge graph, so that the efficiency of detecting the connectivity among the nodes in the knowledge graph can be improved.
In some embodiments, the method comprises: acquiring first attribute information of a first node and second attribute information of a second node; determining a first communication path between the first node and the second node according to the first attribute information and the second attribute information; and determining the connectivity of the first node and the second node according to the first communication path.
In some embodiments, the apparatus comprises: a processor and a memory storing program instructions, the processor being configured to, when executing the program instructions, perform the method for detecting connectivity of a knowledgegraph node as described above.
In some embodiments, the apparatus comprises: the device for detecting connectivity of the nodes of the knowledge-graph is described above.
The method, the device and the equipment for detecting connectivity of nodes of the knowledge graph provided by the embodiment of the disclosure can achieve the following technical effects: the first communication path between the first node and the second node can be determined through the first attribute information of the first node and the second attribute information of the second node; and the connectivity between the first node and the second node is determined through the first communication path, all nodes which have a relationship with the first node or the second node do not need to be expanded, and the connectivity between the first node and the second node can be determined more quickly, so that the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved, and the user experience is improved.
The foregoing general description and the following description are exemplary and explanatory only and are not restrictive of the application.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the accompanying drawings and not in limitation thereof, in which elements having the same reference numeral designations are shown as like elements and not in limitation thereof, and wherein:
FIG. 1 is a schematic diagram of a method for detecting connectivity of nodes of a knowledge-graph according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of an apparatus for detecting connectivity of nodes of a knowledge-graph according to an embodiment of the present disclosure.
Detailed Description
So that the manner in which the features and elements of the disclosed embodiments can be understood in detail, a more particular description of the disclosed embodiments, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings. In the following description of the technology, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may be practiced without these details. In other instances, well-known structures and devices may be shown in simplified form in order to simplify the drawing.
The terms "first," "second," and the like in the description and in the claims, and the above-described drawings of embodiments of the present disclosure, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the present disclosure described herein may be made. Furthermore, the terms "comprising" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions.
The term "plurality" means two or more unless otherwise specified.
In the embodiment of the present disclosure, the character "/" indicates that the preceding and following objects are in an or relationship. For example, A/B represents: a or B.
The term "and/or" is an associative relationship that describes objects, meaning that three relationships may exist. For example, a and/or B, represents: a or B, or A and B.
As shown in fig. 1, an embodiment of the present disclosure provides a method for detecting connectivity of a node of a knowledge-graph, including:
step S101, acquiring first attribute information of a first node and acquiring second attribute information of a second node;
step S102, determining a first communication path between a first node and a second node according to the first attribute information and the second attribute information;
and step S103, determining the connectivity of the first node and the second node according to the first communication path.
By adopting the method for detecting connectivity of nodes of the knowledge graph, provided by the embodiment of the disclosure, a first communication path between a first node and a second node can be determined through first attribute information of the first node and second attribute information of the second node; and the connectivity between the first node and the second node is determined through the first communication path, all nodes which have a relationship with the first node or the second node do not need to be expanded, and the connectivity between the first node and the second node can be determined more quickly, so that the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved, and the user experience is improved.
In some embodiments, nodes in the knowledge-graph represent entities and edges represent relationships between nodes. Optionally, the first attribute information is attribute information corresponding to an entity represented by the first node; for example, the entity represented by the first node is Zhang III person, and the corresponding first attribute information is "person"; for another example, the entity represented by the first node is a vehicle of the license plate number a, and the corresponding first attribute information is "vehicle". Optionally, the second attribute information is attribute information corresponding to an entity represented by the second node; for example, the entity represented by the second node is a person "Liqu", and the corresponding second attribute information is "person"; for another example, the entity represented by the second node is a user interface, and the corresponding second attribute information is "user interface".
Optionally, determining a first communication path from the first node to the second node according to the first attribute information and the second attribute information includes: matching a first communication path corresponding to the first attribute information and the second attribute information in a preset communication path database; the communication path database stores a first communication path of which the first attribute information corresponds to the second attribute information.
In some embodiments, as shown in table 1, table 1 is an example table of a communication path database:
TABLE 1
In some embodiments, as shown in table 1, in the case where the first attribute information is "person", the second attribute information is "person", the first communication path corresponding to person is ' person-to-person spouse relationship communication ', ' person-to-person friendship relationship communication ', ' person is communicated to the household mouth through person-to-household mouth relationship, then communicated to person according to household mouth and household owner relationship ', ' person is communicated to person through person-to-person spouse relationship, person is communicated to household mouth through person-to-household mouth relationship, household mouth is communicated to person according to household mouth and household owner relationship ', ' person is communicated to household mouth through person-to-household spouse relationship, person is communicated to person through person-to-person spouse relationship ', ' person is communicated to person through person-to-person spouse relationship, person is communicated to household mouth through person-to-household mouth relationship, then communicated to person according to household mouth and household owner relationship, person is communicated to person through spouse relationship. In this way, the communication path from the first node to the second node is obtained by matching the first communication path corresponding to the first attribute information and the second attribute information in the communication path database.
Optionally, determining connectivity between the first node and the second node according to the first connection path includes: acquiring a first alternative node corresponding to the first node according to the first communication path; and determining the connectivity of the first node and the second node according to the first alternative node.
Optionally, obtaining a first candidate node corresponding to the first node according to the first communication path includes: matching a fourth node corresponding to the first node in a preset graph database according to the first connection path, wherein the fourth attribute information of the fourth node is the same as the second attribute information; the graph information database stores the corresponding relation among the first communication path, the first node and the fourth node; and taking the fourth node as the first alternative node. In some embodiments, as shown in Table 2, Table 2 is an example table of a graph database:
TABLE 2
Optionally, determining connectivity between the first node and the second node according to the first candidate node includes: in the case where there is a first candidate node identical to the second node, the first node communicates with the second node.
In some embodiments, the first node is the person with the entity of zhang san, the second node is the person with the entity of lie san, and as shown in table 2, the spouse wang with the fourth node corresponding to zhang san, the friend of zhang san and the household owner of zhang san, zhang xi in a corresponding family mouth relationship are matched according to the first communication path, and wang wu, lie si and zhao xi are all used as the first candidate nodes. If a first candidate node identical to the second node "lie four" exists in the first candidate nodes, it is determined that the first node is communicated with the second node. In this way, the first candidate node is obtained according to the first communication path, and the connectivity of the first node and the second node is determined through the first candidate node. The nodes corresponding to the first nodes are expanded according to the first communication paths, all the nodes which are in relation with the first nodes do not need to be expanded, the connectivity between the first nodes and the second nodes can be determined more quickly, and therefore the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved. And because all nodes having a relationship with the first node or the second node do not need to be expanded, the occupation of the memory can be reduced.
Optionally, determining connectivity between the first node and the second node according to the first candidate node includes: under the condition that a first alternative node which is the same as the second node does not exist, determining a third node which is related to the first node; acquiring a second communication path between a third node and a second node, and determining the connectivity between the first node and the second node according to the second communication path; the third node is a node having a first communication path with the first node.
Optionally, determining a third node related to the first node comprises: and matching a third node corresponding to the first node in a preset graph database according to the first communication path, wherein the graph information database stores the first communication path, and the corresponding relation between the first node and the third node. In some embodiments, as shown in Table 3, Table 3 is another example table of a graph database:
TABLE 3
In some embodiments, as shown in table 3, the third node corresponding to zhang three is a spouse king five of zhang three, a friend yangqi of zhang three, a family mouth corresponding to zhang three, and a family owner who corresponds to zhang three is a zhao six according to the first connection path matching.
Optionally, acquiring a second communication path between the third node and the second node includes: acquiring third attribute information of a third node; matching a second communication path corresponding to the third attribute information and the second attribute information in a preset communication path database; and the communication path database stores a second communication path of which the third attribute information corresponds to the second attribute information.
Optionally, the third attribute information is attribute information corresponding to an entity represented by the third node; for example, the entity represented by the third node is wang five persons, and the corresponding third attribute information is "person". In some embodiments, as shown in table 4, table 4 is another example table of the communication path database:
TABLE 4
In some embodiments, as shown in table 4, in the case that the third attribute information is "person" and the second attribute information is "person", the second communication path corresponding to the matched person and person is "person-to-person spouse relationship communication", "person-to-person friendship relationship communication", "person is communicated to the house mouth through person-to-house mouth relationship first, then communicated to person according to house mouth-to-house principal relationship", "person is communicated to person through person-to-house mouth relationship, person is communicated to house mouth through person-to-house mouth relationship, house mouth is communicated to person according to house mouth-to-house principal relationship", "person is communicated to person through person-to-person spouse relationship", "person is communicated to person through person-to-house couple relationship, person is queried to house mouth through person-to-house mouth relationship, then communicated to person according to house mouth-to-house principal relationship, the person is then connected to the person by a spouse relationship. And under the condition that the third attribute information is 'family mouth' and the second attribute information is 'person', the second communication path corresponding to the family mouth and the person is 'family mouth and family owner relationship communication'. In this way, by matching the second communication path corresponding to the third attribute information and the second attribute information in the communication path database, a communication path from the third node to the second node is obtained.
Optionally, determining connectivity of the first node to the second node from the second communication path comprises: acquiring a second alternative node corresponding to the third node according to the second communication path; determining that the first node is communicated with the second node under the condition that a second alternative node identical to the second node exists; and under the condition that a second alternative node which is the same as the second node does not exist, determining that the first node is not communicated with the second node.
Optionally, acquiring a second candidate node corresponding to the third node according to the second communication path, including: matching a fifth node corresponding to the third node in a preset graph database according to the second communication path, wherein the fifth attribute information of the fifth node is the same as the second attribute information; the graph information database stores the corresponding relation among the second communication path, the third node and the fifth node; and taking the fifth node as a second alternative node. In some embodiments, as shown in Table 5, Table 5 is another example table of a graph database:
TABLE 5
In some embodiments, the first node is the person with the entity of zhang san, the second node is the person with the entity of lie xi, and in a case that the first candidate nodes are not the same as the second nodes, as shown in table 5, a spouse zhang san, a friend lie xi of wang wu, and a user master zhao xi of a user mouth corresponding to wang wu corresponding to the fifth node wang wu are matched according to the second communication path, and zhang san, lie xi, and zhao jun are all taken as the second candidate nodes. If a second candidate node identical to the second node "lie four" exists in the second candidate nodes, it is determined that the first node is communicated with the second node. Therefore, by acquiring the third node related to the first node, acquiring the second candidate node according to the third attribute information of the third node and the second communication path of the second attribute information, determining the connectivity of the first node and the second node through the second candidate node, and expanding the nodes corresponding to the third node according to the second communication path without expanding all the nodes related to the third node, the connectivity between the first node and the second node can be determined more quickly, so that the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved. And because all corresponding nodes of the third node do not need to be expanded, the occupation of the memory can be reduced.
In practical application, the first node is a natural person Liu, the second node is a vehicle with a license plate number G, the first attribute information corresponding to the first node is 'person', and the attribute information corresponding to the second node is 'vehicle'; matching a first communication path corresponding to 'person' and 'vehicle' in the communication path database, wherein the first communication path is 'person-vehicle ownership communication', 'person-vehicle violation relationship communication', 'firstly communicating to a person according to a person-person spouse relationship, then communicating to a vehicle according to a person-vehicle ownership relationship', 'firstly communicating to a person according to a person-person spouse relationship, and then communicating to a vehicle according to a person-vehicle violation relationship'; matching a fourth node corresponding to the first node Liu in the graph database according to the first communication path, wherein the fourth attribute information of the fourth node is 'vehicle', for example, matching a vehicle with a license plate number A owned by the fourth node Liu and a vehicle with a license plate number G owned by a spouse owned by the spouse; if a fourth node identical to the second node license plate number G exists, the fact that the natural person Liu of the first node is communicated with the second node license plate number G is determined, namely the natural person Liu of the first node is connected with the second node license plate number G. Therefore, the corresponding nodes are expanded to the first node only according to the first communication path, all the nodes which are in relation with the first node do not need to be expanded, the connectivity between the first node and the second node can be determined more quickly, and therefore the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved.
In some embodiments, the first node is entity Zhang three persons, the second node is entity Liang four persons, the first communication path corresponding to person and person matched in the communication path database is "person-to-person spouse relationship communication", "person-to-person friendship communication", "person is communicated to the house mouth through person-to-house mouth relationship first, then communicated to person according to house mouth-to-house principal relationship", "person is communicated to person through person-to-person spouse relationship, person is communicated to the house mouth through person-to-house mouth relationship", "person is communicated to person through person-to-house mouth relationship according to house mouth-to-house principal relationship, then communicated to person according to house mouth-to-house principal relationship, person is communicated to person through person-to-person spouse relationship", "person is communicated to person through person-to spouse relationship, person is communicated to the house mouth through person-to-house mouth relationship, then communicated to, the person is then connected to the person through the spouse relationship, and the like. Matching a fourth node corresponding to the third node according to the first communication path, wherein the fourth attribute information of the fourth node is the same as the second attribute information, and taking the fourth node as a first alternative node; under the condition that a first candidate node identical to the second node 'Liquan' exists in the first candidate nodes, determining that the first node is communicated with the second node; under the condition that a first alternative node which is the same as the second node Liqu does not exist, a third node corresponding to the first node is matched in a preset graph database according to a first communication path, a second communication path corresponding to third attribute information and second attribute information is matched in a communication path database, and a second alternative node corresponding to the third node is matched according to the second communication path; determining that the first node is communicated with the second node under the condition that a second alternative node identical to the second node exists; under the condition that a second alternative node which is the same as the second node does not exist, a sixth node corresponding to the third node is matched in a preset graph database according to the first communication path, the sixth node is a node which has the first communication path with the third node, a third communication path of the sixth node and the second node is obtained, a third alternative node corresponding to the sixth node is obtained according to the third communication path, and under the condition that the third alternative node which is the same as the second node exists, the first node is determined to be communicated with the second node; and under the condition that a third alternative node which is the same as the second node does not exist, continuously matching a node corresponding to the sixth node in the preset graph database according to the first connection path to judge until all the nodes corresponding to the first connection path are judged completely. Therefore, the corresponding nodes are expanded to the first node only according to the first communication path, all the nodes which are in relation with the first node do not need to be expanded, the connectivity between the first node and the second node can be determined more quickly, and therefore the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved. And because all corresponding nodes of the third node do not need to be expanded, the occupation of the memory can be reduced, and the user experience is improved.
As shown in fig. 2, an apparatus for detecting connectivity of a knowledge-graph node according to an embodiment of the present disclosure includes a processor (processor)100 and a memory (memory) 101. Optionally, the apparatus may also include a Communication Interface (Communication Interface)102 and a bus 103. The processor 100, the communication interface 102, and the memory 101 may communicate with each other via a bus 103. The communication interface 102 may be used for information transfer. The processor 100 may invoke logic instructions in the memory 101 to perform the method for detecting connectivity of a knowledgegraph node of the above embodiments.
In addition, the logic instructions in the memory 101 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products.
The memory 101, which is a computer-readable storage medium, may be used for storing software programs, computer-executable programs, such as program instructions/modules corresponding to the methods in the embodiments of the present disclosure. The processor 100 executes the functional applications and data processing by executing the program instructions/modules stored in the memory 101, i.e. implements the method for detecting connectivity of a knowledge-graph node in the above embodiments.
The memory 101 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal device, and the like. In addition, the memory 101 may include a high-speed random access memory, and may also include a nonvolatile memory.
By adopting the device for detecting connectivity of nodes of the knowledge graph, provided by the embodiment of the disclosure, a first communication path between a first node and a second node can be determined through first attribute information of the first node and second attribute information of the second node; and the connectivity between the first node and the second node is determined through the first communication path, all nodes which have a relationship with the first node or the second node do not need to be expanded, the connectivity between the first node and the second node can be determined more quickly, and therefore the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved.
The embodiment of the disclosure provides a device, which includes the above-mentioned apparatus for detecting connectivity of nodes of a knowledge-graph. The equipment can determine a first communication path between the first node and the second node through the first attribute information of the first node and the second attribute information of the second node; and the connectivity between the first node and the second node is determined through the first communication path, all nodes which have a relationship with the first node or the second node do not need to be expanded, the connectivity between the first node and the second node can be determined more quickly, and therefore the efficiency of detecting the connectivity between the nodes in the knowledge graph is improved.
Embodiments of the present disclosure provide a computer-readable storage medium storing computer-executable instructions configured to perform the above-described method for detecting connectivity of nodes of a knowledge-graph.
The disclosed embodiments provide a computer program product comprising a computer program stored on a computer-readable storage medium, the computer program comprising program instructions that, when executed by a computer, cause the computer to perform the above-described method for detecting connectivity of a knowledge-graph node.
The computer-readable storage medium described above may be a transitory computer-readable storage medium or a non-transitory computer-readable storage medium.
The technical solution of the embodiments of the present disclosure may be embodied in the form of a software product, where the computer software product is stored in a storage medium and includes one or more instructions to enable a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present disclosure. And the aforementioned storage medium may be a non-transitory storage medium comprising: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes, and may also be a transient storage medium.
The above description and drawings sufficiently illustrate embodiments of the disclosure to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. The examples merely typify possible variations. Individual components and functions are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in or substituted for those of others. Furthermore, the words used in the specification are words of description only and are not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed. Furthermore, the terms "comprises" and/or "comprising," when used in this application, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Without further limitation, an element defined by the phrase "comprising an …" does not exclude the presence of other like elements in a process, method or apparatus that comprises the element. In this document, each embodiment may be described with emphasis on differences from other embodiments, and the same and similar parts between the respective embodiments may be referred to each other. For methods, products, etc. of the embodiment disclosures, reference may be made to the description of the method section for relevance if it corresponds to the method section of the embodiment disclosure.
Those of skill in the art would appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software may depend upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments. It can be clearly understood by the skilled person that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments disclosed herein, the disclosed methods, products (including but not limited to devices, apparatuses, etc.) may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units may be merely a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to implement the present embodiment. In addition, functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In the description corresponding to the flowcharts and block diagrams in the figures, operations or steps corresponding to different blocks may also occur in different orders than disclosed in the description, and sometimes there is no specific order between the different operations or steps. For example, two sequential operations or steps may in fact be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. Each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Claims (10)
1. A method for detecting connectivity of nodes of a knowledge-graph, comprising:
acquiring first attribute information of a first node and second attribute information of a second node;
determining a first communication path between the first node and the second node according to the first attribute information and the second attribute information;
and determining the connectivity of the first node and the second node according to the first communication path.
2. The method of claim 1, wherein determining a first communication path from the first node to the second node according to the first attribute information and the second attribute information comprises:
matching a first communication path corresponding to the first attribute information and the second attribute information in a preset communication path database; the communication path database stores a first communication path of which the first attribute information corresponds to the second attribute information.
3. The method of claim 1, wherein determining connectivity of the first node to the second node based on the first connectivity path comprises:
acquiring a first alternative node corresponding to the first node according to the first communication path;
and determining the connectivity of the first node and the second node according to the first alternative node.
4. The method according to claim 3, wherein obtaining the first candidate node corresponding to the first node according to the first connection path comprises:
matching a fourth node corresponding to the first node in a preset graph database according to the first communication path, wherein fourth attribute information of the fourth node is the same as second attribute information; the graph information database stores corresponding relations among the first communication path, the first node and the fourth node;
and taking the fourth node as a first alternative node.
5. The method of claim 3, wherein determining connectivity of the first node to the second node based on the first candidate node comprises:
in the case where there is a first candidate node identical to the second node, the first node communicates with the second node.
6. The method of claim 3, wherein determining connectivity of the first node to the second node based on the first candidate node comprises:
determining a third node related to the first node under the condition that a first alternative node which is the same as the second node does not exist; acquiring a second communication path between the third node and the second node, and determining the connectivity between the first node and the second node according to the second communication path; the third node is a node having a first communication path with the first node.
7. The method according to claim 6, wherein obtaining a second communication path between the third node and the second node comprises:
acquiring third attribute information of the third node;
matching a second communication path corresponding to the third attribute information and the second attribute information in a preset communication path database; and the communication path database stores a second communication path of which third attribute information corresponds to second attribute information.
8. The method according to claim 6 wherein determining connectivity of the first node to the second node from the second communication path comprises:
acquiring a second alternative node corresponding to the third node according to the second communication path;
in the case that a second alternative node identical to the second node exists, the first node is communicated with the second node;
and under the condition that a second alternative node which is the same as the second node does not exist, the first node is not communicated with the second node.
9. An apparatus for detecting connectivity of nodes of a knowledge-graph, comprising a processor and a memory storing program instructions, wherein the processor is configured to, when executing the program instructions, perform the method for detecting connectivity of nodes of a knowledge-graph according to any one of claims 1 to 8.
10. An apparatus comprising means for detecting connectivity of a knowledgegraph node as claimed in claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011550668.5A CN112541043A (en) | 2020-12-24 | 2020-12-24 | Method, device and equipment for detecting connectivity of nodes of knowledge graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011550668.5A CN112541043A (en) | 2020-12-24 | 2020-12-24 | Method, device and equipment for detecting connectivity of nodes of knowledge graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112541043A true CN112541043A (en) | 2021-03-23 |
Family
ID=75017473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011550668.5A Pending CN112541043A (en) | 2020-12-24 | 2020-12-24 | Method, device and equipment for detecting connectivity of nodes of knowledge graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112541043A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018226404A1 (en) * | 2017-06-09 | 2018-12-13 | Microsoft Technology Licensing, Llc | Machine reasoning based on knowledge graph |
| CN110470303A (en) * | 2019-08-14 | 2019-11-19 | 新疆维吾尔自治区人民医院 | It goes to a doctor in a kind of hospital air navigation aid and device |
| CN110534168A (en) * | 2019-08-30 | 2019-12-03 | 北京百度网讯科技有限公司 | Medicine advises indicating risk method, apparatus, electronic equipment and storage medium |
| CN110727740A (en) * | 2018-07-17 | 2020-01-24 | 百度在线网络技术（北京）有限公司 | Association analysis method and device, computer equipment and readable medium |
| CN110750601A (en) * | 2019-10-16 | 2020-02-04 | 北京网众共创科技有限公司 | Interaction method and device based on connection path, storage medium and electronic device |
| CN111367188A (en) * | 2020-03-09 | 2020-07-03 | 京东方科技集团股份有限公司 | Smart home control method and device, electronic equipment and computer storage medium |
-
2020
- 2020-12-24 CN CN202011550668.5A patent/CN112541043A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018226404A1 (en) * | 2017-06-09 | 2018-12-13 | Microsoft Technology Licensing, Llc | Machine reasoning based on knowledge graph |
| CN110727740A (en) * | 2018-07-17 | 2020-01-24 | 百度在线网络技术（北京）有限公司 | Association analysis method and device, computer equipment and readable medium |
| CN110470303A (en) * | 2019-08-14 | 2019-11-19 | 新疆维吾尔自治区人民医院 | It goes to a doctor in a kind of hospital air navigation aid and device |
| CN110534168A (en) * | 2019-08-30 | 2019-12-03 | 北京百度网讯科技有限公司 | Medicine advises indicating risk method, apparatus, electronic equipment and storage medium |
| CN110750601A (en) * | 2019-10-16 | 2020-02-04 | 北京网众共创科技有限公司 | Interaction method and device based on connection path, storage medium and electronic device |
| CN111367188A (en) * | 2020-03-09 | 2020-07-03 | 京东方科技集团股份有限公司 | Smart home control method and device, electronic equipment and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107609186B (en) | Information processing method and device, terminal device and computer readable storage medium | |
| CN108733681B (en) | Information processing method and device | |
| CN104866625B (en) | A kind of method and system for Entities Matching | |
| KR20190038751A (en) | User keyword extraction apparatus, method and computer readable storage medium | |
| CN106156145A (en) | The management method of a kind of address date and device | |
| CN102810094A (en) | Report generation method and device | |
| CN110162637B (en) | Information map construction method, device and equipment | |
| CN109388643A (en) | A kind of rapid data searching system and method based on block chain | |
| CN103678583A (en) | Method and system for comparing structural data | |
| CN104809751B (en) | The method and apparatus for generating event group evolution diagram | |
| CN111241429B (en) | Method and device for determining space-time relationship, electronic equipment and storage medium | |
| CN105630419A (en) | Partition view sending method of resource pools and management node | |
| CN103810248A (en) | Method and device for searching for interpersonal relationship based on photos | |
| CN106062739A (en) | Dynamic stream computing topology | |
| CN104216933A (en) | Method and system for obtaining knowledge point covert relationships | |
| CN106202440A (en) | Data processing method, device and equipment | |
| CN112541043A (en) | Method, device and equipment for detecting connectivity of nodes of knowledge graph | |
| US11531706B2 (en) | Graph search using index vertices | |
| CN104298786B (en) | A kind of image search method and device | |
| CN103902709A (en) | Association analyzing method | |
| CN110399360A (en) | The setting method and device of dictionary table, storage medium, electronic device | |
| CN107943982B (en) | K-means text clustering method and device with built-in constraint rule | |
| CN109471969A (en) | A kind of application searches method, device and equipment | |
| CN110096692A (en) | A kind of Semantic Information Processing method and apparatus | |
| CN107798249A (en) | The dissemination method and terminal device of behavioral pattern data |
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 |