CN111767321B - Method and device for determining node relation network, electronic equipment and storage medium - Google Patents
Method and device for determining node relation network, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111767321B CN111767321B CN202010610535.6A CN202010610535A CN111767321B CN 111767321 B CN111767321 B CN 111767321B CN 202010610535 A CN202010610535 A CN 202010610535A CN 111767321 B CN111767321 B CN 111767321B
- Authority
- CN
- China
- Prior art keywords
- communication
- node
- nodes
- tree
- root
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004891 communication Methods 0.000 claims abstract description 208
- 230000015654 memory Effects 0.000 claims description 21
- 230000008569 process Effects 0.000 claims description 8
- 238000010276 construction Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 abstract description 5
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000004458 analytical method Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 12
- 238000003672 processing method Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 210000000056 organ Anatomy 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2465—Query processing support for facilitating data mining operations in structured databases
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The application discloses a method, a device, electronic equipment and a storage medium for determining a node relation network, and relates to big data processing technology and cloud computing technology. The method for determining the node relation network comprises the following steps: acquiring a plurality of communication records, wherein each communication record comprises a communication relationship between two communication nodes; forming at least one first search tree by communication nodes related to the plurality of communication records according to the plurality of communication records; a relationship network of communication nodes to which the plurality of communication records relates is determined from the at least one first lookup tree. By adopting the method, the relationship network between the communication nodes can be determined by using simple and limited information, the time complexity is low, and the analysis efficiency is improved.
Description
Technical Field
The application relates to the field of artificial intelligence, in particular to big data processing technology and cloud computing technology.
Background
In some application areas, it is desirable to determine a relationship network between a plurality of communication nodes. For example, in the public safety field, in order to mine a criminal relationship network, a criminal relationship network is sometimes determined using a communication record of a criminal. Some criminals intentionally use simple communication methods (e.g., making a call using a 2G communication network, sending encrypted messages, etc.), avoiding the use of an intelligent network; or the communication records are distributed among a plurality of Applications (APP) in the form of data islands, which all pose an obstacle to determining the relationship network of the communication nodes.
Disclosure of Invention
The application provides a method, a device, electronic equipment and a storage medium for determining a node relation network.
According to a first aspect of the present invention, this embodiment provides a method for determining a node relation network, including:
acquiring a plurality of communication records, wherein each communication record comprises a communication relationship between two communication nodes;
forming at least one first search tree by communication nodes related to the plurality of communication records according to the plurality of communication records;
a relationship network of communication nodes to which the plurality of communication records relates is determined from the at least one first lookup tree.
According to a second aspect of the present invention, the present embodiment provides a determining apparatus for a node relation network, including:
the acquisition module is used for acquiring a plurality of communication records, wherein each communication record comprises a communication relationship between two communication nodes;
the construction module is used for constructing at least one first search tree by the communication nodes related to the plurality of communication records according to the plurality of communication records;
and the determining module is used for determining a relation network of the communication nodes related to the plurality of communication records according to at least one first search tree.
According to a third aspect of the present invention, there is also provided an electronic device, including: at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of the embodiments described above.
According to a fourth aspect of the present invention, there is also provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any of the above embodiments.
According to a fifth aspect of the invention, the present embodiment also provides a computer program product comprising a computer program which, when executed by a processor, implements a method as described above.
According to the technical scheme, a plurality of communication records are utilized, communication nodes related to the communication records form at least one search tree, and a relation network of the communication nodes is determined according to the search tree. By adopting the method, the relationship network between the communication nodes can be determined by using simple and limited information, the time complexity is low, and the analysis efficiency is improved.
It should be understood that the description of this section is not intended to identify key or critical features of the embodiments of the application or to delineate the scope of the application. Other features of the present application will become apparent from the description that follows.
Drawings
The drawings are for better understanding of the present solution and do not constitute a limitation of the present application. Wherein:
fig. 1 is a flowchart of a method for determining a node relation network according to an embodiment of the present application;
FIG. 2 is a second flowchart of a method for determining a node relationship network according to an embodiment of the present application;
fig. 3 is a schematic diagram of one implementation manner of step S102 in the method for determining a node relation network according to the embodiment of the present application;
fig. 4 is a schematic diagram of one implementation manner of step S302 in the method for determining a node relation network according to the embodiment of the present application;
FIG. 5 is a schematic diagram of an implementation flow for constructing a lookup tree according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a determining device of a node relation network according to an embodiment of the present application;
fig. 7 is a schematic diagram of a determining device of a node relationship network according to an embodiment of the present application;
fig. 8 is a schematic diagram of a determining device structure of a node relation network according to an embodiment of the present application;
fig. 9 is a block diagram of an electronic device for implementing a network data processing method of an embodiment of the present application.
Detailed Description
Exemplary embodiments of the present application are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present application to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
An embodiment of the present application proposes a method for determining a node relationship network, and fig. 1 is a flowchart for implementing the method for determining a node relationship network according to the embodiment of the present application, including:
step S101: acquiring a plurality of communication records, each communication record comprising a communication relationship between two communication nodes;
step S102: forming at least one first search tree by communication nodes related to the plurality of communication records according to the plurality of communication records;
step S103: and determining a relation network of the communication nodes related to the plurality of communication records according to the at least one first search tree.
The communication relationship may include telephone communication, short message communication, mail communication, etc. between two communication nodes. If a communication involves a plurality of communication nodes, then there is a communication relationship as used in the embodiments of the present application between any two of the plurality of communication nodes.
Fig. 2 is a flowchart second implemented by a method for determining a node relation network according to an embodiment of the present application, as shown in fig. 2, before the step S102, further includes:
s201: and de-duplicating the communication nodes related to the plurality of communication records, and setting a unique identifier for each communication node after de-duplication.
For example, if the same person communicates using a plurality of telephone numbers, a unique identifier may be set for the several telephone numbers appearing in the communication record, and the several telephone numbers may be regarded as the same communication node. The relationship network of the communication nodes can be more clearly and rapidly determined by adopting a deduplication mode.
Fig. 3 is a schematic diagram of an implementation manner of step S102 in the method for determining a node relation network according to the embodiment of the present application. As shown in fig. 3, in some embodiments, the step S102 includes:
step S301: determining a plurality of second lookup trees, each second lookup tree comprising one of the communication nodes to which the plurality of communication records relate;
step S302: traversing the plurality of communication records, performing the following for each communication record: determining root nodes of a second search tree to which two communication nodes related to the communication record belong; when the two determined root nodes are different, taking one of the root nodes as a child node of the other root node; after the traversal process is completed, the at least one first lookup tree is obtained.
Alternatively, the above-mentioned search tree is represented by a tree diagram (simply referred to as tree) in a data structure. The first search tree may include a search tree finally constructed after the traversing of the step S302 is completed. The second lookup tree may be considered as an initialization state and an intermediate build state of the first lookup tree. For example, the second search tree determined in the above step S301 is an initialized state of the first search tree; in the process of traversing the communication record in step S302, the second search tree is changed. And after the traversing is completed, the second search tree is not changed any more, and at least one first search tree which is successfully built finally is obtained.
According to the characteristics of the tree, in step S301, each second search tree includes a communication node, that is, the second search tree is a tree having only a root node, and the communication node is the root node of the second search tree to which the communication node belongs.
Also, according to the characteristics of the tree, since one tree has only one root node, in the above step S302, if the root nodes of the second lookup trees to which the two communication nodes belong are different, it is indicated that the two communication nodes belong to two different second lookup trees.
Further, in the step S302, after one of the root nodes is used as the child node of the other root node, a new search tree is formed. For example, if the root node A of the lookup tree 1 is taken as a child node of the root node B of the lookup tree 2, the root node of the new lookup tree formed is node B and the original lookup tree 1 becomes a branch in the new lookup tree. This way of merging the whole tree can increase the speed of building the lookup tree.
In some embodiments, determining which second lookup tree root node is to be used as the new second lookup tree root node according to the heights (or depths) of the two second lookup trees, as shown in fig. 4, the step S302 of using one root node as a child node of the other root node includes:
step S401: respectively determining the heights of the second search trees to which the two root nodes belong;
step S402: and taking the first root node as a child node of the second root node, wherein the height of the second search tree to which the first root node belongs is smaller than that of the second search tree to which the second root node belongs.
In step S401, the second lookup tree to which the two root nodes belong, that is, the second lookup tree to which the two communication nodes belong. By using the method shown in fig. 4, the height of the new second search tree can be made as small as possible, and finally, the height of the first search tree formed by the communication nodes related to the plurality of communication records is ensured to be as small as possible; such a lookup tree may be referred to as a weighted lookup tree. In the manner of fig. 4, the overall algorithm has a computation complexity of lg 2 N, i.e., the logarithm of the base N of 2, where N is the number of communication nodes.
The process of building the lookup tree shown in fig. 3 and 4 described above is described in detail below with respect to a specific embodiment. As shown in fig. 5, fig. 5 is a schematic flow chart of an implementation of constructing a lookup tree according to an embodiment of the present application. In the following embodiments, the first lookup tree and the second lookup tree are not distinguished in terms of names, collectively referred to as lookup trees.
Referring to fig. 5, the process of constructing a lookup tree includes the steps of:
step one, removing the duplication of all the communication nodes related to the communication record, and setting a unique identifier for the communication node after the duplication removal; if the duplicate is removed, the communication node comprises 10 communication nodes, and the identifiers of the communication nodes are sequentially 0 to 9.
And step two, determining each communication node as a search tree. The first column on the right in fig. 5 shows 10 search trees, each including a node (i.e., root node) which is a corresponding communication node, i.e., communication nodes with identifiers of 0 to 9, respectively.
Step three, in fig. 5, p and q denote 2 communication nodes involved in the communication record. For the first communication record (4, 3), the root node of the search tree to which the communication node 4 and the communication node 3 belong is searched. As shown in fig. 5, at this time, the communication node 4 and the communication node 3 belong to two different search trees, and the communication node 4 and the communication node 3 are root nodes of the search trees to which each belongs, respectively, and therefore the communication node 4 and the communication node 3 are different in root nodes of the search trees to which each belongs. One of the root nodes (i.e., communication node 3) is considered a child of the other root node (i.e., communication node 4). Since the height of the search tree to which the communication node 3 and the communication node 4 belong is equal (both are 1), both the communication node 3 and the communication node 4 can serve as the root node of the new search tree.
Step four: for the second communication record (3, 8), the root node of the search tree to which the communication node 3 and the communication node 8 belong is searched. As shown in fig. 5, at this time, the root node of the lookup tree to which the communication node 3 belongs is the communication node 4, and the root node of the lookup tree to which the communication node 8 belongs is itself, that is, the two nodes are different; also, the height (equal to 1) of the lookup tree to which the communication node 8 belongs is smaller than the height (equal to 2) of the lookup tree to which the communication node 3 belongs, and therefore the root node of the lookup tree to which the communication node 8 belongs (i.e., the communication node 8) is regarded as a child node of the root node of the lookup tree to which the communication node 3 belongs (i.e., the communication node 4).
In the same way, when the communication relation in one communication record is already embodied in the current search tree, the search tree is not updated for the communication record. As with the communication record (8, 9) in fig. 5, the communication node 8 and the communication node 9 belong to the same lookup tree when traversing to the communication record, i.e. the root node of the lookup tree to which the communication node 8 belongs is the same as the root node of the lookup tree to which the communication node 9 belongs, so that no update is made to the current lookup tree.
Until all the communication records have been traversed, as shown in fig. 5, two search trees are finally determined. From these two lookup trees two relationship networks can be determined, one of which comprises communication node 4, communication node 3, communication node 8 and communication node 9, and the other of which comprises communication node 6, communication node 0, communication node 2, communication node 5, communication node 1 and communication node 7.
In addition, in practical application, the relation among the nodes in the search tree can be expressed in the form of an array. For example, using id [ X ] =y, the parent node of the communication node X is denoted as communication node Y. In this way, the two lookup trees finally determined in FIG. 5 are represented by arrays:
the first search tree: id [3] =4; id [8] =4; id [9] =4.
A second search tree: id [0] =6; id [1] =2; id [2] =6; id [5] =6; id [7] =2.
In summary, in the embodiment of the present application, a search tree formed by communication nodes related to a communication record may be determined by using the communication record, and a relationship network of the communication nodes may be determined according to the search tree. The embodiment of the application can be applied to the public security field, and the criminal relationship network is mined based on the operator data of the relevant area coordinated by the public security organs. The relation network can be mined by only adopting the recorded data such as the 2G call of the operator, the short message and the like, so that the related coordination with internet manufacturers is avoided, and the operation of public security authorities is facilitated; moreover, the embarrassment that criminals cannot obtain abundant data in a large amount because the criminals do not use intelligent APP is avoided; the time complexity of operation is reduced, and the efficiency of analyzing the relation of the diggers and dividing the group is greatly improved. The scheme provided by the embodiment of the application can play a higher value in the security fields such as public security.
The present application further provides a device for determining a node relationship network, and fig. 6 is a schematic structural diagram of a device for determining a node relationship network according to a first embodiment of the present application, including:
an obtaining module 610, configured to obtain a plurality of communication records, each communication record including a communication relationship between two communication nodes;
a construction module 620, configured to construct, according to the plurality of communication records, at least one first search tree from communication nodes related to the plurality of communication records;
a determining module 630 is configured to determine a relationship network of communication nodes involved in the plurality of communication records according to the at least one first lookup tree.
Fig. 7 is a second schematic structural diagram of a determining apparatus of a node relation network according to an embodiment of the present application, where the apparatus includes an obtaining module 610, a constructing module 620, a determining module 630, and a deduplication module 710;
wherein the obtaining module 610, the constructing module 620 and the determining module 630 have the same functions as the corresponding modules in the embodiment shown in fig. 6;
the deduplication module 710 is configured to deduplicate communication nodes involved in the plurality of communication records, and set a unique identifier for each communication node after deduplication.
As shown in fig. 8, in some other embodiments, the build module 620 includes:
an initialization submodule 810 for determining a plurality of second lookup trees, each of the second lookup trees comprising one of the communication nodes to which the plurality of communication records relates;
a traversal submodule 820 for traversing the plurality of communication records, for each communication record: determining root nodes of a second search tree to which two communication nodes related to the communication record belong; when the two determined root nodes are different, taking one of the root nodes as a child node of the other root node; and is further configured to obtain at least one first lookup tree after completion of the traversal process.
The traversal sub-module 820 is configured to determine heights of the second lookup trees to which the two root nodes belong, respectively; and taking the first root node as a child node of the second root node, wherein the height of the second search tree to which the first root node belongs is smaller than that of the second search tree to which the second root node belongs.
According to embodiments of the present application, there is also provided an electronic device, a readable storage medium and a computer program product.
As shown in fig. 9, a block diagram of an electronic device according to a network data processing method according to an embodiment of the present application is shown. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the application described and/or claimed herein.
As shown in fig. 9, the electronic device includes: one or more processors 901, memory 902, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor 901 may process instructions executing within an electronic device, including instructions stored in the memory 902 or on the memory 902 to display graphical information of a GUI on an external input/output device 904 (such as a display device coupled to an interface). In other embodiments, multiple processors 901 and/or multiple buses may be used, if desired, along with multiple memories 902 and multiple memories 902. Also, multiple electronic devices may be connected, each providing a portion of the necessary operations (e.g., as a server array, a set of blade servers, or a multiprocessor 901 system). In fig. 9, a processor 901 is taken as an example.
Memory 902 is a non-transitory computer-readable storage medium provided herein. The memory 902 stores instructions executable by the at least one processor 901 to cause the at least one processor 901 to perform the network data processing methods provided herein. The non-transitory computer readable storage medium of the present application stores computer instructions for causing a computer to perform the network data processing method provided by the present application.
The memory 902 is used as a non-transitory computer readable storage medium and is used to store non-transitory software programs, non-transitory computer-executable programs, and modules, such as program instructions/modules (e.g., the acquisition module 610, the first determination module 620, and the second determination module 630 shown in fig. 6 and 7) corresponding to the network data processing method in the embodiments of the present application. The processor 901 executes various functional applications of the server and data processing, i.e., implements the network data processing method in the above-described method embodiment, by running non-transitory software programs, instructions, and modules stored in the memory 902.
The memory 902 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for a function; the storage data area may store data created according to the use of the electronic device of the network data processing method, and the like. In addition, the memory 902 may include high-speed random access memory 902 and may also include non-transitory memory 902, such as at least one magnetic disk storage device 902, flash memory device, or other non-transitory solid-state storage device 902. In some embodiments, the memory 902 optionally includes memory 902 remotely located relative to the processor 901, the remote memory 902 being connectable to the electronic device of the network data processing method through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device of the network data processing method may further include: an input device 903 and an output device 904. The processing, memory 902, input devices 903, and output devices 904 may be connected by a bus or other means, for example in fig. 9.
The input device 903 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic device of the network data processing method, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointer stick, one or more mouse buttons, a track ball, a joystick, etc. input device 903. The output means 904 may include a display device, auxiliary lighting means (e.g., LEDs), tactile feedback means (e.g., vibration motors), and the like. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device may be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASIC (application specific integrated circuit), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor 901, which may be a special purpose or general-purpose programmable processor 901, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device 903, and at least one output device 904.
These computing programs (also referred to as programs, software applications, or code) include machine instructions for the programmable processor 901, and may be implemented in a high-level procedural and/or object-oriented programming language, and/or in assembly/machine language. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory 902, programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to programmable processor 901, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to the programmable processor 901.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present application may be performed in parallel, sequentially, or in a different order, provided that the desired results of the technical solutions disclosed in the present application can be achieved, and are not limited herein.
The above embodiments do not limit the scope of the application. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present application are intended to be included within the scope of the present application.
Claims (8)
1. A method of determining a node relationship network, comprising:
acquiring a plurality of communication records, wherein each communication record comprises a communication relationship between two communication nodes;
forming at least one first search tree by the communication nodes related to the plurality of communication records according to the plurality of communication records;
determining a relationship network of communication nodes involved in the plurality of communication records according to the at least one first search tree;
wherein the forming at least one first lookup tree by the communication nodes involved in the plurality of communication records includes:
determining a plurality of second search trees, wherein each second search tree comprises one communication node in communication nodes related to the plurality of communication records, and the second search tree is an initialization state and an intermediate construction state of the first search tree;
traversing the plurality of communication records, for each communication record performing the following: determining root nodes of a second search tree to which two communication nodes related to the communication record belong; when the two determined root nodes are different, taking one of the root nodes as a child node of the other root node;
and after the traversal process is completed, obtaining the at least one first search tree.
2. The method of claim 1, wherein the taking one of the root nodes as a child of the other root node comprises:
respectively determining the heights of the second search trees to which the two root nodes belong;
and taking the first root node as a child node of the second root node, wherein the height of the second search tree to which the first root node belongs is smaller than that of the second search tree to which the second root node belongs.
3. The method according to claim 1 or 2, before the forming, according to the plurality of communication records, the communication nodes involved in the plurality of communication records into at least one first search tree, further comprising:
and de-duplicating the communication nodes related to the plurality of communication records, and setting a unique identifier for each communication node after de-duplication.
4. A node relationship network determining apparatus, comprising:
the system comprises an acquisition module, a storage module and a communication module, wherein the acquisition module is used for acquiring a plurality of communication records, and each communication record comprises a communication relationship between two communication nodes;
the construction module is used for constructing at least one first search tree by the communication nodes related to the plurality of communication records according to the plurality of communication records;
a determining module, configured to determine a relationship network of communication nodes related to the plurality of communication records according to the at least one first lookup tree;
wherein, the construction module includes:
an initialization sub-module, configured to determine a plurality of second lookup trees, where each second lookup tree includes one of the communication nodes involved in the plurality of communication records, and the second lookup tree is an initialization state and an intermediate construction state of the first lookup tree;
a traversing submodule, configured to traverse the plurality of communication records, and for each communication record, perform the following operations: determining root nodes of a second search tree to which two communication nodes related to the communication record belong; when the two determined root nodes are different, taking one of the root nodes as a child node of the other root node; and further for obtaining the at least one first lookup tree after completion of the traversal process.
5. The apparatus of claim 4, wherein the traversal submodule is configured to determine heights of the second lookup trees to which the two root nodes belong, respectively; and taking the first root node as a child node of the second root node, wherein the height of the second search tree to which the first root node belongs is smaller than that of the second search tree to which the second root node belongs.
6. The apparatus of claim 4 or 5, further comprising:
and the de-duplication module is used for de-duplicating the communication nodes related to the plurality of communication records, and setting a unique identifier for each communication node after de-duplication.
7. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 3.
8. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010610535.6A CN111767321B (en) | 2020-06-30 | 2020-06-30 | Method and device for determining node relation network, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010610535.6A CN111767321B (en) | 2020-06-30 | 2020-06-30 | Method and device for determining node relation network, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111767321A CN111767321A (en) | 2020-10-13 |
| CN111767321B true CN111767321B (en) | 2024-02-09 |
Family
ID=72724134
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010610535.6A Active CN111767321B (en) | 2020-06-30 | 2020-06-30 | Method and device for determining node relation network, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111767321B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112270412B (en) * | 2020-10-15 | 2023-10-27 | 北京百度网讯科技有限公司 | Network operator processing method and device, electronic equipment and storage medium |
| CN113517997B (en) * | 2021-03-31 | 2024-03-15 | 邦彦技术股份有限公司 | Network state query method and device based on fragmentation and storage medium |
| CN113704256B (en) * | 2021-08-05 | 2023-05-23 | 北京百度网讯科技有限公司 | Data identification method, device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617199A (en) * | 2013-11-13 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Data operating method and data operating system |
| CN105095237A (en) * | 2014-04-30 | 2015-11-25 | 国际商业机器公司 | Method and device used for generating schema of not-only-structured-query-language database |
| CN108874393A (en) * | 2018-06-06 | 2018-11-23 | 腾讯科技（深圳）有限公司 | rendering method, device, storage medium and computer equipment |
| CN110457600A (en) * | 2019-08-15 | 2019-11-15 | 腾讯科技（深圳）有限公司 | Search method, apparatus, storage medium and the computer equipment of target group |
| CN111182522A (en) * | 2019-11-28 | 2020-05-19 | 北京明略软件系统有限公司 | Group partner determining method, device, electronic equipment and computer storage medium |
| CN111274274A (en) * | 2020-02-06 | 2020-06-12 | 北京百度网讯科技有限公司 | Rule matching method and device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150324481A1 (en) * | 2014-05-06 | 2015-11-12 | International Business Machines Corporation | Building Entity Relationship Networks from n-ary Relative Neighborhood Trees |
-
2020
- 2020-06-30 CN CN202010610535.6A patent/CN111767321B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103617199A (en) * | 2013-11-13 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Data operating method and data operating system |
| CN105095237A (en) * | 2014-04-30 | 2015-11-25 | 国际商业机器公司 | Method and device used for generating schema of not-only-structured-query-language database |
| CN108874393A (en) * | 2018-06-06 | 2018-11-23 | 腾讯科技（深圳）有限公司 | rendering method, device, storage medium and computer equipment |
| CN110457600A (en) * | 2019-08-15 | 2019-11-15 | 腾讯科技（深圳）有限公司 | Search method, apparatus, storage medium and the computer equipment of target group |
| CN111182522A (en) * | 2019-11-28 | 2020-05-19 | 北京明略软件系统有限公司 | Group partner determining method, device, electronic equipment and computer storage medium |
| CN111274274A (en) * | 2020-02-06 | 2020-06-12 | 北京百度网讯科技有限公司 | Rule matching method and device, electronic equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 二叉树在多种通信组网下的应用;余新胜;戎之玮;;计算机工程(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111767321A (en) | 2020-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111767321B (en) | Method and device for determining node relation network, electronic equipment and storage medium | |
| US20210319329A1 (en) | Method and apparatus for generating knowledge graph, method for relation mining | |
| EP3869403A2 (en) | Image recognition method, apparatus, electronic device, storage medium and program product | |
| CN111241108B (en) | Key value based indexing method and device for KV system, electronic equipment and medium | |
| CN112115313B (en) | Regular expression generation and data extraction methods, devices, equipment and media | |
| CN111158666B (en) | Entity normalization processing method, device, equipment and storage medium | |
| CN111966633A (en) | Method, device, electronic equipment and medium for inquiring child nodes under directory | |
| CN111339191B (en) | Data storage method, device, equipment and medium of block chain | |
| CN111291082B (en) | Data aggregation processing method, device, equipment and storage medium | |
| CN111966925B (en) | Building interest point weight judging method and device, electronic equipment and storage medium | |
| CN112016524B (en) | Model training method, face recognition device, equipment and medium | |
| CN111680599B (en) | Face recognition model processing method, device, equipment and storage medium | |
| CN111290714B (en) | Data reading method and device | |
| CN111783951A (en) | Model obtaining method, device, equipment and storage medium based on hyper network | |
| CN112328658A (en) | User profile data processing method, device, equipment and storage medium | |
| CN115168291A (en) | Hierarchical directory implementation method and device, electronic equipment and storage medium | |
| CN112598139B (en) | Category encoding method, category encoding device, category encoding apparatus, category encoding device, category encoding storage medium, and category encoding program product | |
| CN111539225B (en) | Searching method and device for semantic understanding framework structure | |
| CN111488972B (en) | Data migration method, device, electronic equipment and storage medium | |
| CN111649753B (en) | Road network data processing method and device, electronic equipment and computer storage medium | |
| CN111639116B (en) | Data access connection session protection method and device | |
| CN112328807A (en) | Anti-cheating method, device, equipment and storage medium | |
| CN111881301A (en) | Data processing method and device, electronic equipment and storage medium | |
| JP7161563B2 (en) | NETWORK DATA PROCESSING METHOD, NETWORK DATA PROCESSING DEVICE, ELECTRONIC DEVICE, STORAGE MEDIUM, AND PROGRAM | |
| CN112381090A (en) | Method and device for determining telephone, electronic 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |