CN110781314A - User relation graph layered display method and device and electronic equipment - Google Patents
User relation graph layered display method and device and electronic equipment Download PDFInfo
- Publication number
- CN110781314A CN110781314A CN201910939039.2A CN201910939039A CN110781314A CN 110781314 A CN110781314 A CN 110781314A CN 201910939039 A CN201910939039 A CN 201910939039A CN 110781314 A CN110781314 A CN 110781314A
- Authority
- CN
- China
- Prior art keywords
- user relationship
- user
- graph
- display
- subgraphs
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000004422 calculation algorithm Methods 0.000 claims description 35
- 238000012216 screening Methods 0.000 claims description 20
- 238000003860 storage Methods 0.000 claims description 16
- 101100134058 Caenorhabditis elegans nth-1 gene Proteins 0.000 claims description 6
- 238000001914 filtration Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 3
- 238000004458 analytical method Methods 0.000 abstract description 7
- 238000006243 chemical reaction Methods 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 35
- 238000005516 engineering process Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000000638 solvent extraction Methods 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 3
- 238000007405 data analysis Methods 0.000 description 2
- 238000013079 data visualisation Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000009877 rendering Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000001680 brushing effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 210000000887 face Anatomy 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000005111 flow chemistry technique Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000002194 synthesizing effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000012800 visualization 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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- User Interface Of Digital Computer (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The disclosure relates to a hierarchical display method and device of a user relationship graph, electronic equipment and a computer readable medium. The method comprises the following steps: generating a user relationship graph according to the plurality of user relationship data; determining at least one display policy; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to the at least one display strategy; and displaying the user relationship graph in a layering mode according to the user relationship subgraphs and the corresponding hierarchical labels. The user relationship graph layered display method, the user relationship graph layered display device, the electronic equipment and the computer readable medium can display the user relationship graph in a layered mode according to the display strategy required by a data analyzer, and are beneficial to improving the analysis efficiency of the user relationship graph and improving the achievement conversion speed of the user relationship graph.
Description
Technical Field
The present disclosure relates to the field of computer information processing, and in particular, to a method and an apparatus for hierarchical display of a user relationship graph, an electronic device, and a computer-readable medium.
Background
The user relation graph is one of the associated graphs, the users are nodes of the graphs in the user relation graph, the relationships between the users form edges in the graphs, and the user relation graph establishes a relation network graph based on a graph database and is a visual intelligent analysis product. The user entities may include: IP address, longitude and latitude, device fingerprint, account, contact, overdue blacklist and other related information, and the relationship comprises: affiliations, emergency contacts, intercommunicating telephones, the same network, etc.; the entire entity and relationship construct a graph system of user relationships. Through data extraction and conversion, the graph calculation engine inquires and analyzes data, second-level data operation and data visualization are achieved, and the second-level data operation and the data visualization are displayed to a graph analysis tool of a user in a graph mode. The data analyst can query, analyze and explore based on the established user relationship graph.
In order to analyze the relationship between users more comprehensively, the existing user map construction algorithms are user relationship graphs established based on mass data, the number of nodes in the user relationship graphs can reach hundreds of millions, and in the face of so much user data, a data analyst is difficult to analyze and explore the established user relationship graphs through naked eyes.
Therefore, a new method, an apparatus, an electronic device and a computer-readable medium for hierarchical display of a user relationship diagram are needed.
The above information disclosed in this background section is only for enhancement of understanding of the background of the disclosure and therefore it may contain information that does not constitute prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
In view of this, the present disclosure provides a hierarchical display method, an apparatus, an electronic device, and a computer readable medium for a user relationship diagram, which can display the user relationship diagram hierarchically according to a display policy required by a data analyst, and are beneficial to improving the analysis efficiency of the user relationship diagram and improving the achievement transformation speed of the user relationship diagram.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to an aspect of the present disclosure, a method for hierarchically displaying a user relationship diagram is provided, the method including: generating a user relationship graph according to the plurality of user relationship data; determining at least one display policy; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to the at least one display strategy; and displaying the user relationship graph in a layering mode according to the user relationship subgraphs and the corresponding hierarchical labels.
Optionally, the method further comprises: and calling the corresponding user relation tile graph to display based on the zooming operation of the user on the user relation subgraph.
Optionally, generating the user relationship graph according to the plurality of user relationship data includes: taking users in the plurality of user relationship data as nodes; taking an association relationship in the plurality of user relationship data as an edge, wherein the association relationship comprises at least one of the following: the device incidence relation, the network incidence relation and the user identification card incidence relation; and generating the user relationship graph based on the nodes and the edges.
Optionally, generating a plurality of user relationship subgraphs and a plurality of hierarchical tags through the user relationship graph according to the at least one display policy comprises: splitting the user relationship graph according to the at least one display strategy and community discovery algorithm to generate a plurality of user relationship subgraphs and the plurality of hierarchical labels.
Optionally, splitting the user relationship graph according to the at least one display policy and community discovery algorithm to generate a plurality of user relationship subgraphs and the plurality of hierarchical tags comprises: determining the number and the implementation sequence of the display strategies; screening user nodes in the user relationship graph according to the implementation sequence and a community discovery algorithm to generate a plurality of user relationship subgraph sets, wherein the user relationship subgraph sets comprise a plurality of user relationship subgraphs; and setting hierarchical labels for the plurality of user relationship subgraphs according to the implementation sequence.
Optionally, the filtering the user nodes in the user relationship graph according to the implementation order and the community discovery algorithm to generate a plurality of user relationship subgraph sets includes: determining a first preset strategy according to the implementation sequence; and screening the user nodes in the user relationship graph based on the first preset strategy and the community discovery algorithm to generate a first-layer user relationship subgraph set.
Optionally, the filtering the user nodes in the user relationship graph according to the implementation order and the community discovery algorithm to generate a plurality of user relationship subgraph sets further includes: determining an nth preset strategy according to the implementation sequence; screening user nodes in the nth-1 layer user relationship subgraph set based on the nth preset strategy and a community discovery algorithm to generate an nth layer user relationship subgraph set; wherein n is a positive integer greater than 1.
Optionally, the setting a hierarchical label for the plurality of user relationship subgraphs according to the implementation order further comprises: and sequentially associating the nth layer user relation drawing set with the n-1 layer user relation drawing set on the basis of the hierarchical label.
Optionally, invoking the corresponding user relationship tile graph for displaying based on the scaling operation of the user on the user relationship sub-graph includes: determining a node limit value in a user relation tile graph; determining the division number according to the node limit value and the number of user nodes of the user relationship subgraph; and dividing the user relationship subgraph into a plurality of user relationship tile graphs according to the dividing quantity.
Optionally, before dividing the user relationship subgraph into a plurality of user relationship tile graphs according to the division number, the method further includes: and associating the plurality of user relation tile graphs with the corresponding user relation subgraphs through a detail level technology.
According to an aspect of the present disclosure, a hierarchical display apparatus of a user relationship diagram is provided, the apparatus including: the data module is used for generating a user relationship graph according to the user relationship data; a policy module to determine at least one display policy; the sub-graph module is used for generating a plurality of user relationship sub-graphs and a plurality of hierarchy labels through the user relationship graph according to the at least one display strategy; and the display module is used for hierarchically displaying the user relationship graphs according to the user relationship subgraphs and the hierarchy labels corresponding to the user relationship subgraphs.
Optionally, the method further comprises: and the tile map module is used for calling the corresponding user relation tile map for display based on the zooming operation of the user on the user relation subgraph.
Optionally, the data module includes: a node unit, configured to take users in the plurality of user relationship data as nodes; an edge unit, configured to use an association relationship in the plurality of user relationship data as an edge, where the association relationship includes at least one of: the device incidence relation, the network incidence relation and the user identification card incidence relation; and a graph unit for generating the user relationship graph based on the nodes and the edges.
Optionally, the sub-graph module is further configured to split the user relationship graph according to the at least one display policy and a community discovery algorithm to generate a plurality of user relationship sub-graphs and the plurality of hierarchical labels.
Optionally, the sub-graph module includes: the parameter unit is used for determining the number and the implementation sequence of the display strategies; the screening unit is used for screening the user nodes in the user relationship graph according to the implementation sequence and the community discovery algorithm to generate a plurality of user relationship subgraph sets, and each user relationship subgraph set comprises a plurality of user relationship subgraphs; and the hierarchical unit is used for setting hierarchical labels for the user relationship subgraphs according to the implementation sequence.
Optionally, the screening unit comprises: the first strategy subunit is used for determining a first preset strategy according to the implementation sequence; and the first screening subunit is used for screening the user nodes in the user relationship graph based on the first preset strategy and the community discovery algorithm to generate a first-layer user relationship subgraph set. Optionally, the nth preset strategy; the nth screening subunit is used for screening the user nodes in the nth-1 layer user relationship subgraph set based on the nth preset strategy and the community discovery algorithm to generate an nth layer user relationship subgraph set; wherein n is a positive integer greater than 1.
Optionally, the hierarchical unit comprises: and the association subunit is used for sequentially associating the nth layer of user relationship drawing set with the (n-1) th layer of user relationship drawing set on the basis of the hierarchical label.
Optionally, the tile map module comprises: a limit unit, configured to determine a node limit in the user relationship tile graph; the number unit is used for determining the division number according to the node limit value and the number of the user nodes of the user relationship subgraph; and the dividing unit is used for dividing the user relationship subgraph into a plurality of user relationship tile graphs according to the dividing quantity.
Optionally, the tile map module comprises: and the association unit is used for associating the plurality of user relation tile graphs with the corresponding user relation subgraphs through a detail hierarchy technology.
According to an aspect of the present disclosure, an electronic device is provided, the electronic device including: one or more processors; storage means for storing one or more programs; when executed by one or more processors, cause the one or more processors to implement a method as above.
According to an aspect of the disclosure, a computer-readable medium is proposed, on which a computer program is stored, which program, when being executed by a processor, carries out the method as above.
According to the layered display method and device of the user relationship graph, the electronic equipment and the computer readable medium, the user relationship graph is generated according to the user relationship data; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to at least one display strategy; and the user relationship graph is displayed in a layered mode according to the user relationship subgraphs and the hierarchical labels corresponding to the user relationship subgraphs, so that the user relationship graph can be displayed in a layered mode according to a display strategy required by a data analyzer, the analysis efficiency of the user relationship graph is improved, and the result conversion speed of the user relationship graph is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings. The drawings described below are merely some embodiments of the present disclosure, and other drawings may be derived from those drawings by those of ordinary skill in the art without inventive effort.
Fig. 1 is a system block diagram illustrating a method and apparatus for hierarchical display of a user relationship diagram according to an exemplary embodiment.
FIG. 2 is a flow diagram illustrating a method for hierarchical display of a user relationship diagram in accordance with an exemplary embodiment.
FIG. 3 is a diagram illustrating a hierarchical display of a user relationship graph in accordance with an illustrative embodiment.
FIG. 4 is a flowchart illustrating a method for hierarchical display of a user relationship diagram in accordance with another exemplary embodiment.
FIG. 5 is a flowchart illustrating a method for hierarchical display of a user relationship diagram, according to another exemplary embodiment.
Fig. 6 is a block diagram illustrating an apparatus for a hierarchical display method of a user relationship diagram according to an exemplary embodiment.
FIG. 7 is a block diagram illustrating an electronic device in accordance with an example embodiment.
FIG. 8 is a block diagram illustrating a computer-readable medium in accordance with an example embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the disclosure.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various components, these components should not be limited by these terms. These terms are used to distinguish one element from another. Thus, a first component discussed below may be termed a second component without departing from the teachings of the disclosed concept. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
It is to be understood by those skilled in the art that the drawings are merely schematic representations of exemplary embodiments, and that the blocks or processes shown in the drawings are not necessarily required to practice the present disclosure and are, therefore, not intended to limit the scope of the present disclosure.
Fig. 1 is a system block diagram illustrating a method and apparatus for hierarchical display of a user relationship diagram according to an exemplary embodiment.
As shown in fig. 1, the system architecture 10 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have various communication client applications installed thereon, such as a financial services application, a shopping application, a web browser application, an instant messaging tool, a mailbox client, social platform software, and the like.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server that provides various services, such as a background management server that supports a graph data processing-type website browsed by a user using the terminal apparatuses 101, 102, 103. For example, a user sends a graph data analysis request to the server 105 by using the terminal device 103 (which may also be the terminal device 101 or 102), and the server 105 may generate a user relationship graph according to a plurality of user relationship data; the server 105 may, for example, determine at least one display policy; server 105 may generate a plurality of user relationship subgraphs and a plurality of hierarchical tags from the user relationship graph, e.g., according to the at least one display policy; the server 105 may display the user relationship graph hierarchically according to the user relationship subgraphs and the hierarchy tags corresponding to the user relationship subgraphs, for example.
The terminal devices 101, 102, 103 may, for example, invoke a corresponding user relationship tile graph in the server 105 for display based on the scaling operation of the user on the user relationship sub-graph.
The server 105 may be a single entity server, or may be composed of a plurality of servers, for example, it should be noted that the hierarchical display method of the user relationship diagram provided by the embodiment of the present disclosure may be executed by the server 105, and accordingly, a hierarchical display method apparatus of the user relationship diagram may be disposed in the server 105. And the web page end provided for the user to submit the data analysis request is generally located in the terminal equipment 101, 102, 103.
FIG. 2 is a flow diagram illustrating a method for hierarchical display of a user relationship diagram in accordance with an exemplary embodiment. The hierarchical display method 20 of the user relationship diagram includes at least steps S202 to S208.
As shown in fig. 2, in S202, a user relationship diagram is generated from a plurality of user relationship data. The premise of constructing the user relationship graph is to extract required data from different data sources and store the data into a graph database, so that information extraction is the basis for constructing the relationship graph. Structured data that may be stored, for example, in a relational database, such as: the IP address, longitude and latitude, device fingerprint, etc., and may also be collected by crawler in non-mechanization mode, such as behavior record, web browsing record, etc.
In one embodiment, the users and devices in the plurality of user relationship data may be treated as nodes, for example; taking an association relationship in the plurality of user relationship data as an edge, wherein the association relationship comprises at least one of the following: the device incidence relation, the network incidence relation and the user identification card incidence relation; and generating the user relationship graph based on the nodes and the edges. In the user relationship graph, the nodes may include: IP address, longitude and latitude, device fingerprint, account, contact person, overdue blacklist and other related information, and different entity nodes are related through mobile phone numbers. The relationships between nodes may include: affiliations, emergency contacts, intercommunicating telephones, the same network, etc.; and constructing a user relationship graph through the nodes and the relationships.
In S204, at least one display policy is determined. The data analyst can determine a display strategy according to the own needs, and the display strategy can be a node feature concerned by the data analyst.
The display policy may be, for example, a node attribute characteristic, wherein a node attribute may include a device, a wireless network, an address, and so on, as described above; the display policy may also be, for example, a user characteristic of the node, may be, for example, whether it is overdue, whether the user is professional sensitive, whether it is a blacklisted user, etc.; the display policy may also be a relevance feature for the node, such as a similar professional user, a similar revenue user, a same industry user, and so on. The above features can be freely set according to the concern of the data analyst.
In S206, a plurality of user relationship subgraphs and a plurality of hierarchical tags are generated through the user relationship graph according to the at least one display policy. The method specifically comprises the following steps: splitting the user relationship graph according to the at least one display strategy and community discovery algorithm to generate a plurality of user relationship subgraphs and the plurality of hierarchical labels.
Among them, the community discovery algorithm may be, for example: the Louvain algorithm, also called Fast-Unfolding algorithm, is a community discovery algorithm based on Modularity (modulation). The algorithm has good performance and expression effect on large-scale graph structures, and has accepted theoretical support. The objective function is to optimize the modularity of the entire graph (network).
The process of the Louvain algorithm may be as follows:
firstly, regarding each node in a user relationship graph as an independent community, wherein the number of the initial communities is the same as that of the nodes;
then, for each node i, trying to distribute the node i to a community where neighbor nodes are located based on a first preset strategy, and calculating the modularity change delta Q before and after distribution; modularity (Modularity) is a measurement index for evaluating the division of a community network; recording the neighbor node with the maximum delta Q; if the maximum delta Q is larger than 0, the node i is distributed to the community where the neighbor node with the maximum delta Q is located, otherwise, the division is abandoned; repeating the steps until the communities of all the nodes are not changed;
and then, compressing the user relationship graph, compressing all nodes in the same community into a new node, converting the weight of edges between the nodes in the community into the weight of a ring of the new node, and converting the weight of edges between the community into the weight of edges between the new nodes. Wherein each newly compressed node can be used as a user relationship subgraph. A hierarchical label is determined for the community.
And then, dividing the nodes in each community based on a second preset strategy again, merging the nodes in the communities again, and generating the sub-communities in each community. A hierarchical label is determined for the sub-community.
And repeating the steps until all preset strategies are implemented, generating a plurality of user relationship sub-graph sets and corresponding hierarchy labels thereof, wherein each sub-set represents a community.
The details of "generating a plurality of user relationship subgraphs and a plurality of hierarchical labels from the user relationship graph according to the at least one display policy" will be described in the embodiment corresponding to fig. 5.
In S208, the user relationship graph is hierarchically displayed according to the user relationship subgraphs and the hierarchy labels corresponding to the user relationship subgraphs. The user relationship graph may be displayed first, for example, with all nodes included in the user relationship graph. And then sequentially displaying user relationship subgraphs in a user relationship subgraph set according to the sequence of the hierarchy, wherein the user relationship subgraph set comprises a plurality of user relationship subgraphs, and the user relationship subgraphs comprise part of user nodes.
In the process of displaying, a specific user relationship sub-graph can be displayed in more detail according to the selection of an operator.
In one embodiment, the display policy entered by the operator is: equipment IP address, records of losing confidence and low income crowd; according to the input of a user, firstly, carrying out a community discovery algorithm on similar equipment IP addresses in a user relationship graph so as to divide the user relationship graph into a plurality of first-level user relationship sub-graphs A, B, C and D; and dividing each user relationship subgraph again on the basis of the user relationship subgraphs.
For example, on the basis of the user relationship sub-graph a, the community discovery algorithm is performed again to calculate the users with the loss-of-trust records, and the user relationship sub-graph a is divided into a plurality of user relationship sub-graphs AA and AB of the second level.
For example, on the basis of the user relationship subgraph AA, the community discovery algorithm is performed again to calculate the users with low income, and the user relationship subgraph AA is divided into a plurality of third-level user relationship subgraphs AAA, AAB, AAC, AAD and the like.
After all the display strategies are calculated, the user relationship subgraphs are displayed to an operator, and a certain user relationship subgraph can be displayed according to specific input of the operator. The operator may, for example, input: the IP address of the equipment is XX province, and users with lost message records and income ranges of 2000-3000 yuan exist. And calling out a target user relationship subgraph for display according to the division result.
In one embodiment, further comprising: and calling the corresponding user relation tile graph to display based on the zooming operation of the user on the user relation subgraph. In practical situations, a large amount of user data can reach billions, and after several times of policy division, nodes included in the user relationship subgraph may still be tens of thousands of nodes. In this case, the number of nodes is large, which is still not beneficial for a data analyst to analyze the graph data, so that the user relationship subgraph can be divided again until the number of nodes in the last-stage user relationship subgraph is hundreds or tens. And then dividing the user relationship sub-graph into a plurality of user relationship tile graphs according to the number of the user nodes based on the current last-stage user relationship sub-graph.
The details of "calling the corresponding user relationship tile map for display based on the zoom operation of the user on the user relationship sub-map" will be described in the embodiment corresponding to fig. 4.
According to the layered display method of the user relationship graph, the user relationship graph is generated according to a plurality of user relationship data; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to at least one display strategy; and the user relationship graph is displayed in a layered mode according to the user relationship subgraphs and the hierarchical labels corresponding to the user relationship subgraphs, so that the user relationship graph can be displayed in a layered mode according to a display strategy required by a data analyzer, the analysis efficiency of the user relationship graph is improved, and the result conversion speed of the user relationship graph is improved.
It should be clearly understood that this disclosure describes how to make and use particular examples, but the principles of this disclosure are not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.
Fig. 3 is a diagram illustrating a hierarchical display method of a user relationship diagram according to another exemplary embodiment.
As shown in fig. 3, a user relationship graph may be generated according to a large amount of user relationship data, and then the user relationship graph is sequentially divided according to different predetermined strategies, where each division generates a plurality of user relationship subgraphs, and the plurality of user relationship subgraphs generate a plurality of user relationship subgraph sets according to a higher-level hierarchical relationship of the plurality of user relationship subgraphs.
In one embodiment, after all the preset policies are implemented, stopping performing more hierarchical division on the plurality of user relationship sub-graphs, and dividing the user relationship sub-graphs into a plurality of user relationship tile graphs according to the number of user nodes based on the current last-stage user relationship sub-graph.
In an embodiment, the hierarchical partitioning stop threshold may be determined according to the number of nodes in the user relationship subgraph, for example, after all the preset policies are implemented, the number of nodes included in the user relationship subgraph in the last stage is large, and at this time, the user relationship subgraph in the last stage may be partitioned again according to the automatic partitioning policy until the number of nodes included in the user relationship subgraph in the last stage is smaller than the threshold.
With the development of internet finance in recent years, fraud molecules have opportunities to forge materials, maliciously register a large number of false accounts, group packaging, form brushing, red packet snatching, set rebate and the like, and the technical means of fraud are higher and higher (group control and cloud control) and the cost is lower and higher. In order to limit the fraudulent users, a multi-layer user relationship graph, degree association, second degree association, third degree association and even more dimension association can be established through the generation method of the multi-layer user relationship graph set in the disclosure, a strong connection relationship between the nodes can be found through a sharing entity between the nodes, a network data analyzer can be helped to effectively and quickly find hidden common characteristics, a credit agency can also establish an anti-fraud team and a wind control prevention system based on the multi-layer user relationship graph, and a fraud holder is intercepted by using expert rules and a prediction model.
FIG. 4 is a flowchart illustrating a method for hierarchical display of a user relationship diagram in accordance with another exemplary embodiment. The flow shown in fig. 4 is a detailed description of "calling a corresponding user relationship tile map for display based on the zoom operation of the user on the user relationship sub-graph".
As shown in fig. 4, in S402, node limits in the user relationship tile map are determined.
In S404, determining the number of partitions according to the node limit and the number of user nodes in the user relationship subgraph.
In S406, the user relationship subgraph is divided into a plurality of user relationship tile graphs according to the division number.
In S408, the plurality of user relationship tile maps are associated with their corresponding user relationship subgraphs by a level of detail technique.
Each user relationship sub-graph of the plurality of user relationship sub-graph sets may be divided into a plurality of user relationship tile graphs, e.g., based on LOD techniques. The LOD technology is used for determining the resource allocation of object rendering according to the positions and the importance of the nodes of the object model in the display environment, reducing the number of faces and the detail of non-important objects and further obtaining high-efficiency rendering operation.
The generation of the LOD model is a three-dimensional polygonal mesh simplification problem. The mesh simplification aims to represent a model represented by a polygonal mesh by an approximate model which basically retains the visual characteristics of the original model but has a smaller number of vertices than the original mesh.
Level of detail technology (LOD technology), which is derived from the idea of tile map in the map, describes and draws different details for different areas of the terrain according to different complexities of the terrain and the characteristics of observing the terrain by human eyes in the map. The LOD technology is adopted to draw the terrain, and the number of triangles can be reduced as much as possible on the premise of not reducing the performance effect, so that the graphic drawing efficiency is improved, and the real-time interactive visualization of the terrain is realized. In the disclosure, the last layer of the user relationship sub-graph is divided again by the number of nodes based on the LOD technology to generate a plurality of tile graphs containing fewer nodes to facilitate the user to view. More specifically, in the present disclosure, a plurality of nodes adjacent to each other may be divided in one tile map.
A pyramid model can be adopted for dividing the tile map, wherein the pyramid model is a multi-resolution hierarchical model, the resolution is lower from the bottom layer to the top layer of the tile pyramid, and the represented geographic range is unchanged. Firstly, determining the number N of zoom levels to be provided, taking a tile map with the highest zoom level and the largest number of user nodes as the bottom layer of a pyramid, namely a 0 th layer, partitioning the tile map, cutting the tile map from the top left corner of the 0 th layer tile map from left to right and from top to bottom, and dividing the tile map into square tiles with the same size (such as 256x256 pixels) to form a 0 th layer tile matrix; on the basis of the map picture of the layer 0, generating the map picture of the layer 1 by a method of synthesizing one pixel by every 2x2 pixels, partitioning the map picture of the layer 1, and dividing the map picture into square map tiles with the same size as the next layer to form a tile matrix of the layer 1; generating a layer 2 tile matrix by the same method; …, respectively; this continues until the nth 1 layer, which constitutes the entire tile pyramid.
FIG. 5 is a flowchart illustrating a method for hierarchical display of a user relationship diagram, according to another exemplary embodiment. The flow shown in fig. 5 is a detailed description of S206 "generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to the at least one display policy" in the flow shown in fig. 2.
As shown in fig. 5, in S502, the number of display policies and the implementation order are determined.
In S504, the nth preset strategy is determined according to the implementation order.
In S506, based on the nth preset policy and the community discovery algorithm, the user nodes in the nth-1 layer user relationship subgraph set are screened, and an nth layer user relationship subgraph set is generated.
In S508, the nth layer user relation drawing set and the (n-1) th layer user relation drawing set are sequentially associated based on the hierarchy labels.
More specifically, a first preset strategy may be determined according to the implementation order; and screening the user nodes in the user relationship graph based on the first preset strategy and the community discovery algorithm to generate a first-layer user relationship subgraph set.
Dividing all user relationship subgraphs in the first layer of user relationship subgraph set again according to a second preset strategy to generate a second layer of user relationship subgraph set; and dividing all the user relationship subgraphs in the second layer of user relationship subgraph set again according to a third preset strategy to generate a third layer of user relationship subgraph set, and repeating the steps until all the preset strategies are implemented.
For example, when a first preset policy is implemented, the plurality of user relationship subgraphs into which the user relationship graph is divided are set as a first layer, when an nth preset policy is implemented, the plurality of user relationship subgraphs into which the user relationship graph is divided are set as an nth layer, and in each level label, a specific preset policy name is further included. Specifically, for example, the first layer is an equipment layer, the second layer is a default layer, the third layer is a loss layer, and the fourth layer is a loss layer.
Those skilled in the art will appreciate that all or part of the steps implementing the above embodiments are implemented as computer programs executed by a CPU. When executed by the CPU, performs the functions defined by the above-described methods provided by the present disclosure. The program may be stored in a computer readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.
Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods. For details not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the method of the present disclosure.
Fig. 6 is a block diagram illustrating an apparatus for a hierarchical display method of a user relationship diagram according to an exemplary embodiment. As shown in fig. 6, the device 60 for hierarchical display of a user relationship diagram includes: a data module 602, a policy module 604, a subpicture module 606, a display module 608, and a tile map module 610.
The data module 602 is configured to generate a user relationship graph according to a plurality of user relationship data; the data module 602 includes: a node unit, configured to take users in the plurality of user relationship data as nodes; an edge unit, configured to use an association relationship in the plurality of user relationship data as an edge, where the association relationship includes at least one of: the device incidence relation, the network incidence relation and the user identification card incidence relation; and a graph unit for generating the user relationship graph based on the nodes and the edges.
The policy module 604 is configured to determine at least one display policy;
the sub-graph module 606 is configured to generate a plurality of user relationship sub-graphs and a plurality of hierarchical tags through the user relationship graph according to the at least one display policy; the sub-graph module 606 is further configured to split the user relationship graph according to the at least one display policy and the community discovery algorithm to generate a plurality of user relationship sub-graphs and the plurality of hierarchical labels.
the filtering unit in sub-graph module 606 includes: the first strategy subunit is used for determining a first preset strategy according to the implementation sequence; and the first screening subunit is used for screening the user nodes in the user relationship graph based on the first preset strategy and the community discovery algorithm to generate a first-layer user relationship subgraph set. The nth strategy subunit is used for determining the nth preset strategy according to the implementation sequence; the nth screening subunit is used for screening the user nodes in the nth-1 layer user relationship subgraph set based on the nth preset strategy and the community discovery algorithm to generate an nth layer user relationship subgraph set; wherein n is a positive integer greater than 1.
The display module 608 is configured to display the user relationship graph hierarchically according to the user relationship subgraphs and the hierarchy labels corresponding to the user relationship subgraphs.
The tile map module 610 is configured to invoke a corresponding user relationship tile map for display based on a zoom operation of the user on the user relationship subgraph.
The tile map module 610 includes: a limit unit, configured to determine a node limit in the user relationship tile graph; the number unit is used for determining the division number according to the node limit value and the number of the user nodes of the user relationship subgraph; and the dividing unit is used for dividing the user relationship subgraph into a plurality of user relationship tile graphs according to the dividing quantity. And the association unit is used for associating the plurality of user relation tile graphs with the corresponding user relation subgraphs through a detail hierarchy technology.
According to the hierarchical display method and device of the user relationship graph, the user relationship graph is generated according to a plurality of user relationship data; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to at least one display strategy; and the user relationship graph is displayed in a layered mode according to the user relationship subgraphs and the hierarchical labels corresponding to the user relationship subgraphs, so that the user relationship graph can be displayed in a layered mode according to a display strategy required by a data analyzer, the analysis efficiency of the user relationship graph is improved, and the result conversion speed of the user relationship graph is improved.
FIG. 7 is a block diagram illustrating an electronic device in accordance with an example embodiment.
An electronic device 700 according to this embodiment of the disclosure is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 7, electronic device 700 is embodied in the form of a general purpose computing device. The components of the electronic device 700 may include, but are not limited to: at least one processing unit 710, at least one memory unit 720, a bus 730 that connects the various system components (including the memory unit 720 and the processing unit 710), a display unit 740, and the like.
Wherein the storage unit stores program codes executable by the processing unit 710 to cause the processing unit 710 to perform the steps according to various exemplary embodiments of the present disclosure described in the above-mentioned electronic prescription flow processing method section of the present specification. For example, the processing unit 710 may perform the steps as shown in fig. 2, 4, 5.
The memory unit 720 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)7201 and/or a cache memory unit 7202, and may further include a read only memory unit (ROM) 7203.
The memory unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 700 may also communicate with one or more external devices 700' (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 700, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 700 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 750. Also, the electronic device 700 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 760. The network adapter 760 may communicate with other modules of the electronic device 700 via the bus 730. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, as shown in fig. 8, the technical solution according to the embodiment of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above method according to the embodiment of the present disclosure.
The software product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The computer readable medium carries one or more programs which, when executed by a device, cause the computer readable medium to perform the functions of: generating a user relationship graph according to the plurality of user relationship data; determining at least one display policy; generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to the at least one display strategy; and displaying the user relationship graph in a layering mode according to the user relationship subgraphs and the corresponding hierarchical labels.
Those skilled in the art will appreciate that the modules described above may be distributed in the apparatus according to the description of the embodiments, or may be modified accordingly in one or more apparatuses unique from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Exemplary embodiments of the present disclosure are specifically illustrated and described above. It is to be understood that the present disclosure is not limited to the precise arrangements, instrumentalities, or instrumentalities described herein; on the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (10)
1. A hierarchical display method of a user relationship graph is characterized by comprising the following steps:
generating a user relationship graph according to the plurality of user relationship data;
determining at least one display policy;
generating a plurality of user relationship subgraphs and a plurality of hierarchical labels through the user relationship graph according to the at least one display strategy; and
and displaying the user relationship graph in a layered manner according to the user relationship subgraphs and the corresponding hierarchical labels.
2. The method of claim 1, further comprising:
and calling the corresponding user relation tile graph to display based on the zooming operation of the user on the user relation subgraph.
3. The method of any of claims 1-2, wherein generating the user relationship graph from the plurality of user relationship data comprises:
taking users in the plurality of user relationship data as nodes;
taking an association relationship in the plurality of user relationship data as an edge, wherein the association relationship comprises at least one of the following: the device incidence relation, the network incidence relation and the user identification card incidence relation; and
generating the user relationship graph based on the nodes and the edges.
4. The method of any of claims 1-3, wherein generating a plurality of user relationship subgraphs and a plurality of hierarchical labels from the user relationship graph according to the at least one display policy comprises:
splitting the user relationship graph according to the at least one display strategy and community discovery algorithm to generate a plurality of user relationship subgraphs and the plurality of hierarchical labels.
5. The method of any of claims 1-4, wherein splitting the user relationship graph to generate a plurality of user relationship subgraphs and the plurality of hierarchical labels according to the at least one display policy and community discovery algorithm comprises:
determining the number and the implementation sequence of the display strategies;
screening user nodes in the user relationship graph according to the implementation sequence and a community discovery algorithm to generate a plurality of user relationship subgraph sets, wherein the user relationship subgraph sets comprise a plurality of user relationship subgraphs; and
and setting hierarchical labels for the plurality of user relationship subgraphs according to the implementation sequence.
6. The method of any of claims 1-5, wherein filtering the user nodes in the user relationship graph to generate a plurality of sets of user relationship subgraphs according to the enforcement order and community discovery algorithm comprises:
determining a first preset strategy according to the implementation sequence; and
and screening the user nodes in the user relationship graph based on the first preset strategy and the community discovery algorithm to generate a first-layer user relationship subgraph set.
7. The method of any of claims 1-6, wherein filtering user nodes in the user relationship graph to generate a plurality of sets of user relationship subgraphs according to the enforcement order and community discovery algorithm further comprises:
determining an nth preset strategy according to the implementation sequence; and
screening user nodes in the nth-1 layer user relationship subgraph set based on the nth preset strategy and a community discovery algorithm to generate an nth layer user relationship subgraph set;
wherein n is a positive integer greater than 1.
8. A hierarchical display apparatus of a user relationship graph, comprising:
the data module is used for generating a user relationship graph according to the user relationship data;
a policy module to determine at least one display policy;
the sub-graph module is used for generating a plurality of user relationship sub-graphs and a plurality of hierarchy labels through the user relationship graph according to the at least one display strategy; and
and the display module is used for hierarchically displaying the user relationship graphs according to the user relationship subgraphs and the hierarchy labels corresponding to the user relationship subgraphs.
9. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910939039.2A CN110781314B (en) | 2019-09-29 | 2019-09-29 | Hierarchical display method and device of user relationship graph and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910939039.2A CN110781314B (en) | 2019-09-29 | 2019-09-29 | Hierarchical display method and device of user relationship graph and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110781314A true CN110781314A (en) | 2020-02-11 |
| CN110781314B CN110781314B (en) | 2024-03-26 |
Family
ID=69384843
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910939039.2A Active CN110781314B (en) | 2019-09-29 | 2019-09-29 | Hierarchical display method and device of user relationship graph and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110781314B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111612038A (en) * | 2020-04-24 | 2020-09-01 | 平安直通咨询有限公司上海分公司 | Abnormal user detection method and device, storage medium and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160196673A1 (en) * | 2012-03-28 | 2016-07-07 | Technomics, Inc. | Methods and apparatus for data visualization of hierarchical data structures |
| CN105808617A (en) * | 2014-12-31 | 2016-07-27 | 高德软件有限公司 | Generation method and device of electronic map, and display method and device of the electronic map |
| CN107229756A (en) * | 2017-06-30 | 2017-10-03 | 山东合天智汇信息技术有限公司 | A kind of design method and system directly perceived for showing business connection collection of illustrative plates |
| CN109508389A (en) * | 2018-12-19 | 2019-03-22 | 哈尔滨工程大学 | A kind of personnel's social relationships map visualization accelerated method |
| CN110162577A (en) * | 2019-05-09 | 2019-08-23 | 中国工商银行股份有限公司 | The visualization of enterprise's family tree shows method, equipment and system |
-
2019
- 2019-09-29 CN CN201910939039.2A patent/CN110781314B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160196673A1 (en) * | 2012-03-28 | 2016-07-07 | Technomics, Inc. | Methods and apparatus for data visualization of hierarchical data structures |
| CN105808617A (en) * | 2014-12-31 | 2016-07-27 | 高德软件有限公司 | Generation method and device of electronic map, and display method and device of the electronic map |
| CN107229756A (en) * | 2017-06-30 | 2017-10-03 | 山东合天智汇信息技术有限公司 | A kind of design method and system directly perceived for showing business connection collection of illustrative plates |
| CN109508389A (en) * | 2018-12-19 | 2019-03-22 | 哈尔滨工程大学 | A kind of personnel's social relationships map visualization accelerated method |
| CN110162577A (en) * | 2019-05-09 | 2019-08-23 | 中国工商银行股份有限公司 | The visualization of enterprise's family tree shows method, equipment and system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111612038A (en) * | 2020-04-24 | 2020-09-01 | 平安直通咨询有限公司上海分公司 | Abnormal user detection method and device, storage medium and electronic equipment |
| CN111612038B (en) * | 2020-04-24 | 2024-04-26 | 平安直通咨询有限公司上海分公司 | Abnormal user detection method and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110781314B (en) | 2024-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Suma et al. | Enabling next generation logistics and planning for smarter societies | |
| CN110807129B (en) | Method and device for generating multi-layer user relation graph set and electronic equipment | |
| EP3267377A1 (en) | Identifying network security risks | |
| CN111614690A (en) | Abnormal behavior detection method and device | |
| CN110148053B (en) | User credit line evaluation method and device, electronic equipment and readable medium | |
| CN111340240A (en) | Method and device for realizing automatic machine learning | |
| CN112017062B (en) | Resource quota distribution method and device based on guest group subdivision and electronic equipment | |
| CN111598494A (en) | Resource limit adjusting method and device and electronic equipment | |
| JP2022074133A (en) | Computing device, computer-implemented method and computer-readable storage medium for multivariate time series modeling and forecasting (probabilistic nonlinear relationships across multiple time series and external factors for improved multivariate time series modeling and forecasting) | |
| CN115062163A (en) | Abnormal tissue identification method, abnormal tissue identification device, electronic device and medium | |
| Cortes et al. | Giga-Mining. | |
| US20220084034A1 (en) | Encoding multi-dimensional information for deep vision learning | |
| CN110781314B (en) | Hierarchical display method and device of user relationship graph and electronic equipment | |
| CN114862282B (en) | Business and financial cooperative management method and system based on data analysis | |
| CN113297436B (en) | User policy distribution method and device based on relational graph network and electronic equipment | |
| CN115511343A (en) | Method, device, equipment and storage medium for determining city core area | |
| US8620895B1 (en) | Mapping organizational accounting codes to access business information | |
| CN113298645A (en) | Resource limit adjusting method and device and electronic equipment | |
| CN114900364A (en) | High-level continuous threat detection method based on tracing graph and heterogeneous graph neural network | |
| CN114663242A (en) | Product information interaction method, device, medium and equipment | |
| CN114090407A (en) | Interface performance early warning method based on linear regression model and related equipment thereof | |
| CN114493853A (en) | Credit rating evaluation method, credit rating evaluation device, electronic device and storage medium | |
| Gill et al. | A context sensitive security framework for Enterprise multimedia placement in fog computing environment | |
| CN115204888A (en) | Target account identification method and device, storage medium and electronic equipment | |
| CN112989150A (en) | Operation and maintenance diagram acquisition method, device, equipment and readable 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 |