CN112825083A - Method, device and equipment for constructing group relation network and readable storage medium - Google Patents
Method, device and equipment for constructing group relation network and readable storage medium Download PDFInfo
- Publication number
- CN112825083A CN112825083A CN201911142229.8A CN201911142229A CN112825083A CN 112825083 A CN112825083 A CN 112825083A CN 201911142229 A CN201911142229 A CN 201911142229A CN 112825083 A CN112825083 A CN 112825083A
- Authority
- CN
- China
- Prior art keywords
- personnel
- nodes
- person
- starting point
- search starting
- 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 32
- 238000010276 construction Methods 0.000 claims abstract description 11
- 238000004590 computer program Methods 0.000 claims description 31
- 238000010845 search algorithm Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 claims description 5
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 238000002372 labelling Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 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/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9536—Search customisation based on social or collaborative filtering
Abstract
The invention provides a method, a device, equipment and a readable storage medium for constructing a group relation network, wherein the construction method comprises the following steps: acquiring a personnel relationship graph, wherein the personnel relationship graph comprises a plurality of personnel nodes and connection relations among the personnel nodes; determining a plurality of target personnel nodes with connection relations from the personnel relation graph; and taking the target person nodes and the connection relations among the target person nodes as a group relation network. The invention can accurately dig out the group information.
Description
Technical Field
The invention relates to the technical field of artificial intelligence, in particular to a method, a device, equipment and a readable storage medium for constructing a group relation network.
Background
Artificial intelligence is widely used in the field of security, for example: the personnel query based on image recognition can query information such as the identity, the snapshot time and the snapshot address of a target person, and the behavior and the relationship of the personnel are analyzed through the queried information. At present, along with the increasingly complex relationship between people and the development requirement of security service, more and more cameras are deployed, the data acquired by the cameras are increasingly large, the life cycle of image data is increasingly long, and massive image data is formed. However, in the security field, in order to research or detect an event, analysis of relationships among people in a certain group is often required, but at present, mass image data exist in isolation, and group information cannot be accurately mined.
Disclosure of Invention
The embodiment of the invention provides a method, a device and equipment for constructing a group relation network and a readable storage medium, and aims to solve the problem that group information cannot be accurately mined.
In order to achieve the above object, in a first aspect, an embodiment of the present invention provides a method for constructing a swarm relationship network, including:
acquiring a personnel relationship graph, wherein the personnel relationship graph comprises a plurality of personnel nodes and connection relations among the personnel nodes;
determining a plurality of target personnel nodes with connection relations from the personnel relation graph;
and taking the target person nodes and the connection relations among the target person nodes as a group relation network.
In a second aspect, an embodiment of the present invention further provides a device for constructing a swarm relationship network, including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a personnel relation map, and the personnel relation map comprises a plurality of personnel nodes and connection relations among the personnel nodes;
the determining module is used for determining a plurality of target personnel nodes with connection relations from the personnel relation graph;
and the construction module is used for taking the target personnel nodes and the connection relations among the target personnel nodes as a group relation network.
In a third aspect, an embodiment of the present invention further provides an apparatus for constructing a swarm relational network, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the above-mentioned swarm relational network constructing method when executing the computer program.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps of the above-mentioned method for constructing a swarm relational network.
The scheme of the invention has at least the following beneficial effects:
in the embodiment of the invention, the group information is obtained by acquiring the personnel relationship map, determining a plurality of target personnel nodes with connection relations from the personnel relationship map, and finally taking the determined plurality of target personnel nodes and the connection relations among the plurality of target personnel nodes as a group relationship network. The group information can be accurately mined by analyzing the personnel relationship map and finding out the target personnel nodes with connection relationship from the personnel relationship map.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a method for constructing a group relationship network according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a person relationship graph in an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a device for constructing a swarm relationship network according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a device for constructing a group relationship network in the embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means two or more unless specifically defined otherwise.
As shown in fig. 1, an embodiment of the present invention provides a method for constructing a swarm relationship network, where the method includes:
In the embodiment of the present invention, the people relationship map may be a people relationship map of a designated area, for example, a people relationship map of a certain city, a people relationship map of a certain cell, and the like. It should be noted that the personnel relationship map may be constructed in advance, and specifically may be constructed by image data acquired by a camera deployed in a corresponding region, for example, the same-row image data captured by the camera is constructed, two personnel are captured at the same time and place, and then the two personnel may be determined as the same row, and the personnel relationship map may be connected through a connection line if the same-row relationship exists.
In addition, the personnel nodes in the personnel relationship graph have a mapping relationship with the corresponding personnel information, namely the personnel information of one personnel can be positioned to the position of the personnel in the relationship graph; or selecting a person node in the person relationship map to obtain the person information corresponding to the person node. In the personnel relation map, two personnel nodes with the same-row relation are connected through a connecting line, and no connecting line exists between two personnel nodes without the same-row relation. In practical applications, in order to facilitate identification of relationships between people, the connecting line may be set with corresponding attribute values (the attribute values are used to indicate the degree of relationship between two people nodes), and the more intimate the relationship is, the higher the attribute value is. In some possible embodiments, when the two person nodes are immediate relatives, the attribute value is the highest, and the attribute value of strangers of the same row is the lowest.
And 12, determining a plurality of target personnel nodes with connection relations from the personnel relation graph.
In the embodiment of the present invention, a plurality of target person nodes having a connection relationship may be in a direct connection relationship or in an indirect connection relationship. As shown in the person relationship graph of fig. 2, the person node 0 is in a direct connection relationship with the person node 5, and the person node 0 is in an indirect connection relationship with the person node 4. Specifically, in the embodiment of the present invention, the target person node having a connection relationship may be determined from the person relationship map by using a depth-first search algorithm. It should be noted that the determined target person nodes may be a group or multiple groups, for example, in the person relationship graph shown in fig. 2, the person node 0, the person node 1, the person node 2, the person node 6, the person node 4, the person node 3, and the person node 5 are a group of target person nodes having a connection relationship, the person node 7 and the person node 8 are a group of target person nodes having a connection relationship, and the person node 9, the person node 10, the person node 11, and the person node 12 are a group of target person nodes having a connection relationship.
And step 13, taking the target person nodes and the connection relations among the target person nodes as a group relation network.
In the embodiment of the present invention, the group refers to a group formed by different individuals (e.g. people) combined together according to a certain characteristic, and performing a co-activity and a mutual interaction. Namely, the group comprises the personnel nodes with connection relations in the personnel relation graph. As in the person relationship graph shown in fig. 2, a person node 0, a person node 1, a person node 2, a person node 6, a person node 4, a person node 3, and a person node 5 are a group.
It should be noted that, in the embodiment of the present invention, if the plurality of target person nodes determined in step 12 are a group, the group of the plurality of target person nodes and a connection relationship between the group of the plurality of target person nodes (the connection relationship refers to a connection line between the plurality of target person nodes) may be regarded as a group relationship network; if the plurality of target person nodes determined in step 12 are a plurality of groups, a group relationship network needs to be constructed for each group of the plurality of target person nodes. As in the personnel relationship graph shown in fig. 2, a personnel node 0, a personnel node 1, a personnel node 2, a personnel node 6, a personnel node 4, a personnel node 3 and a personnel node 5, and the connection relationship among the personnel nodes are a group relationship network; the personnel nodes 7 and the personnel nodes 8, and the connection relationship between the personnel nodes 7 and the personnel nodes 8 are a group relationship network; the personnel nodes 9, the personnel nodes 10, the personnel nodes 11, the personnel nodes 12 and the connection relationship among the personnel nodes are a group relationship network.
It should be noted that, in the embodiment of the present invention, group information is obtained by obtaining a person relationship graph, determining a plurality of target person nodes having a connection relationship from the person relationship graph, and finally using the determined plurality of target person nodes and the connection relationship between the plurality of target person nodes as a group relationship network. The group information can be accurately mined by analyzing the personnel relationship map and finding out the target personnel nodes with connection relationship from the personnel relationship map.
In an embodiment of the present invention, after the step 13 is executed, the constructing method further includes the following steps: and setting group identification information for the group relation network so as to identify the group relation network. It can be understood that, if a plurality of group relationship networks are constructed, the group identification information corresponding to each group relationship network is different, so as to identify and distinguish each group relationship network. As a preferred example, the group identification information may be an identifier. The identifier of the group relation network formed by the personnel nodes 0, 1, 2, 6, 4, 3 and 5 and the connection relation among the personnel nodes is 0; the identifier of a group relation network formed by the personnel nodes 7 and the personnel nodes 8 and the connection relationship between the personnel nodes 7 and the personnel nodes 8 is 1; the identifier of the group relationship network formed by the personnel nodes 9, 10, 11, 12 and the connection relationship among the personnel nodes is 2. In software coding, the personnel nodes and the group identification information in the same group relation network can be associated (such as int (integer value)) by using an array id [ ] with the personnel nodes as indexes.
It should be noted that the group information obtained by the construction method provides a data basis for the analysis of subsequent group information, the shortest relationship path between two persons in the group, the common relationship map between two persons, and the like, and is convenient for the research and detection of certain events.
Next, an implementation of the above step 12 will be explained.
Specifically, in step 12, the specific implementation manner of determining the plurality of target person nodes having connection relationships from the person relationship graph includes the following steps:
step one, any person node in the person relation graph is used as a group search starting point, and the group search starting point is marked. As the personnel node 0 in FIG. 2 is used as the group search starting point, it can be realized by a mark array when the software is coded.
Specifically, in the embodiment of the present invention, after any person node is used as a group search starting point, the group search starting point may be marked in a manner of marking the group search starting point as visited, so as to traverse all person nodes in the person relationship graph.
And secondly, determining the personnel nodes directly or indirectly connected with the group search starting point from the unlabeled personnel nodes in the personnel relationship graph.
Specifically, in the embodiment of the present invention, the person nodes directly or indirectly connected to the group search starting point may be determined from the unlabeled person nodes in the person relationship graph by a depth-first search algorithm (preferably, a recursive depth-first search algorithm).
It is understood that, in the embodiment of the present invention, to ensure that all the person nodes in the person relationship graph can be quickly traversed, after the second step is performed, the constructing method further includes the following steps: and marking the personnel nodes directly or indirectly connected with the group search starting point. The person nodes directly or indirectly connected to the group search starting point may be marked specifically by marking the person nodes directly or indirectly connected to the group search starting point as visited.
And step three, taking the group search starting point and the person node directly or indirectly connected with the group search starting point as a plurality of target person nodes with connection relations.
In an embodiment of the present invention, after the third step is performed, the constructing method further includes the following steps:
and repeatedly judging whether the personnel nodes which are not marked exist in the personnel relationship graph until all the personnel nodes in the personnel relationship graph are marked. When the personnel relation graph is judged to have the unlabeled personnel nodes, any one of the unlabeled personnel nodes is used as a group search starting point, the group search starting point is labeled, personnel nodes directly or indirectly connected with the group search starting point are determined from the unlabeled personnel nodes in the personnel relation graph, the personnel nodes directly or indirectly connected with the group search starting point are labeled, and the group search starting point and the personnel nodes directly or indirectly connected with the group search starting point are used as a plurality of target personnel nodes with connection relations. It should be noted that, in this step, a person node directly or indirectly connected to the group search starting point may also be determined from the unlabeled person nodes in the person relationship graph through a depth-first search algorithm, and labeling the person node in the person relationship graph may also be implemented by labeling the person node as visited.
That is, in the embodiment of the present invention, after the first group of multiple target person nodes are determined, it is further necessary to repeatedly determine whether an unlabeled person node exists in the person relationship graph until all person nodes in the person relationship graph are labeled, so as to mine all group information in the person relationship graph.
Here, the method for constructing the population relationship network will be further described by taking the person relationship map shown in fig. 2 as an example. Specifically, the method for constructing the group relation network comprises the following steps:
first, starting from a person node 0, marking the person node 0 as visited (i.e., marked [0] ═ T), and marking the person node 0 as a group 0 (i.e., id [0] ═ 0);
a second step, performing recursive access on the adjacent personnel node 6 of the personnel node 0, marking the personnel node 6 as visited (i.e. marked [6] ═ T), and marking the personnel node 6 as group 0 (i.e. id [6] ═ 0);
thirdly, carrying out recursive access on the adjacent personnel node 0 of the personnel node 6, and finding out that the personnel node 0 is marked as accessed, so that the personnel node is directly skipped over;
a fourth step of performing recursive visit on the adjacent person node 4 of the person node 6, and marking the person node 4 as visited (i.e. marked [4] ═ T), and marking the person node 4 as group 0 (i.e. id [4] ═ 0);
a fifth step of performing recursive access on the adjacent person node 5 of the person node 4, and marking the person node 5 as visited (i.e. marked [5] ═ T), and marking the person node 5 as group 0 (i.e. id [5] ═ 0);
a sixth step of performing recursive access on the person node 3 adjacent to the person node 5, and marking the person node 3 as visited (i.e. marked [3] ═ T), and marking the person node 3 as group 0 (i.e. id [3] ═ 0);
seventhly, performing recursive access on the adjacent personnel nodes 5 and 4 of the personnel node 3, and finding that the personnel nodes 5 and 4 are all accessed and directly skipped over, so that the personnel node 3 is completed;
eighthly, after the personnel node 3 is finished, backtracking to the personnel node 5, and finding that other adjacent personnel nodes 0 and 4 of the personnel node 5 are visited, so that 5 is finished;
ninthly, after the personnel node 5 is finished, backtracking to the personnel node 4, and finding that other adjacent personnel nodes 3 and 6 of the personnel node 4 are visited, so that the personnel node 4 is finished;
step ten, after the personnel node 4 is finished, backtracking to the personnel node 6, and finding that all the adjacent personnel nodes of the personnel node 6 are completely accessed, so that the personnel node 6 is finished;
step eleven, after the person node 6 is completed, backtracking to the person node 0, finding that the adjacent person node 2 of the person node 0 has not been visited, recursively visiting the person node 2, marking the person node 2 as visited (i.e. marked [2] ═ T), and marking the person node 2 as a group 0 (i.e. id [2] ═ 0);
step twelfth, similarly, the person node 1 is marked as visited (i.e., marked [1] ═ T), and the person node 1 is marked as the group 0 (i.e., id [1] ═ 0), so far, all the person nodes of the group relation network 0 are found: 0, 1, 2, 3, 4, 5, 6;
and a thirteenth step of finding out all the personnel nodes of the group relation network 1 in the same way: 7, 8; and all personnel nodes of the swarm network 2: 9,10, 11, 12.
As shown in fig. 3, an embodiment of the present invention further provides a constructing apparatus for a swarm relationship network, where the constructing apparatus includes: an acquisition module 31, a determination module 32 and a construction module 33.
The acquiring module 31 is configured to acquire a staff relationship graph, where the staff relationship graph includes a plurality of staff nodes and connection relationships among the staff nodes;
a determining module 32, configured to determine, from the person relationship graph, a plurality of target person nodes having a connection relationship;
and a building module 33, configured to use the target person nodes and the connection relationships between the target person nodes as a group relationship network.
The determining module 32 specifically includes: a first determination unit, a second determination unit, and a third determination unit.
Specifically, the first determining unit is configured to use any one person node in the person relationship graph as a group search starting point, and mark the group search starting point;
a second determining unit, configured to determine, from among unlabeled person nodes in the person relationship graph, a person node directly or indirectly connected to the group search starting point;
and the third determining unit is used for taking the group search starting point and the person node directly or indirectly connected with the group search starting point as a plurality of target person nodes with connection relations.
The construction device also comprises a marking module which is used for marking the personnel nodes directly or indirectly connected with the group search starting points.
It should be noted that, in the embodiment of the present invention, the population relation network construction device 30 is a device corresponding to the above-described population relation network construction method, and can accurately extract the population information.
It should be noted that the device 30 for constructing a swarm relational network includes all modules or units for implementing the method for constructing a swarm relational network, and in order to avoid too many repetitions, the modules or units of the device 30 for constructing a swarm relational network are not described herein in detail.
As shown in fig. 4, an embodiment of the present invention further provides an apparatus for constructing a swarm relational network, which includes a memory 41, a processor 42, and a computer program 43 stored in the memory 41 and executable on the processor 42, where the processor 42 executes the computer program 43 to implement the steps of the method for constructing the swarm relational network.
Specifically, when the processor 42 of the group relation network constructing apparatus 40 executes the computer program 43, the following steps are implemented: acquiring a personnel relationship graph, wherein the personnel relationship graph comprises a plurality of personnel nodes and connection relations among the personnel nodes; determining a plurality of target personnel nodes with connection relations from the personnel relation graph; and taking the target person nodes and the connection relations among the target person nodes as a group relation network.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: taking any person node in the person relation graph as a group search starting point, and marking the group search starting point; determining personnel nodes directly or indirectly connected with the group search starting point from the unlabeled personnel nodes in the personnel relationship graph; and taking the group search starting point and the person node directly or indirectly connected with the group search starting point as a plurality of target person nodes with connection relations.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: and marking the personnel nodes directly or indirectly connected with the group search starting point.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: and repeatedly judging whether the personnel nodes which are not marked exist in the personnel relationship graph until all the personnel nodes in the personnel relationship graph are marked. When the personnel relation graph is judged to have the unlabeled personnel nodes, any one of the unlabeled personnel nodes is used as a group search starting point, the group search starting point is labeled, personnel nodes directly or indirectly connected with the group search starting point are determined from the unlabeled personnel nodes in the personnel relation graph, the personnel nodes directly or indirectly connected with the group search starting point are labeled, and the group search starting point and the personnel nodes directly or indirectly connected with the group search starting point are used as a plurality of target personnel nodes with connection relations.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: and determining the personnel nodes directly or indirectly connected with the group search starting point from the unlabeled personnel nodes in the personnel relationship graph through a depth-first search algorithm.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: and setting group identification information for the group relation network.
Optionally, when the processor 42 of the group relation network building apparatus 40 executes the computer program 43, the following steps are further implemented: marking the group search starting point as visited; and marking the personnel nodes directly or indirectly connected with the group search starting point as visited.
That is, in the embodiment of the present invention, when the processor 42 of the population relation network constructing apparatus 40 executes the computer program 43, the steps of the population relation network constructing method described above are realized, and the population information can be accurately mined.
Illustratively, the above-described computer program 43 may be partitioned into one or more modules/units, which are stored in the memory 41 and executed by the processor 42 to implement the present invention. And the one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the computer program 43 in the community relational network building apparatus 40.
The device 40 for constructing the swarm relationship network may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The population relationship network building apparatus 40 may include, but is not limited to, a processor 42 and a memory 41. Those skilled in the art will appreciate that the schematic diagram is merely an example of the apparatus 40 for constructing the swarm relationship network and does not constitute a limitation of the apparatus 40 for constructing the swarm relationship network, and may include more or less components than those shown, or combine some components, or different components, for example, the apparatus 40 for constructing the swarm relationship network may further include input and output devices, network access devices, buses, etc.
The Processor 42 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, and the processor 42 is the control center of the community network building apparatus 40, and various interfaces and lines are used to connect the various parts of the overall community network building apparatus 40.
The memory 41 may be used for storing the computer program 43 and/or the module, and the processor 42 may implement various functions of the apparatus for constructing a relationship network 40 by running or executing the computer program 43 and/or the module stored in the memory 41 and calling data stored in the memory 41. Specifically, the memory 41 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required by at least one function, and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. Further, the memory 41 may include a high speed random access memory, and may also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
It should be noted that, since the processor 42 of the population relationship network constructing apparatus 40 executes the computer program 43 to implement the steps of the population relationship network constructing method, all the embodiments of the population relationship network constructing method can be applied to the population relationship network constructing apparatus 40, and the same or similar beneficial effects can be achieved.
Furthermore, an embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program, and the computer program, when executed by a processor, implements the steps of the above-mentioned method for constructing a swarm relational network.
That is, in the embodiment of the present invention, when the computer program of the computer-readable storage medium is executed by the processor, the steps of the method for constructing the group relation network are realized, and the group information can be accurately mined.
Illustratively, the computer program of the computer-readable storage medium comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, and the like. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like.
It should be noted that, since the computer program of the computer-readable storage medium is executed by the processor to implement the steps of the method for constructing the swarm relational network, all the embodiments of the method for constructing the swarm relational network can be applied to the computer-readable storage medium, and can achieve the same or similar beneficial effects.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (10)
1. A method for constructing a group relation network is characterized by comprising the following steps:
acquiring a personnel relationship graph, wherein the personnel relationship graph comprises a plurality of personnel nodes and connection relations among the personnel nodes;
determining a plurality of target personnel nodes with connection relations from the personnel relation graph;
and taking the target person nodes and the connection relations among the target person nodes as a group relation network.
2. The building method according to claim 1, wherein the step of determining a plurality of target person nodes having connection relationships from the person relationship graph comprises:
taking any person node in the person relation graph as a group search starting point, and marking the group search starting point;
determining personnel nodes directly or indirectly connected with the group search starting point from the unlabeled personnel nodes in the personnel relationship graph;
and taking the group search starting point and the person node directly or indirectly connected with the group search starting point as a plurality of target person nodes with connection relations.
3. The construction method according to claim 2, wherein after the step of determining a person node directly or indirectly connected to the group search starting point from the person nodes that are not labeled in the person relationship graph, the construction method further comprises:
and marking the personnel nodes directly or indirectly connected with the group search starting point.
4. The building method according to claim 3, wherein after the step of regarding the group search starting point and the person node directly or indirectly connected to the group search starting point as the plurality of target person nodes having a connection relationship, the building method further comprises:
repeatedly judging whether the personnel relation graph has the personnel nodes which are not marked or not until all the personnel nodes in the personnel relation graph are marked;
when the personnel relation graph is judged to have the unlabeled personnel nodes, any one of the unlabeled personnel nodes is used as a group search starting point, the group search starting point is labeled, personnel nodes directly or indirectly connected with the group search starting point are determined from the unlabeled personnel nodes in the personnel relation graph, the personnel nodes directly or indirectly connected with the group search starting point are labeled, and the group search starting point and the personnel nodes directly or indirectly connected with the group search starting point are used as a plurality of target personnel nodes with connection relations.
5. The construction method according to claim 2, wherein the step of determining the person node directly or indirectly connected to the group search starting point from the person nodes not labeled in the person relationship graph comprises:
and determining the personnel nodes directly or indirectly connected with the group search starting point from the unlabeled personnel nodes in the personnel relationship graph through a depth-first search algorithm.
6. An apparatus for constructing a swarm network, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a personnel relation map, and the personnel relation map comprises a plurality of personnel nodes and connection relations among the personnel nodes;
the determining module is used for determining a plurality of target personnel nodes with connection relations from the personnel relation graph;
and the construction module is used for taking the target personnel nodes and the connection relations among the target personnel nodes as a group relation network.
7. The building apparatus according to claim 6, wherein the determining module comprises:
the first determining unit is used for taking any person node in the person relationship graph as a group search starting point and marking the group search starting point;
a second determining unit, configured to determine, from among unlabeled person nodes in the person relationship graph, a person node directly or indirectly connected to the group search starting point;
and the third determining unit is used for taking the group search starting point and the person node directly or indirectly connected with the group search starting point as a plurality of target person nodes with connection relations.
8. The build device of claim 7, further comprising:
and the marking module is used for marking the personnel nodes directly or indirectly connected with the group search starting point.
9. An apparatus for constructing a swarm relational network, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method for constructing a swarm relational network according to any one of claims 1 to 5 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements the steps of the method for constructing a swarm relationship network according to any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911142229.8A CN112825083A (en) | 2019-11-20 | 2019-11-20 | Method, device and equipment for constructing group relation network and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911142229.8A CN112825083A (en) | 2019-11-20 | 2019-11-20 | Method, device and equipment for constructing group relation network and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112825083A true CN112825083A (en) | 2021-05-21 |
Family
ID=75906935
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911142229.8A Pending CN112825083A (en) | 2019-11-20 | 2019-11-20 | Method, device and equipment for constructing group relation network and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112825083A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060034194A1 (en) * | 2004-08-11 | 2006-02-16 | Kahan Simon H | Identifying connected components of a graph in parallel |
| CN105245924A (en) * | 2015-09-28 | 2016-01-13 | 北京奇艺世纪科技有限公司 | Video information push and display method and video player using the method |
| CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
| CN105786957A (en) * | 2016-01-08 | 2016-07-20 | 云南大学 | Table sorting method based on cell adjacency relation and depth-first traversal |
| CN106062794A (en) * | 2014-02-28 | 2016-10-26 | 微软技术许可有限责任公司 | Displaying and navigating implicit and explicit enterprise people relationships |
| CN106897273A (en) * | 2017-04-12 | 2017-06-27 | 福州大学 | A kind of network security dynamic early-warning method of knowledge based collection of illustrative plates |
| CN109558518A (en) * | 2018-10-30 | 2019-04-02 | 深圳先进技术研究院 | The method, apparatus and storage medium of community discovery in a kind of determining social networks |
| WO2019091101A1 (en) * | 2017-11-07 | 2019-05-16 | 平安科技（深圳）有限公司 | Salary calculation method, application server and computer-readable storage medium |
| CN109783531A (en) * | 2018-12-07 | 2019-05-21 | 北京明略软件系统有限公司 | A kind of relationship discovery method and apparatus, computer readable storage medium |
| CN109829072A (en) * | 2018-12-26 | 2019-05-31 | 深圳云天励飞技术有限公司 | Construct atlas calculation and relevant apparatus |
-
2019
- 2019-11-20 CN CN201911142229.8A patent/CN112825083A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060034194A1 (en) * | 2004-08-11 | 2006-02-16 | Kahan Simon H | Identifying connected components of a graph in parallel |
| CN106062794A (en) * | 2014-02-28 | 2016-10-26 | 微软技术许可有限责任公司 | Displaying and navigating implicit and explicit enterprise people relationships |
| CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
| CN105245924A (en) * | 2015-09-28 | 2016-01-13 | 北京奇艺世纪科技有限公司 | Video information push and display method and video player using the method |
| CN105786957A (en) * | 2016-01-08 | 2016-07-20 | 云南大学 | Table sorting method based on cell adjacency relation and depth-first traversal |
| CN106897273A (en) * | 2017-04-12 | 2017-06-27 | 福州大学 | A kind of network security dynamic early-warning method of knowledge based collection of illustrative plates |
| WO2019091101A1 (en) * | 2017-11-07 | 2019-05-16 | 平安科技（深圳）有限公司 | Salary calculation method, application server and computer-readable storage medium |
| CN109558518A (en) * | 2018-10-30 | 2019-04-02 | 深圳先进技术研究院 | The method, apparatus and storage medium of community discovery in a kind of determining social networks |
| CN109783531A (en) * | 2018-12-07 | 2019-05-21 | 北京明略软件系统有限公司 | A kind of relationship discovery method and apparatus, computer readable storage medium |
| CN109829072A (en) * | 2018-12-26 | 2019-05-31 | 深圳云天励飞技术有限公司 | Construct atlas calculation and relevant apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9710488B2 (en) | Location estimation using image analysis | |
| US20220101644A1 (en) | Pedestrian re-identification method, device, electronic device and computer-readable storage medium | |
| CN110019876B (en) | Data query method, electronic device and storage medium | |
| WO2018171412A1 (en) | Pedestrian search method and apparatus | |
| CN108563651B (en) | Multi-video target searching method, device and equipment | |
| US20130343618A1 (en) | Searching for Events by Attendants | |
| CN111460232A (en) | Functional module searching method, device, terminal and computer readable storage medium | |
| CN108090982A (en) | One kind is registered method, system and terminal device | |
| CN113900955A (en) | Automatic testing method, device, equipment and storage medium | |
| CN110705480B (en) | Target object stop point positioning method and related device | |
| CN111382189A (en) | Heterogeneous data collision analysis method, terminal device and storage medium | |
| CN110058995B (en) | Database testing method and system capable of avoiding interference of database types | |
| CN116502700A (en) | Skin detection model training method, skin detection device and electronic equipment | |
| CN111143626A (en) | Group partner identification method, device, equipment and computer readable storage medium | |
| CN112825083A (en) | Method, device and equipment for constructing group relation network and readable storage medium | |
| CN111241103B (en) | Data storage method, data query method and related device | |
| CN115082999A (en) | Group photo image person analysis method and device, computer equipment and storage medium | |
| CN114936269A (en) | Document searching platform, searching method, device, electronic equipment and storage medium | |
| CN107967300B (en) | Method, device and equipment for retrieving organization name and storage medium | |
| CN112766501A (en) | Incremental training method and related product | |
| CN113128278A (en) | Image identification method and device | |
| CN111444253A (en) | Data import method and device, computer readable storage medium and computer equipment | |
| CN111522570A (en) | Target library updating method and device, electronic equipment and machine-readable storage medium | |
| CN108614822B (en) | Intelligent event storage and reading method and device | |
| CN111367897B (en) | Data processing method, device, equipment and storage medium |
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 |