CN111199480B - Method and device for determining risk user - Google Patents
Method and device for determining risk user Download PDFInfo
- Publication number
- CN111199480B CN111199480B CN202010012264.4A CN202010012264A CN111199480B CN 111199480 B CN111199480 B CN 111199480B CN 202010012264 A CN202010012264 A CN 202010012264A CN 111199480 B CN111199480 B CN 111199480B
- Authority
- CN
- China
- Prior art keywords
- user
- user node
- guaranty
- users
- 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.)
- Active
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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present disclosure relates to the field of big data processing technologies, and in particular, to a method and an apparatus for determining a risk user. According to the method and the system, the historical guaranty relation information of the plurality of users is obtained, the guaranty directed graph is built according to the historical guaranty relation information of the plurality of users, so that at least one guaranty circle used for representing the guaranty relation among the users to form a closed loop is determined, and if the target user is any one guaranty circle in the at least one guaranty circle, 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 guaranty rings used for representing mutual guaranty forming loops 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 are guaranteed mutually or are guaranteed for other borrowers at the same time, chain type guarantee or closed loop guarantee is formed, and the guarantee behavior leads to the rise of systematic loan risks of areas and industries, because as long as one user in a guarantee circle can not repay loans on time, a plurality of loans are formed and simultaneously give out problems, the guarantee chain breakage is probably caused, and the loan risks are amplified in multiple ways, so that the risks of each user in the whole guarantee circle are evolved.
Because the guaranty rings have the characteristics of large scale, complex relationship and the like, the prior art can only identify the guaranty relationship between each user manually, needs to identify the guaranty relationship between a plurality of users layer by layer, and has low efficiency of finding out the guaranty rings used for representing the mutual guaranty between the users to form a loop and risk users in the guaranty rings.
Disclosure of Invention
In view of this, an object of an embodiment of the present application is to provide a method and an apparatus for determining a risk user, by acquiring historical guarantee relation information of a plurality of users and building a guarantee directed graph according to the historical guarantee relation information of the plurality of users, so as to determine at least one guarantee circle for characterizing a guarantee relation between users to form a closed loop, and if a target user is any one of the at least one guarantee circles, determining the target user as the risk user. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guaranty rings used for representing mutual guaranty forming loops 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 determining method includes:
acquiring historical guarantee relation information of a plurality of users; the plurality of users comprise target users for determining the security risk;
establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users;
determining at least one guaranty circle for representing mutual guaranty forming a loop between users according to the guaranty directed graph;
and if the target user belongs to the user in any one of the at least one guarantor rings, determining that the target user is a risk user.
In one possible implementation manner, the establishing a guarantee directed graph for characterizing the guarantee relationship between the plurality of users according to the historical guarantee relationship information of the plurality of users includes:
taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relationship between any two user nodes in the plurality of user nodes;
and generating the guarantee directed graph according to the plurality of user nodes and the directed edges between any two user nodes in the plurality of user nodes.
In a possible implementation manner, the determining at least one guarantee circle for characterizing mutual guarantee forming a loop between users according to the guarantee directed graph 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 according to the guaranteed directed graph, and determining a second user node associated with the first user node through the directed edge;
judging whether the second user node is the initial user node or not;
if yes, determining a closed loop path formed by the initial 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 one possible implementation manner, after the determining at least one guaranty circle for characterizing a guaranty relation between users to form a closed loop, the method further includes:
determining a plurality of users corresponding to each of the at least one guaranty circles;
if the users in the first guaranty ring are the users in the second guaranty ring and the number of the users in the second guaranty ring is greater than or equal to the number of the users in the first guaranty ring, marking and storing a plurality of users corresponding to guaranty rings except the first guaranty ring in the at least one guaranty ring;
wherein the first and second guaranty rings are any two different guaranty rings of the at least one guaranty ring.
In a second aspect, embodiments of the present application further provide a determining apparatus for a risk user, where the determining apparatus includes:
the acquisition module is used for acquiring the history guarantee relation information of a plurality of users; the plurality of users comprise target users for determining the security risk;
the establishing module is used for establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users;
the first determining module is used for determining at least one guarantee circle used for representing mutual guarantee forming loops among users according to the guarantee directed graph;
and the second determining module is used for determining the target user as a risk user if the target user belongs to the user in any one of the at least one guarantor rings.
In a possible implementation manner, the establishing module is configured to establish the guaranteed directed graph according to the following steps:
taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relationship between any two user nodes in the plurality of user nodes;
and generating the guarantee directed graph according to the plurality of user nodes and the directed edges between any two user nodes in the plurality of user nodes.
In a possible implementation manner, the first determining module determines at least one guarantee circle for characterizing mutual guarantee forming a 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 according to the guaranteed directed graph, and determining a second user node associated with the first user node through the directed edge;
judging whether the second user node is the initial user node or not;
if yes, determining a closed loop path formed by the initial 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 one possible implementation manner, 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 guaranty circles;
the storage module is used for marking and storing a plurality of users corresponding to the guaranty rings except the first guaranty ring in the at least one guaranty ring if the users in the first guaranty ring are users in the second guaranty ring and the number of the users in the second guaranty ring is greater than or equal to the number of the users in the first guaranty ring;
wherein the first and second guaranty rings are any two different guaranty rings of the at least one guaranty ring.
In a third aspect, embodiments of the present application further provide an electronic device, including: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory in communication via the bus when the electronic device is running, the machine readable instructions when executed by the processor performing the steps of the method for determining a risk user as described in the first aspect or any of the possible implementation manners of the first aspect.
In a fourth aspect, the embodiments of the present application further provide a computer readable storage medium, on which a computer program is stored, which when executed by a processor performs the steps of the method for determining a risk user described in the first aspect or any of the possible implementation manners of the first aspect.
In the embodiment of the application, the historical guaranty relation information of a plurality of users is obtained, and the guaranty directed graph is built according to the historical guaranty relation information of the plurality of users, so that at least one guaranty circle used for representing the guaranty relation among the users to form a closed loop is determined, and if the target user is any one guaranty circle in the at least one guaranty circle, 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 guaranty rings used for representing mutual guaranty forming loops among the users and the risk users can be improved.
In order to make the above 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 needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart illustrating a method for determining a risk user according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a security ring according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a guaranteed directed graph according to an embodiment of the present disclosure;
FIG. 4 is a schematic structural diagram of a risk user determination device according to an embodiment of the present disclosure;
FIG. 5 is a second schematic structural diagram of a risk user determination device according to an embodiment of the present disclosure;
fig. 6 shows a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it should be understood that the accompanying drawings in the present application are only for the purpose of illustration and description, and are not intended to limit the protection scope of the present application. In addition, it should be understood that the schematic drawings are not drawn to scale. A flowchart, as used in this application, illustrates operations implemented according to some embodiments of the present application. It should be appreciated that the operations of the flow diagrams may be implemented out of order and that steps without logical context may be performed in reverse order or concurrently. Moreover, one or more other operations may be added to the flow diagrams and one or more operations may be removed from the flow diagrams as directed by those skilled in the art.
In addition, the described embodiments are only some, but not all, of the embodiments of the present application. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
It is worth noting that, before the application proposes, since the guaranty rings have the characteristics of large scale, complex relationship and the like, the prior art can only identify the guaranty relationship between each user manually, and needs to identify the guaranty relationship between a plurality of users layer by layer, so that the efficiency of finding out the guaranty rings used for representing the mutual guaranty between users to form loops and risk users in the guaranty rings is low.
In view of the above problems, in the embodiments of the present application, 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, at least one guarantee circle for characterizing a guarantee relation between the users to form a closed loop is determined, and if a target user is any one of the at least one guarantee circle, 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 guaranty rings used for representing mutual guaranty forming loops among the users and the risk users can be improved.
In order to facilitate understanding of the present application, the technical solutions provided in the present application are described in detail below in conjunction with 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 relation information of a plurality of users; the plurality of users includes target users for which the vouch for risk is to be determined.
In the step, the historical vouching information of each user in the plurality of users is obtained, wherein the historical vouching information of each user comprises the relation and the amount vouched by the user to the users except the user, and the relation and the amount vouched by the users are obtained in the plurality of users, wherein the relation and the amount vouch by the users to the user, and the target user of the vouching risk to be determined is contained in the plurality of users.
It should be noted that, the user may be a user, an enterprise, an organization, or any group that can generate a guarantee action.
S102: and establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users.
In the step, a vouching directed graph capable of representing vouching relations among a plurality of users is established according to historical vouching relation information of each user in the plurality of users, wherein each user serves as each user node in the vouching directed graph, and the vouching relations between two users serve as directed line segments in the vouching directed graph.
S103: and determining at least one guaranty circle for representing mutual guaranty forming a loop between users according to the guaranty directed graph.
In the step, at least one guarantee ring of a closed loop formed based on the historical guarantee relation information of a plurality of users is determined among the plurality of users according to the established guarantee directed graph, wherein each guarantee ring comprises at least one user and the guarantee relation among the at least one user.
In an example, referring to fig. 2, fig. 2 is a schematic structural diagram of a guaranty ring provided in an embodiment of the application, in which each user node corresponds to each user, a directed line segment between the user nodes represents a guaranty relationship between the corresponding users, and the guaranty ring shown in fig. 2 is determined according to historical guaranty relationship information between a plurality of users.
S104: and if the target user belongs to the user in any one of the at least one guarantor rings, 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 the target user belongs to one of the determined at least one 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 of the users in the guarantee circle has variation to cause that the guarantee or the repayment cannot be continued, each user in the guarantee circle is affected, and the risk user is affected, so that the risk user is marked and stored, and the subsequent guarantee is warned.
In an example, as shown in fig. 2, assuming that one obtained guaranty circle is shown in fig. 2 and assuming that the target user is user C, in the obtained guaranty circle, the guaranty circle has user a, user B, user C, user D, user E, user F, user G, and user H, and user C is in the guaranty circle, so user C is a risk user.
In the embodiment of the application, the historical guarantee relation information of a plurality of users is obtained, and a guarantee directed graph is built according to the historical guarantee relation information of the plurality of users, so that at least one guarantee circle used for representing the guarantee relation among the users to form a closed loop is determined, and if the target user is any one of the at least one guarantee circle, 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 guaranty rings used for representing mutual guaranty forming loops among the users and the risk users can be improved.
In one possible implementation manner, in S102, the establishing a directed graph for characterizing the vouching relationship between the plurality of users according to the historical vouching relationship information of the plurality of users includes the following steps:
step (1): and taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relation between any two user nodes in the plurality of user nodes.
Step (2): and generating the guarantee directed graph according to the plurality of user nodes and the directed edges between any two user nodes in the plurality of user nodes.
In a specific implementation, a guaranteed graph is generated according to the historical guaranteed relation information among a plurality of users, in the guaranteed graph, each user node corresponds to each user among the plurality of users, and the directed line segments among the user nodes represent the guaranteed relation among the users, so that the guaranteed graph is formed through the plurality of users and the historical guaranteed relation information among the plurality of users.
In an example, assuming that the a user vouches for the B user, the a user and the B user respectively correspond to two nodes in the vouch-for graph, and the directed relationship between the a user node and the B user node is a→b, that is, the user node associated with the directed edge for the a user node is the B user node.
In a possible implementation manner, the determining at least one guarantee circle for characterizing that the guarantee relation between users forms a closed loop in S103 includes the following steps:
step (1): and selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated by the initial user node through the directed edge according to the guaranteed directed graph, and determining a second user node associated by the first user node through the directed edge.
In the step, in the established directed graph, according to personal information of each user, a hash function is used to randomly generate serial numbers of each user node, each user node number is unique, one number represents a node, that is, represents a user, a distributed graph processing framework is used, any one user node in a plurality of user nodes starts, as a starting user node, the user node associated with a directed edge to the starting user node, that is, a first user node sends own numbers, the number of the starting user node is stored in the first user node, and the number of the first user node is stored in the first user node, and then the number of the starting user node and the number of the first user node are transmitted to the first user node associated with the directed edge, that is, a second user node stores the number of the starting user node, the number of the first user node and the number of the second user node, and the number of the second user node indicates more than one user node, the user node indicates the directed edge is always associated with the first user node, the directed edge is not repeatedly transmitted to the relevant user node, and the directed edge is not repeatedly transmitted to the relevant nodes, and the user node is not repeatedly transmitted to the relevant nodes.
In an example, referring to fig. 3, fig. 3 is a schematic structural diagram of a guaranteed graph provided by the embodiment of the present application, numbers of each user node are shown in the diagram, numbers on each node are unique, each number may represent a user corresponding to each node, and it is assumed that, starting from node 1, node 1 transmits its own number to the user node associated with the directed edge, that is, node 2 and node 13, where node 2 stores numbers 1 and 2, node 13 stores numbers 1 and 13, and for node 2, numbers 1 and 2 stored in node 2 are sent to the user node 7 associated with the directed edge, numbers 1, 2 and 7 are stored in node 7, and node 7 sends numbers 1, 2 and 7 to the user node associated with the directed edge, that is, node 8, node 12 and node 14, until no user node can issue in the whole guaranteed graph, and this process of sending numbers is finished.
Step (II): and judging whether the second user node is the initial user node or not.
In the step, the second user node refers to the user node which starts to confirm the directed edge association from the initial user node, then confirms the user node which is associated with the directed edge of the associated user node, repeatedly confirms the user node, and judges whether the second user node is the initial user node or not, namely judges whether the number of the initial user node is transmitted back to the initial user node or not.
Step (III): if yes, determining a closed loop path formed by the initial 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, a closed loop path formed by the first user node and the second user node from the initial user node may be determined as a guarantee ring.
In one example, for starting in node 1, the own number 1 is sent to the user node associated with the directed edge, the path to the receiving again of number 1 is 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, the two closed loop paths are obtained, and each closed loop path is determined as a guarantor ring.
In a possible implementation manner, after determining at least one guarantee circle for characterizing a guarantee relation 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 of the at least one guaranty circles.
Step (b): if the users in the first guaranty ring are the users in the second guaranty ring and the number of the users in the second guaranty ring is greater than or equal to the number of the users in the first guaranty ring, marking and storing a plurality of users corresponding to guaranty rings except the first guaranty ring in the at least one guaranty ring;
wherein the first and second guaranty rings are any two different guaranty rings of the at least one guaranty ring.
In a specific implementation, after determining at least one of the guaranty rings, acquiring a plurality of users corresponding to each of the at least one guaranty ring, comparing the users in each guaranty ring with the users corresponding to other guaranty rings in at least one guaranty ring except the guaranty ring, if all the users with one guaranty ring are among the users corresponding to the other guaranty rings, rejecting the guaranty ring corresponding to less users, acquiring the users corresponding to each guaranty ring in the other guaranty rings, marking and storing the users corresponding to each guaranty ring, so that the users can know the conditions of the users in the guaranty ring when the users want to select the guaranty, and if the users want to select the guaranty ring can play a role in the guaranty ring.
In an example, in the oriented graph shown in fig. 3, starting with node 1, two determined guaranty rings are:
the second guarantor circle: node 1- & gt node 2- & gt node 7- & gt node 12- & gt node 6- & gt node 9- & gt node 15- & gt node 14- & gt node 1;
first guarantor circle: node 1- & gt node 2- & gt node 7- & gt node 14- & gt node 1;
by comparison, nodes in the second guaranty circle are found, and all of the nodes 1, 2, 7 and 14 are in the first guaranty circle, so that the second guaranty circle is removed.
Based on the same application concept, the embodiment of the present application further provides a risk user determining device corresponding to the risk user determining method provided in the foregoing embodiment, and since the principle of solving the problem by the device in the embodiment of the present application is similar to that of the risk user determining method in the foregoing embodiment of the present application, implementation of the device may refer to implementation of the method, and details of repetition are omitted.
Referring to fig. 4, which is one of the schematic structural diagrams of a risk user determining apparatus 400 provided in the embodiment of the present application, referring to fig. 5, which is the second schematic structural diagram of a risk user determining apparatus 400 provided in the embodiment of the present application, as shown in fig. 4 and fig. 5, the risk user determining apparatus 400 provided in the embodiment of the present application includes:
an obtaining module 410, configured to obtain historical vouch-for relationship information of a plurality of users; the plurality of users comprise target users for determining the security risk;
an establishing module 420, configured to establish a guarantee directed graph for characterizing a guarantee relationship between the plurality of users according to the historical guarantee relationship information of the plurality of users;
a first determining module 430, configured to determine, according to the security graph, at least one security circle for characterizing mutual security forming loops between users;
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 guarantor rings.
The present application obtains the historical guaranty relation information of each user through the obtaining module 410 and establishes a guaranty directed graph through the establishing module 420 according to the historical guaranty relation information of each user, so as to determine at least one guaranty circle for characterizing the guaranty relation between the users to form a closed loop according to the first determining module 430, and if the target user belongs to any one of the at least one guaranty circles, the target user is determined to be a risk user through the second determining module 440. Based on the mode, the risk users can be determined, and the work efficiency of identifying the guaranty rings used for representing mutual guaranty forming loops among the users and the risk users can be improved.
In a possible implementation manner, the establishing module 420 is configured to establish the guaranteed digraph according to the following steps:
taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relationship between any two user nodes in the plurality of user nodes;
and generating the guarantee directed graph according to the plurality of user nodes and the directed edges between any two user nodes in the plurality of user nodes.
In one possible implementation manner, the first determining module 430 determines at least one guarantee circle for characterizing mutual guarantees between users to form a loop 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 according to the guaranteed directed graph, and determining a second user node associated with the first user node through the directed edge;
judging whether the second user node is the initial user node or not;
if yes, determining a closed loop path formed by the initial 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 one possible implementation, as shown in fig. 5, after the first determining module 430, the method further includes:
a third determining module 450, configured to determine a plurality of users corresponding to each of the at least one guaranty circles;
and a storage module 460, configured to, if the user in the first guaranty loop is a user in the second guaranty loop, and the number of users in the second guaranty loop is greater than or equal to the number of users in the first guaranty loop, mark and store a plurality of users corresponding to guaranty loops except for the first guaranty loop in the at least one guaranty loop.
Based on the same application concept, referring to fig. 6, a schematic structural diagram of an electronic device 600 provided in an embodiment of the present application includes: a processor 610, a memory 620 and a bus 630, said memory 620 storing machine readable instructions executable by said processor 610, said processor 610 and said memory 620 communicating via said bus 630 when said electronic device 600 is running, said machine readable instructions being executed by said processor 610 to perform the steps of the method of determining a risk user as described in any of the above implementations.
In particular, the machine-readable instructions, when executed by the processor 610, may perform the following:
acquiring historical guarantee relation information of a plurality of users; the plurality of users comprise target users for determining the security risk;
establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users;
determining at least one guaranty circle for representing mutual guaranty forming a loop between users according to the guaranty directed graph;
and if the target user belongs to the user in any one of the at least one guarantor rings, determining that the target user is a risk user.
In the embodiment of the application, the historical guaranty relation information of a plurality of users is obtained, and the guaranty directed graph is built according to the historical guaranty relation information of the plurality of users, so that at least one guaranty circle used for representing the guaranty relation among the users to form a closed loop is determined, and if the target user is any one guaranty circle in the at least one guaranty circle, 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 guaranty rings used for representing mutual guaranty forming loops among the users and the risk users can be improved.
Based on the same application concept, the present embodiment also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the risk user determination method provided in the above embodiment.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown 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 may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in 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 essence or a part contributing to the prior art or a part of the technical solutions, or in the form of a software product, which is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a specific embodiment of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes or substitutions are covered in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (6)
1. A method of determining a risk user, the method comprising:
acquiring historical guarantee relation information of a plurality of users; the plurality of users comprise target users for determining the security risk;
establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users;
determining at least one guaranty circle for representing mutual guaranty forming a loop between users according to the guaranty directed graph;
if the target user belongs to the user in any one of the at least one guarantor ring, determining that the target user is a risk user;
the establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users comprises the following steps:
taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relationship between any two user nodes in the plurality of user nodes;
generating the guarantee directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes;
the determining at least one guaranty circle for characterizing mutual guaranty forming a loop between users according to the guaranty directed graph comprises 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 according to the guaranteed directed graph, and determining a second user node associated with the first user node through the directed edge;
judging whether the second user node is the initial user node or not;
if yes, determining a closed loop path formed by the initial user node, the first user node and the second user node as the guarantee ring;
wherein the first user node and the second user node are any two different user nodes in the plurality of user nodes;
the step of selecting any user node from the plurality of user nodes as an initial user node, determining a first user node associated by the initial user node through the directed edge according to the guaranteed directed graph, and determining a second user node associated by the first user node through the directed edge comprises the following steps:
in the established directed graph, according to personal information of each user, a hash function is used as a key to randomly generate serial numbers of each user node, each user node number is unique, one number represents one node, that is, represents one user, a distributed graph processing framework is used for starting any user node in a plurality of user nodes, the serial numbers are used as the initial user node, the user node with directed edge association to the initial user node, that is, the first user node, the own serial numbers are sent, the serial numbers of the initial user node are stored in the first user node, and the serial numbers of the first user node are transmitted to the first user node with directed edge association to the user node, that is, the second user node stores the serial numbers of the initial user node, the serial numbers of the first user node and the serial numbers of the second user node, that the second user node refers to more than one user node is always associated with the initial user node, that is, the serial numbers of the first user node and the second user node can be repeatedly sent to the relevant user node until the directed edge association is finished, and the serial numbers of the user node can be repeatedly sent to the relevant nodes.
2. The method of determining of claim 1, further comprising, after said determining at least one guaranty circle for characterizing a loop of a linked guaranty between users:
determining a plurality of users corresponding to each of the at least one guaranty circles;
if the users in the first guaranty ring are the users in the second guaranty ring and the number of the users in the second guaranty ring is greater than or equal to the number of the users in the first guaranty ring, marking and storing a plurality of users corresponding to guaranty rings except the first guaranty ring in the at least one guaranty ring;
wherein the first and second guaranty rings are any two different guaranty rings of the at least one guaranty ring.
3. A determination device for a risk user, the determination device comprising:
the acquisition module is used for acquiring the history guarantee relation information of a plurality of users; the plurality of users comprise target users for determining the security risk;
the establishing module is used for establishing a guarantee directed graph for representing the guarantee relation among the plurality of users according to the historical guarantee relation information of the plurality of users;
the first determining module is used for determining at least one guarantee circle used for representing mutual guarantee forming loops among users according to the guarantee directed graph;
the second determining module is used for determining that the target user is a risk user if the target user belongs to the user in any one of the at least one guarantor rings;
the establishing module is configured to establish the guaranteed directed graph according to the following steps:
taking each user in the plurality of users as one user node in the vouching directed graph, and determining a directed edge between any two user nodes in the plurality of user nodes by taking a history vouching relationship between any two user nodes in the plurality of user nodes;
generating the guarantee directed graph according to the plurality of user nodes and directed edges between any two user nodes in the plurality of user nodes;
the first determining module is configured to determine at least one guaranty loop for characterizing mutual guaranty loop formation 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 according to the guaranteed directed graph, and determining a second user node associated with the first user node through the directed edge;
judging whether the second user node is the initial user node or not;
if yes, determining a closed loop path formed by the initial user node, the first user node and the second user node as the guarantee ring;
wherein the first user node and the second user node are any two different user nodes in the plurality of user nodes;
the first determining module is configured to, when selecting any user node from the plurality of user nodes as an initial user node, determine, according to the guaranteed directed graph, a first user node associated with the initial user node by the directed edge, and determine a second user node associated with the first user node by the directed edge, where the first determining module is specifically configured to:
in the established directed graph, according to personal information of each user, a hash function is used as a key to randomly generate serial numbers of each user node, each user node number is unique, one number represents one node, that is, represents one user, a distributed graph processing framework is used for starting any user node in a plurality of user nodes, the serial numbers are used as the initial user node, the user node with directed edge association to the initial user node, that is, the first user node, the own serial numbers are sent, the serial numbers of the initial user node are stored in the first user node, and the serial numbers of the first user node are transmitted to the first user node with directed edge association to the user node, that is, the second user node stores the serial numbers of the initial user node, the serial numbers of the first user node and the serial numbers of the second user node, that the second user node refers to more than one user node is always associated with the initial user node, that is, the serial numbers of the first user node and the second user node can be repeatedly sent to the relevant user node until the directed edge association is finished, and the serial numbers of the user node can be repeatedly sent to the relevant nodes.
4. A determining device according to claim 3, 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 guaranty circles;
the storage module is used for marking and storing a plurality of users corresponding to the guaranty rings except the first guaranty ring in the at least one guaranty ring if the users in the first guaranty ring are users in the second guaranty ring and the number of the users in the second guaranty ring is greater than or equal to the number of the users in the first guaranty ring;
wherein the first and second guaranty rings are any two different guaranty rings of the at least one guaranty ring.
5. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication over the bus when the electronic device is running, the machine-readable instructions when executed by the processor performing the method of determining a risk user according to any one of claims 1 to 2.
6. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, performs the method of determining a risk user according to any of claims 1 to 2.
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 CN111199480A (en) | 2020-05-26 |
| CN111199480B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN113850971B (en) * | 2021-08-20 | 2022-11-01 | 太原市高远时代科技有限公司 | Outdoor equipment abnormity alarm system based on NB-IoT and super capacitor |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (2)
| 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 |
| CN106534228B (en) * | 2015-09-09 | 2020-07-10 | 腾讯科技（深圳）有限公司 | Information processing method, client and server |
-
2020
- 2020-01-07 CN CN202010012264.4A patent/CN111199480B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| 《商业银行担保圈风险识别与防范研究》;田宇;《中国优秀博硕士学位论文全文数据库（硕士）经济与科学管理辑》;20190815;J159-347 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111199480A (en) | 2020-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111199480B (en) | Method and device for determining risk user | |
| CN109063423B (en) | Application software authorization method and system | |
| CN113935469B (en) | Model training method based on decentralized federal learning | |
| CN112534453A (en) | Block chain transaction security | |
| CN109146638B (en) | Method and device for identifying abnormal financial transaction group | |
| EP3763078B1 (en) | Methods of electing leader nodes in a blockchain network using a role-based consensus protocol | |
| WO2016022720A2 (en) | Method and apparatus of identifying a transaction risk | |
| CN104040550A (en) | Integrating security policy and event management | |
| CN110049087A (en) | A kind of reliability verification method, system, device and the equipment of alliance's chain | |
| CN109120643B (en) | Penetration testing method and device | |
| CN113760476B (en) | Task dependency processing method and related device | |
| US10992776B2 (en) | System for offline processing of organizational networks | |
| CN113900598B (en) | Data storage method, device, equipment and storage medium based on block chain | |
| CN110222535B (en) | Processing device, method and storage medium for block chain configuration file | |
| CN113726751A (en) | Weight management method, device and equipment in block chain type account book | |
| CN110378154B (en) | File set integrity checking method and device | |
| US20110047202A1 (en) | Distributed algorithm for changing a shared value | |
| CN113312239B (en) | Data detection method, device, electronic equipment and medium | |
| CN110458541B (en) | Object replacement method and device based on block chain | |
| CN111340623A (en) | Data storage method and device | |
| CN115174596B (en) | Equipment remote copying method, device and medium | |
| CN115470264A (en) | Data auditing method and device, electronic equipment and storage medium | |
| CN112950183B (en) | Cross-chain data interchange method, system, device and electronic equipment | |
| CN114417394A (en) | Block chain-based data storage method, device, equipment and readable storage medium | |
| CN111324368B (en) | Data sharing method and server |
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 |