CN111199480A - Method and device for determining risk user - Google Patents
Method and device for determining risk user Download PDFInfo
- Publication number
- CN111199480A CN111199480A CN202010012264.4A CN202010012264A CN111199480A CN 111199480 A CN111199480 A CN 111199480A CN 202010012264 A CN202010012264 A CN 202010012264A CN 111199480 A CN111199480 A CN 111199480A
- Authority
- CN
- China
- Prior art keywords
- guarantee
- user
- users
- determining
- node
- 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
Images
Classifications
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/03—Credit; Loans; Processing thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Software Systems (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present application relates to the field of big data processing technologies, and in particular, to a method and an apparatus for determining a risky user. According to the method and the device, historical guarantee relationship information of a plurality of users is obtained, a guarantee directed graph is established according to the historical guarantee relationship information of the users, so that at least one guarantee ring used for representing guarantee relationships among the users to form a closed loop is determined, and if a target user is in any guarantee ring of the at least one guarantee ring, the target user is determined to be a risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
Description
Technical Field
The application relates to the technical field of big data analysis, in particular to a method and a device for determining a risk user.
Background
In actual business, two borrowers often guarantee each other, or the borrowers guarantee other borrowers simultaneously, forming chain guarantee or closed-loop guarantee, such guarantee behaviors result in systematic loan risk increase in areas and industries, because as long as one user in a guarantee circle can not repay the loan on time, multiple loans can be generated and go wrong at the same time, which inevitably causes breakage of the guarantee chain, and the loan risk is multiplied, thereby further developing the risk of each user in the whole guarantee circle.
Because the guarantee ring has the characteristics of large scale, complex relation and the like, the prior art can only identify the guarantee relationship among each user manually, needs to identify the guarantee relationship among a plurality of users layer by layer, and has low efficiency of finding out the guarantee ring for representing mutual guarantee forming loops among the users and the risk users in the guarantee ring.
Disclosure of Invention
In view of this, an object of the embodiments of the present application is to provide a method and an apparatus for determining a risky user, where at least one guarantee circle used for representing a guarantee relationship between users to form a closed loop is determined by obtaining historical guarantee relationship information of a plurality of users and establishing a guarantee directed graph according to the historical guarantee relationship information of the plurality of users, and if a target user is in any one of the at least one guarantee circle, the target user is determined to be the risky user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
Mainly comprises the following aspects:
in a first aspect, an embodiment of the present application provides a method for determining a risk user, where the method includes:
acquiring historical guarantee relationship information of a plurality of users; the plurality of users comprise target users to be determined for guaranteeing the risk;
establishing a guarantee directed graph for representing the guarantee relationship among the users according to the historical guarantee relationship information of the users;
determining at least one guarantee circle for representing that mutual guarantee among users forms a loop according to the guarantee directed graph;
and if the target user belongs to a user in any one guarantee circle in the at least one guarantee circle, determining that the target user is a risk user.
In one possible embodiment, the creating a guaranteed oriented graph for characterizing guaranteed relationships among the users according to historical guaranteed relationship information of the users includes:
taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to a historical guarantee relationship between any two user nodes in the plurality of user nodes;
and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
In a possible implementation, the determining, according to the guarantee directed graph, at least one guarantee circle for characterizing mutual guarantee forming loops between users includes:
selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge and determining a second user node associated with the first user node through the directed edge according to the role-preserving directed graph;
judging whether the second user node is the starting user node;
if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring;
the first user node and the second user node are any two different user nodes in the plurality of user nodes.
In a possible embodiment, after determining at least one guarantee ring for characterizing the guarantee relationship between users to form a closed loop, the method further comprises:
determining a plurality of users corresponding to each guarantee circle in the at least one guarantee circle;
if the users in the first guarantee ring are the users in the second guarantee ring, and the number of the users in the second guarantee ring is larger than or equal to the number of the users in the first guarantee ring, marking and storing a plurality of users corresponding to guarantee rings except the first guarantee ring in the at least one guarantee ring;
wherein the first and second wagers are any two different wagers of the at least one wagering.
In a second aspect, an embodiment of the present application further provides an apparatus for determining a risky user, where the apparatus for determining includes:
the acquisition module is used for acquiring historical guarantee relationship information of a plurality of users; the plurality of users comprise target users to be determined for guaranteeing the risk;
the establishing module is used for establishing a guarantee directed graph for representing the guarantee relation among the users according to the historical guarantee relation information of the users;
the first determination module is used for determining at least one guarantee ring for representing mutual guarantee forming loops among users according to the guarantee directed graph;
and the second determination module is used for determining that the target user is a risk user if the target user belongs to a user in any one guarantee circle of the at least one guarantee circle.
In a possible implementation manner, the establishing module is configured to establish the security oriented graph according to the following steps:
taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to a historical guarantee relationship between any two user nodes in the plurality of user nodes;
and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
In a possible implementation, the first determining module determines at least one guarantee ring for characterizing mutual guarantee loop formation between users, specifically according to the following steps:
selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge and determining a second user node associated with the first user node through the directed edge according to the role-preserving directed graph;
judging whether the second user node is the starting user node;
if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring;
the first user node and the second user node are any two different user nodes in the plurality of user nodes.
In a possible implementation, after the first determining module, the method further includes:
a third determining module, configured to determine a plurality of users corresponding to each of the at least one security circle;
the storage module is used for marking and storing a plurality of users corresponding to the guarantee rings except the first guarantee ring in the at least one guarantee ring if the users in the first guarantee ring are the users in the second guarantee ring and the number of the users in the second guarantee ring is larger than or equal to that of the users in the first guarantee ring;
wherein the first and second wagers are any two different wagers of the at least one wagering.
In a third aspect, an embodiment of the present application further provides an electronic device, including: a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, and when the electronic device runs, the processor and the memory communicate with each other through the bus, and the machine-readable instructions are executed by the processor to perform the steps of the method for determining a risky user according to the first aspect or any one of the possible embodiments of the first aspect.
In a fourth aspect, this embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method for determining an at-risk user described in the first aspect or any one of the possible implementation manners of the first aspect are performed.
In the embodiment of the application, at least one guarantee ring used for representing guarantee relations among users to form a closed loop is determined by acquiring historical guarantee relation information of a plurality of users and establishing a guarantee directed graph according to the historical guarantee relation information of the plurality of users, and if a target user is in any guarantee ring of the at least one guarantee ring, the target user is determined to be a risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a flowchart illustrating a method for determining a risk user according to an embodiment of the present application;
FIG. 2 is a schematic diagram illustrating a security circle according to an embodiment of the present disclosure;
FIG. 3 illustrates a schematic diagram of a secured directed graph according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an apparatus for determining a risk user according to an embodiment of the present application;
fig. 5 shows a second schematic structural diagram of an apparatus for determining a risk user according to an embodiment of the present application;
fig. 6 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
To make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and that steps without logical context may be performed in reverse order or concurrently. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
Before the application is provided, because the guarantee ring has the characteristics of large scale, complex relationship and the like, in the prior art, the guarantee relationship between each user can be manually identified, the guarantee relationship between a plurality of users needs to be identified layer by layer, and the efficiency of finding out the guarantee ring for representing mutual guarantee forming loops between the users and the risk users in the guarantee ring is low.
In view of the above problems, in the embodiment of the present application, historical guarantee relationship information of a plurality of users is obtained, and a guarantee directed graph is established according to the historical guarantee relationship information of the plurality of users, so as to determine at least one guarantee ring used for representing guarantee relationships among the users to form a closed loop, and if a target user is in any one guarantee ring of the at least one guarantee ring, the target user is determined to be a risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
For the convenience of understanding of the present application, the technical solutions provided in the present application will be described in detail below with reference to specific embodiments.
Fig. 1 is a flowchart of a method for determining a risk user according to an embodiment of the present application. The method for determining the risk user comprises the following steps:
s101: acquiring historical guarantee relationship information of a plurality of users; the plurality of users includes a target user for whom a guaranteed risk is to be determined.
In the step, historical guarantee information of each user in a plurality of users is obtained, wherein the historical guarantee information of each user comprises the relation and the amount of guarantee of the user to the users except the user, and the relation and the amount of guarantee of the users to the user, wherein the plurality of users comprise target users to be determined for guaranteeing the risk.
It should be noted that the user may be an individual user, an enterprise, an organization, or any other entity that can generate a guaranteed action.
S102: and establishing a guarantee directed graph for representing the guarantee relationship among the users according to the historical guarantee relationship information of the users.
In the step, a guarantee directed graph capable of representing guarantee relations among a plurality of users is established according to historical guarantee relation information of each user in the plurality of users, wherein each user serves as each user node in the guarantee directed graph, and the guarantee relations between two users serve as directed line segments in the guarantee directed graph.
S103: and determining at least one guarantee circle for representing that mutual guarantee among users forms a loop according to the guarantee directed graph.
In the step, at least one guarantee ring of a closed loop formed based on historical guarantee relation information of a plurality of users is determined among the users according to the established guarantee directed graph, wherein each guarantee ring comprises at least one user and guarantee relations among the at least one user.
In an example, referring to fig. 2, fig. 2 is a schematic structural diagram of a guarantee ring provided in an embodiment of the present application, where each user node in the diagram corresponds to each user, a directed line segment between the user nodes represents a guarantee relationship between the corresponding users, and the guarantee ring shown in fig. 2 is determined according to historical guarantee relationship information between multiple users.
S104: and if the target user belongs to a user in any one guarantee circle in the at least one guarantee circle, determining that the target user is a risk user.
In the step, after at least one guarantee circle is determined, at least one user in each guarantee circle is determined, if a target user belongs to one guarantee circle in the at least one determined guarantee circle, the target user is a risk user, wherein the risk user indicates that the user is in one guarantee circle, and if one user in the guarantee circle changes to cause that guarantee or repayment cannot be continued, each user in the guarantee circle is affected, and the risk user is affected, so that marking and storing the risk user can play a role in warning subsequent guarantee.
In one example, as shown in fig. 2, assuming that one acquired guarantee period is shown in fig. 2 and the target user is user C, the user C is in the guarantee period among the acquired guarantee periods, and is therefore the risky user.
In the embodiment of the application, at least one guarantee ring used for representing guarantee relations among users to form a closed loop is determined by acquiring historical guarantee relation information of a plurality of users and establishing a guarantee directed graph according to the historical guarantee relation information of the plurality of users, and if a target user is in any guarantee ring of the at least one guarantee ring, the target user is determined to be a risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
In one possible implementation, the creating a guaranty directed graph for characterizing the guaranty relationship between the users according to the historical guaranty relationship information of the users in S102 includes:
step (1): and taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to the historical guarantee relationship between any two user nodes in the plurality of user nodes.
Step (2): and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
In a specific implementation, a guarantee directed graph is generated according to history guarantee relationship information among a plurality of users, each user node corresponds to each user in the plurality of users in the guarantee directed graph, and directional line segments among the user nodes represent guarantee relationships among the users, so that the guarantee directed graph is formed through the history guarantee relationship information among the plurality of users and the plurality of users.
In one example, assuming that a user guarantees a user B, the user a and the user B respectively correspond to two nodes in the guaranteed directed graph, and the directed relationship between the user a node and the user B node is a → B, that is, the user node associated with the directed edge for the user a node is the user B node.
In one possible embodiment, the determining at least one guaranty circle for characterizing a guaranty relationship between users to form a closed loop in S103 includes:
step (I): and selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge according to the role-preserving directed graph, and determining a second user node associated with the first user node through the directed edge.
In the step, in the established bearing digraph, according to personal information of each user, as a keyword, a sequence number of each user node is randomly generated by using a hash function, the number of each user node is unique, one number represents one node, namely represents one user, a distributed digraph processing frame is used, starting from any one user node in a plurality of user nodes as an initial user node, sending the number of the user node to the user node with edge association, namely a first user node, of the initial user node, storing the number of the initial user node and the number of the first user node in the first user node, and transmitting the number of the initial user node and the number of the first user node to the user node with edge association, namely a second user node by the first user node, the second user node stores the number of the initial user node, the number of the first user node and the number of the second user node, wherein the second user node refers to more than one user node and refers to the user nodes which are transmitted to the user nodes associated with the directed edge all the time, the process is repeated until the user nodes traverse to the plurality of user nodes, no user node associated with the directed edge can send the number, and the number sending is finished.
In an example, referring to fig. 3, fig. 3 is a schematic structural diagram of a preserving digraph provided in this embodiment of the present application, where numbers of user nodes are as shown in the figure, the numbers on each node are unique, and each number may represent a user corresponding to each node, and assuming that, starting from node 1, node 1 transfers its own number to a user node associated with a directed edge, that is, node 2 and node 13, at this time, node 2 stores number 1 and number 2, and node 13 stores number 1 and number 13, and for node 2, node 2 sends number 1 and number 2 stored in node 2 to user node 7 associated with a directed edge, node 7 stores number 1, number 2, and number 7, and node 7 sends number 1, number 2, and number 7 to user nodes associated with a directed edge, that is, node 8, node 12, and node 14, and ending the numbering sending process until no user node can be sent in the whole security oriented graph.
Step (II): and judging whether the second user node is the starting user node or not.
In this step, the second user node refers to a user node that starts to confirm directed edge association from the initial user node, confirms the user node associated with the directed edge of the associated user node, repeats the confirmed user node, and determines whether the second user node is the initial user node, that is, determines whether the number of the initial user node is transmitted back to the initial user node.
Step (three): and if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring.
In this step, until it is determined that the second user node is the initial user node, that is, the initial user node receives the number of the initial user node, the closed-loop path formed by the first user node and the second user node from the initial user node may be determined as a security circle.
In one example, for the start of node 1, the own number 1 is sent to the user node associated with the directional edge, and the paths to receive the number 1 again are node 1 → node 2 → node 7 → node 12 → node 6 → node 9 → node 15 → node 14 → node 1, and node 1 → node 2 → node 7 → node 14 → node 1, and the two closed-loop paths are obtained and each closed-loop path is determined as the guarantee circle.
In a possible embodiment, after determining at least one guarantee ring for characterizing the guarantee relationship between users to form a closed loop in S103, the method further includes the following steps:
step (a): and determining a plurality of users corresponding to each guarantee circle in the at least one guarantee circle.
Step (b): if the users in the first guarantee ring are the users in the second guarantee ring, and the number of the users in the second guarantee ring is larger than or equal to the number of the users in the first guarantee ring, marking and storing a plurality of users corresponding to guarantee rings except the first guarantee ring in the at least one guarantee ring;
wherein the first and second wagers are any two different wagers of the at least one wagering.
In a specific implementation, after at least one guarantee circle is determined, a plurality of users corresponding to each guarantee circle in the at least one guarantee circle are obtained, the users in each guarantee circle are compared with the users corresponding to other guarantee circles except the guarantee circle in the at least one guarantee circle, if all the users in one guarantee circle are in the users corresponding to another guarantee circle, the guarantee circle is removed, the other guarantee circles are compared continuously, as long as all the users in one guarantee circle are in the users corresponding to another guarantee circle, the guarantee circle corresponding to less users is removed, the users corresponding to each guarantee circle in the other guarantee circles are obtained, each guarantee circle and the users corresponding to each guarantee circle are marked and stored, so that when the user wants to select a guarantee person, the condition of the users in the guarantee circle can be known, if the selected guarantor is in the guarantor circle, the function of warning can be played.
In an example, as shown in the security oriented graph shown in fig. 3, starting with node 1, two security rings are determined as follows:
a second guarantee ring: node 1 → node 2 → node 7 → node 12 → node 6 → node 9 → node 15 → node 14 → node 1;
a first guarantee ring: node 1 → node 2 → node 7 → node 14 → node 1;
after comparison, the nodes in the guarantee ring two are found, and all the nodes 1, 2, 7 and 14 are in the guarantee ring one, so that the guarantee ring two is removed.
Based on the same application concept, a device for determining a risky user corresponding to the method for determining a risky user provided in the above embodiment is also provided in the embodiment of the present application, and since the principle of solving the problem of the device in the embodiment of the present application is similar to the method for determining a risky user in the above embodiment of the present application, the implementation of the device may refer to the implementation of the method, and repeated details are omitted.
Referring to fig. 4, a schematic structural diagram of an apparatus 400 for determining a risky user provided in the embodiment of the present application is shown, and referring to fig. 5, a second schematic structural diagram of an apparatus 400 for determining a risky user provided in the embodiment of the present application is shown, where, as shown in fig. 4 and 5, the apparatus 400 for determining a risky user provided in the embodiment of the present application includes:
an obtaining module 410, configured to obtain historical guaranty relationship information of multiple users; the plurality of users comprise target users to be determined for guaranteeing the risk;
an establishing module 420, configured to establish, according to the historical guarantee relationship information of the multiple users, a guarantee directed graph for representing the guarantee relationship among the multiple users;
a first determining module 430, configured to determine, according to the guarantee directed graph, at least one guarantee ring for representing that mutual guarantees among users form a loop;
a second determining module 440, configured to determine that the target user is a risk user if the target user belongs to a user in any one of the at least one security circle.
According to the application, historical guarantee relationship information of each user is acquired through an acquisition module 410, a guarantee directed graph is established through an establishment module 420 according to the historical guarantee relationship information of each user, so that at least one guarantee ring for representing guarantee relationships among users to form a closed loop is determined according to a first determination module 430, and if a target user belongs to any guarantee ring in the at least one guarantee ring, the target user is determined to be a risk user through a second determination module 440. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
In a possible implementation manner, the establishing module 420 is configured to establish the security oriented graph according to the following steps:
taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to a historical guarantee relationship between any two user nodes in the plurality of user nodes;
and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
In a possible implementation, the first determining module 430 determines at least one guaranty circle characterizing a mutual guaranty loop between users, specifically according to the following steps:
selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge and determining a second user node associated with the first user node through the directed edge according to the role-preserving directed graph;
judging whether the second user node is the starting user node;
if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring;
the first user node and the second user node are any two different user nodes in the plurality of user nodes.
In a possible implementation, as shown in fig. 5, after the first determining module 430, the method further includes:
a third determining module 450 for determining a plurality of users corresponding to each of the at least one wager circles;
the storage module 460 is configured to mark and store a plurality of users corresponding to security circles except the first security circle in the at least one security circle if the users in the first security circle are users in a second security circle and the number of users in the second security circle is greater than or equal to the number of users in the first security circle.
Based on the same application concept, referring to fig. 6, a schematic structural diagram of an electronic device 600 provided in the embodiment of the present application includes: a processor 610, a memory 620 and a bus 630, wherein the memory 620 stores machine-readable instructions executable by the processor 610, when the electronic device 600 is operated, the processor 610 and the memory 620 communicate with each other through the bus 630, and the machine-readable instructions are executed by the processor 610 to perform the steps of the method for determining a risk user as described in any of the above embodiments.
In particular, the machine readable instructions, when executed by the processor 610, may perform the following:
acquiring historical guarantee relationship information of a plurality of users; the plurality of users comprise target users to be determined for guaranteeing the risk;
establishing a guarantee directed graph for representing the guarantee relationship among the users according to the historical guarantee relationship information of the users;
determining at least one guarantee circle for representing that mutual guarantee among users forms a loop according to the guarantee directed graph;
and if the target user belongs to a user in any one guarantee circle in the at least one guarantee circle, determining that the target user is a risk user.
In the embodiment of the application, at least one guarantee ring used for representing guarantee relations among users to form a closed loop is determined by acquiring historical guarantee relation information of a plurality of users and establishing a guarantee directed graph according to the historical guarantee relation information of the plurality of users, and if a target user is in any guarantee ring of the at least one guarantee ring, the target user is determined to be a risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guarantee ring for representing the mutual guarantee forming loop among the users and the risk users can be improved.
Based on the same application concept, the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method for determining a risky user provided in the foregoing embodiments are performed.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for determining a risky user, the method comprising:
acquiring historical guarantee relationship information of a plurality of users; the plurality of users comprise target users to be determined for guaranteeing the risk;
establishing a guarantee directed graph for representing the guarantee relationship among the users according to the historical guarantee relationship information of the users;
determining at least one guarantee circle for representing that mutual guarantee among users forms a loop according to the guarantee directed graph;
and if the target user belongs to a user in any one guarantee circle in the at least one guarantee circle, determining that the target user is a risk user.
2. The method according to claim 1, wherein the establishing a secured directed graph for characterizing secured relationships between the plurality of users based on historical secured relationship information of the plurality of users comprises:
taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to a historical guarantee relationship between any two user nodes in the plurality of user nodes;
and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
3. The method according to claim 1 or 2, wherein the determining at least one guarantee ring for characterizing mutual guarantee loop formation between users according to the guarantee directed graph comprises:
selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge and determining a second user node associated with the first user node through the directed edge according to the role-preserving directed graph;
judging whether the second user node is the starting user node;
if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring;
the first user node and the second user node are any two different user nodes in the plurality of user nodes.
4. The method of claim 1, wherein after said determining at least one warranty circle characterizing the formation of a link warranty loop between users, further comprising:
determining a plurality of users corresponding to each guarantee circle in the at least one guarantee circle;
if the users in the first guarantee ring are the users in the second guarantee ring, and the number of the users in the second guarantee ring is larger than or equal to the number of the users in the first guarantee ring, marking and storing a plurality of users corresponding to guarantee rings except the first guarantee ring in the at least one guarantee ring;
wherein the first and second wagers are any two different wagers of the at least one wagering.
5. An apparatus for determining a risky user, the apparatus comprising:
the acquisition module is used for acquiring historical guarantee relationship information of a plurality of users; the plurality of users comprise target users to be determined for guaranteeing the risk;
the establishing module is used for establishing a guarantee directed graph for representing the guarantee relation among the users according to the historical guarantee relation information of the users;
the first determination module is used for determining at least one guarantee ring for representing mutual guarantee forming loops among users according to the guarantee directed graph;
and the second determination module is used for determining that the target user is a risk user if the target user belongs to a user in any one guarantee circle of the at least one guarantee circle.
6. The apparatus of claim 5, wherein the establishing module is configured to establish the security oriented graph according to the following steps:
taking each user in the plurality of users as a user node in the role-preserving directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes according to a historical guarantee relationship between any two user nodes in the plurality of user nodes;
and generating the load-share directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes.
7. The apparatus according to claim 5 or 6, wherein the first determining module is configured to determine at least one guaranty circle characterizing a mutual guaranty loop between users according to the following steps:
selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated with the initial user node through the directed edge and determining a second user node associated with the first user node through the directed edge according to the role-preserving directed graph;
judging whether the second user node is the starting user node;
if so, determining a closed-loop path formed by the starting user node, the first user node and the second user node as the guarantee ring;
the first user node and the second user node are any two different user nodes in the plurality of user nodes.
8. The apparatus according to claim 5, further comprising, after the first determining module:
a third determining module, configured to determine a plurality of users corresponding to each of the at least one security circle;
the storage module is used for marking and storing a plurality of users corresponding to the guarantee rings except the first guarantee ring in the at least one guarantee ring if the users in the first guarantee ring are the users in the second guarantee ring and the number of the users in the second guarantee ring is larger than or equal to that of the users in the first guarantee ring;
wherein the first and second wagers are any two different wagers of the at least one wagering.
9. An electronic device, comprising: processor, memory and bus, the memory storing machine readable instructions executable by the processor, the processor and the memory communicating via the bus when the electronic device is running, the machine readable instructions when executed by the processor performing the method of determining a risky user according to any one of claims 1 to 4.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when being executed by a processor, performs the method for determining a risky user according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010012264.4A CN111199480B (en) | 2020-01-07 | 2020-01-07 | Method and device for determining risk user |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010012264.4A CN111199480B (en) | 2020-01-07 | 2020-01-07 | Method and device for determining risk user |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111199480A true CN111199480A (en) | 2020-05-26 |
| CN111199480B CN111199480B (en) | 2023-06-16 |
Family
ID=70747158
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010012264.4A Active CN111199480B (en) | 2020-01-07 | 2020-01-07 | Method and device for determining risk user |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111199480B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111784495A (en) * | 2020-06-04 | 2020-10-16 | 江苏常熟农村商业银行股份有限公司 | Guarantee ring identification method and device, computer equipment and storage medium |
| CN113780694A (en) * | 2020-06-10 | 2021-12-10 | 阿里巴巴集团控股有限公司 | Risk assessment method and device and electronic equipment |
| CN113850971A (en) * | 2021-08-20 | 2021-12-28 | 太原市高远时代科技有限公司 | Outdoor equipment abnormity alarm system based on NB-IoT and super capacitor |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010021911A1 (en) * | 2000-03-03 | 2001-09-13 | Hideki Ohmoto | Automatic designing apparatus and method of financial article and recording medium storing financial article automatic designing program therein |
| US20180039962A1 (en) * | 2015-09-09 | 2018-02-08 | Tencent Technology (Shenzhen) Company Limited | Information processing method, terminal and server, and computer storage medium |
| CN107767258A (en) * | 2017-09-29 | 2018-03-06 | 新华三大数据技术有限公司 | Risk of Communication determines method and device |
| CN109508388A (en) * | 2018-11-28 | 2019-03-22 | 交通银行股份有限公司 | A kind of method and apparatus of relational network visualization map |
| CN109922067A (en) * | 2019-03-12 | 2019-06-21 | 深圳华盟工程再担保有限公司 | A kind of big data Intelligent processing system based on guarantee circle |
| CN110209826A (en) * | 2018-02-06 | 2019-09-06 | 武汉观图信息科技有限公司 | A kind of financial map construction and analysis method towards bank risk control |
-
2020
- 2020-01-07 CN CN202010012264.4A patent/CN111199480B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010021911A1 (en) * | 2000-03-03 | 2001-09-13 | Hideki Ohmoto | Automatic designing apparatus and method of financial article and recording medium storing financial article automatic designing program therein |
| US20180039962A1 (en) * | 2015-09-09 | 2018-02-08 | Tencent Technology (Shenzhen) Company Limited | Information processing method, terminal and server, and computer storage medium |
| CN107767258A (en) * | 2017-09-29 | 2018-03-06 | 新华三大数据技术有限公司 | Risk of Communication determines method and device |
| CN110209826A (en) * | 2018-02-06 | 2019-09-06 | 武汉观图信息科技有限公司 | A kind of financial map construction and analysis method towards bank risk control |
| CN109508388A (en) * | 2018-11-28 | 2019-03-22 | 交通银行股份有限公司 | A kind of method and apparatus of relational network visualization map |
| CN109922067A (en) * | 2019-03-12 | 2019-06-21 | 深圳华盟工程再担保有限公司 | A kind of big data Intelligent processing system based on guarantee circle |
Non-Patent Citations (1)
| Title |
|---|
| 田宇: "《商业银行担保圈风险识别与防范研究》", 《中国优秀博硕士学位论文全文数据库（硕士）经济与科学管理辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111784495A (en) * | 2020-06-04 | 2020-10-16 | 江苏常熟农村商业银行股份有限公司 | Guarantee ring identification method and device, computer equipment and storage medium |
| CN111784495B (en) * | 2020-06-04 | 2021-05-04 | 江苏常熟农村商业银行股份有限公司 | Guarantee ring identification method and device, computer equipment and storage medium |
| CN113780694A (en) * | 2020-06-10 | 2021-12-10 | 阿里巴巴集团控股有限公司 | Risk assessment method and device and electronic equipment |
| CN113850971A (en) * | 2021-08-20 | 2021-12-28 | 太原市高远时代科技有限公司 | Outdoor equipment abnormity alarm system based on NB-IoT and super capacitor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111199480B (en) | 2023-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111199480A (en) | Method and device for determining risk user | |
| JP7387781B2 (en) | Systems and methods for implementing deterministic finite automata (DFA) via blockchain | |
| CN113065610B (en) | Isolated forest model construction and prediction method and device based on federal learning | |
| US10147049B2 (en) | Automatic generation of training data for anomaly detection using other user's data samples | |
| JP2018534685A5 (en) | ||
| CN106899648A (en) | A kind of data processing method and equipment | |
| CN111898360A (en) | Text similarity detection method and device based on block chain and electronic equipment | |
| RU96118111A (en) | INFORMATION EXCHANGE SYSTEM WITH PORTABLE DATA PROCESSING UNITS | |
| CN106775714B (en) | Code synchronization method and system | |
| CN112560114B (en) | Method and device for calling intelligent contract | |
| CN111079101A (en) | Method and device for obtaining evidence of infringement based on block chain, electronic equipment and storage medium | |
| US10148740B2 (en) | Multi-service application fabric architecture | |
| US9479454B1 (en) | Modular computer system and method | |
| CN110378154B (en) | File set integrity checking method and device | |
| CN110781410A (en) | Community detection method and device | |
| CN110659212A (en) | Software testing method, device, equipment and medium | |
| CN113327169B (en) | Claims settlement method and device based on block chain and electronic equipment | |
| CN111985644B (en) | Neural network generation method and device, electronic equipment and storage medium | |
| KR20150033041A (en) | Master pattern generation method for checking normal situation of plc based manufacturing system | |
| CN112668889A (en) | Method, device and storage medium for detecting risk user | |
| CN113469658A (en) | Block chain-based physical seal using method and device and electronic equipment | |
| CN111815845B (en) | Shaking method, device, system, equipment and medium based on heterogeneous block chain | |
| CN111355611A (en) | Plan drilling method and device and computer readable storage medium | |
| CN112559072B (en) | Service function starting method and related equipment | |
| CN111600768B (en) | Verification and grouping method and device based on rights and interests certification |
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 |