WO2019196546A1 - Procédé et appareil de détermination de probabilité de risque d'un événement de demande de service - Google Patents

Procédé et appareil de détermination de probabilité de risque d'un événement de demande de service Download PDF

Info

Publication number
WO2019196546A1
WO2019196546A1 PCT/CN2019/073869 CN2019073869W WO2019196546A1 WO 2019196546 A1 WO2019196546 A1 WO 2019196546A1 CN 2019073869 W CN2019073869 W CN 2019073869W WO 2019196546 A1 WO2019196546 A1 WO 2019196546A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
relationship
event
feature
crowd
Prior art date
Application number
PCT/CN2019/073869
Other languages
English (en)
Chinese (zh)
Inventor
王修坤
陈岑
杨新星
Original Assignee
阿里巴巴集团控股有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 阿里巴巴集团控股有限公司 filed Critical 阿里巴巴集团控股有限公司
Publication of WO2019196546A1 publication Critical patent/WO2019196546A1/fr

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
    • G06Q30/00—Commerce
    • G06Q30/018—Certifying business or products
    • 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/02—Banking, e.g. interest calculation or account maintenance
    • 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/08—Insurance
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0635—Risk analysis of enterprise or organisation activities
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking

Definitions

  • One or more embodiments of the present specification relate to the field of computer technology, and more particularly to a method and apparatus for determining a risk probability of a service request event by a computer.
  • risk auditing is often performed manually.
  • some simple rules are also set to assist with manual judgment.
  • such an approach is inefficient and difficult to meet the needs of rapid business development; and the accuracy of identifying high-risk users and high-risk events depends on the experience of the manually audited salesperson, and the differences in the experience of different salesmen. Bringing operational risks, making auditing accuracy difficult to guarantee, often missing.
  • One or more embodiments of the present specification describe a method and apparatus for efficiently determining the risk probability of a service request event.
  • a method of determining a risk probability of a service request event comprising:
  • Determining a risk probability of the service request event according to the event characteristic, the user personal characteristic of the at least one user, and the relationship characteristic of the at least one user.
  • the event feature includes at least one of the following: a requested service amount, a service registration time, an event occurrence time, a time difference between the service registration time and the event occurrence time, and an event occurrence location.
  • the at least one user includes the requestor of the service request event, and the beneficiary of the service request.
  • the user personal characteristics described above include one or more of the following: a user basic attribute feature, a user behavior feature, and a user location feature.
  • the relationship feature vector of the at least one user specifically: acquiring the specific crowd including the at least one user; acquiring a crowd relationship map of the specific crowd; and based on the crowd relationship map, A relationship characteristic of the at least one user is determined.
  • the obtaining the specific group includes, in a plurality of pre-divided subsets of users, determining a subset of users to which the at least one user belongs, and using the subset of users as the specific group; or The at least one user is added to the pre-selected set of users, and the set of users is taken as the specific group of people.
  • acquiring the crowd relationship map of the specific crowd further comprises: acquiring a first relationship map constructed for the pre-selected user set; acquiring an association relationship between the at least one user and the user in the pre-selected user set Adding the association relationship to the first relationship map as a crowd relationship map of the specific population.
  • the population relationship map of the specific population described above is established based on one or more of the following relationships: a transaction relationship, a device relationship, a capital relationship, and a social relationship.
  • determining the relationship characteristics of the user comprises using a node-vector network structure feature extraction algorithm to convert the relationship map into a vector factor, and determining a relationship feature vector of the user based on the vector factor.
  • a risk probability of a business request event is determined using a pre-trained evaluation model that is trained based on a gradient boost decision tree algorithm.
  • an apparatus for determining a risk probability of a service request event includes:
  • An event feature obtaining unit configured to acquire an event feature of the service request event
  • a personal feature obtaining unit configured to acquire a user personal feature of at least one user involved in the service request event
  • a relationship feature acquiring unit configured to determine a relationship feature of the at least one user based on a crowd relationship map of a specific group, wherein the specific group includes the at least one user;
  • the risk determining unit is configured to determine a risk probability of the service request event according to the event feature, the user personal feature of the at least one user, and the relationship feature of the at least one user.
  • a computer readable storage medium having stored thereon a computer program for causing a computer to perform the method of the first aspect when the computer program is executed in a computer.
  • a computing device comprising a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, implementing the method of the first aspect .
  • the risk probability of the service request event is comprehensively determined, thereby making the risk determination more efficient. And accurate.
  • FIG. 1 is a schematic diagram showing an implementation scenario of an embodiment disclosed in the present specification
  • FIG. 2 illustrates a method flow diagram for determining a risk probability of a service request event, in accordance with one embodiment
  • FIG. 3 illustrates a flow of steps for determining a relationship feature of a related user, according to one embodiment
  • Figure 5 shows a schematic block diagram of a risk determining device in accordance with one embodiment.
  • FIG. 1 is a schematic diagram of an implementation scenario of an embodiment disclosed in the present specification.
  • a risk review of a business request event is performed by a computing platform.
  • Users can send business request events to the computing platform, such as applying for a loan, applying for insurance claims, and so on.
  • the computing platform After the computing platform obtains such a business request, it needs to obtain a variety of information to comprehensively evaluate the risk probability of the event.
  • This multifaceted information includes event information for the business request event, as well as the user's personal characteristics of the user involved in the business request event.
  • the computing platform also puts the users involved in the event into a specific group of people to obtain the relationship characteristics of the user in the crowd relationship map. On this basis, based on the above event characteristics, user personal characteristics, and user relationship characteristics, comprehensively assess the risk probability of the business request event.
  • the specific execution process of the above scenario will be described below.
  • the execution body of the method may be any system, device, device, platform or server with computing and processing capabilities, such as the computing platform shown in FIG. 1 , more specifically, for example, various backgrounds that need to analyze and manage business risks.
  • Servers such as Alipay servers, insurance business servers, financial approval servers, etc. As shown in FIG.
  • the method includes the following steps: Step 21: Acquire an event feature of a service request event; Step 22: Acquire a user personal feature of at least one user involved in the service request event; Step 23, based on a specific crowd relationship a map determining a relationship characteristic of the at least one user, wherein the specific group of people includes the at least one user; step 24, according to the event feature, a user profile of the at least one user, and the at least one user A relationship feature that determines a risk probability of the service request event.
  • Step 21 Acquire an event feature of a service request event
  • Step 22 Acquire a user personal feature of at least one user involved in the service request event
  • Step 23 based on a specific crowd relationship a map determining a relationship characteristic of the at least one user, wherein the specific group of people includes the at least one user
  • step 24 according to the event feature, a user profile of the at least one user, and the at least one user A relationship feature that determines a risk probability of the service request event.
  • event characteristics of the service request event to be evaluated are obtained.
  • the business request event to be evaluated may be an event for requesting various businesses that may be at risk, for example, applying for a loan, applying for a credit service, applying for insurance claims, and the like.
  • the event characteristics related to the service request event may include one or more of the following: the requested service type, the requested amount, the time when the request occurred, the service registration time, the time difference between the registration time and the request time, and the event occurrence place. Wait.
  • the foregoing service request event is an event for applying for insurance claims
  • the event characteristics may include: the requested insurance type, the request settlement amount, the application settlement time, the insurance application time, the insurance application time, and the claim time. Time difference, place of occurrence, etc.
  • the service request event is an event for applying for a loan
  • the event feature may include: a request amount, an application time, a registration time, a time difference between the registration time and the application time, a place of occurrence, and the like.
  • the user's personal characteristics of the relevant user involved in the service request event are also obtained.
  • the relevant user involved in the service request event is the service requester.
  • the relevant users involved in the business request event also include other stakeholders other than the requester.
  • the relevant users involved may include a guarantor, etc., in addition to the loan requester.
  • the relevant users involved may include, in addition to the claims claimant, insurance beneficiaries. Therefore, the related user involved in the business request event can be multiple users. For each of the related users involved, at step 22, the user's personal characteristics of these users are obtained.
  • the user's personal characteristics include basic attributes of the user, such as gender, age, registration duration, contact details, and the like.
  • the user personal characteristics include user behavior characteristics. More specifically, the user behavior characteristics may include behavior information related to the user's historical business operations, such as the number of transactions, the average transaction amount, the number of application claims, the number of claims approved, the average claim amount, and the like.
  • the user personal characteristics also include user location characteristics, such as where each historical business operation occurs, a range of location changes, and the like.
  • the user personal characteristics may also include more aspects of the user characteristics. It can be understood that the user's personal characteristics are only dependent on some characteristics of a certain user, characterizing the user's own attribute characteristics, operating characteristics, and the like. According to the embodiment of the present specification, in addition to acquiring the personal characteristics of the individual user, the user is placed in a certain crowd, thereby discovering the relationship characteristics of the user in the crowd relationship network, so as to perform a more comprehensive analysis based on the relationship feature. And assessment.
  • step 23 for each of the related users mentioned in step 22, the relationship characteristics of the respective users are determined based on the crowd relationship map of the specific group, wherein the specific group includes the related users.
  • FIG. 3 illustrates a flow of steps for determining a relationship feature of a related user, ie, a sub-step of step 23, in accordance with one embodiment. As shown in FIG. 3, in order to determine the relationship characteristics of each related user, in step 31, a specific crowd including related users is acquired.
  • a sufficiently large set of users is predetermined such that the set of users contains relevant users of the service request event to be evaluated, and the set of users can then be considered as a specific group of people.
  • the set of users contains relevant users of the service request event to be evaluated, and the set of users can then be considered as a specific group of people.
  • the business request event is an application for insurance claims
  • a collection of all insured persons may be taken as the above specific group.
  • the set of full users is divided into a plurality of subsets of users based on certain characteristics of the user.
  • a subset of users to which the related user related to the service request event belongs is determined, and the subset of users is used as the specific group.
  • a portion of users having certain similarities or associations are pre-selected to form a set of users.
  • the business request event is an application for insurance claims
  • all users who have applied for claims may be pre-selected to form a user set.
  • the above specific population can also be obtained by other means as long as the specific population is included in the relevant user to be analyzed.
  • step 32 a population relationship map of the specific population described above is obtained.
  • the step includes reconstructing a population relationship map for the particular population described above.
  • the particular population is selected from a predetermined set of users, and the system has previously built a crowd relationship map for the set of users.
  • a specific group of people may be selected from a full amount of users, or a subset of users based on a full amount of users, and the system may pre-establish a crowd relationship map for a full amount of users, or establish a subset of each user.
  • the crowd relationship map may be directly obtained, or the part related to the specific crowd may be extracted from the pre-built crowd relationship map for a larger range of users, as the specific population Crowd relationship map.
  • the particular population described above is formed by adding related users to a pre-selected set of users. If the system has constructed a crowd relationship map for the pre-selected set of users, step 32 may include first obtaining a relationship map constructed for the pre-selected set of users; obtaining the user in the related user and the pre-selected set of users The association relationship; then, the above relationship is added to the above relationship map as a population relationship map of the specific group.
  • the construction of crowd relationship maps can be based on multiple relationships.
  • the crowd relationship map is established based on the trading relationship of the crowd. For example, if a product purchase transaction is reached between two users, a transaction association is established between the two users.
  • the transaction relationship between users can be determined by acquiring and analyzing the transaction records of a large number of users, thereby establishing a crowd relationship map.
  • the crowd relationship map is established based on the device relationship of the crowd. For example, when two or more user accounts log in using the same terminal device, it can be determined that there is a device association between the two or more user accounts. There are two or more user accounts associated with the device, which may be multiple accounts registered by the same entity user, or may be accounts corresponding to multiple users who have close associations (such as family members, colleagues, etc.). The device relationship can be determined by obtaining the entity terminal information corresponding to the user when logging in to the account.
  • the crowd relationship map is established based on the funding relationship. For example, when there is a fund transfer operation such as transfer, collection, etc. between two users, a fund association is established between the two users.
  • the relationship between the users can be determined by obtaining and analyzing the records of the user's operation using the electronic wallet, and then the relationship map is established based on the capital relationship.
  • the crowd relationship map is established based on social relationships.
  • people are increasingly using social applications to interact. For example, two users can interact through social applications such as chatting, red packets, file transfer, etc., so that social connections can be established between the two users.
  • a social relationship between the crowds can be determined based on a large number of social interactions captured by the social application, thereby establishing a crowd relationship map.
  • a population relationship map can also be established based on a greater variety of population associations. Moreover, the population relationship map can be established based on several kinds of population associations at the same time.
  • the crowd relationship map can be formed in the form of a network of nodes.
  • the crowd relationship map includes a plurality of nodes, each node corresponding to one user, and the nodes having the associated relationship are connected to each other.
  • the connections between the nodes may have various attributes, such as connection type, connection strength, etc., where the connection types include, for example, a capital connection (a connection based on a capital relationship), a social connection (a social interaction based connection) Etc.), the connection strength can also include, for example, strong connections, weak connections, and the like.
  • Figure 4 illustrates an example of a crowd relationship map in accordance with one embodiment.
  • the crowd relationship map includes a plurality of nodes, and each node corresponds to one user.
  • the connection between nodes indicates that there is an association between users. It is assumed that the crowd relationship map of FIG. 4 is established based on the capital relationship and social relationship of the crowd. Accordingly, the connection between the nodes can be a capital connection or a social connection.
  • different connection types are shown in different line types, that is, the social connections between the nodes are shown in broken lines, and the capital connections between the nodes are shown in solid lines. Also, the strength of the connection is shown by the thickness of the connecting line.
  • thick lines show strong connections and thin lines show weak connections. More specifically, the thick solid line may show a stronger capital connection (eg, the capital interaction exceeds a threshold value of $10,000, for example, 10,000 yuan), and the thin line shows a weaker fund connection (eg, the capital interaction does not exceed the above amount) Threshold); thick dashed lines may show strong social connections (eg, the frequency of interactions exceeds a frequency threshold, eg 10 times per day), thin dotted lines show weaker social connections (eg, the frequency of interaction does not exceed the above frequency threshold) ).
  • the crowd relationship map may also be characterized in other forms, such as forms, graphics, and the like.
  • step 33 based on the acquisition of the population relationship map constructed for a specific population, in step 33, based on the crowd relationship map, the relationship characteristics of the relevant users involved in the current event are determined.
  • connection related to the user such as the number of connections, the type of connection, the strength of the connection, and other connected to, may be extracted from the crowd relationship map.
  • the user, etc. takes such a connection feature as a relationship feature of the user.
  • a crowd learning map is analyzed and characterized using a machine learning aid.
  • the crowd relationship map can be understood as a network that contains a certain number of nodes (corresponding to users) and the connection relationship between nodes (the relationship between users).
  • network information is more difficult to structure into standard data, so it is difficult to apply to machine learning.
  • network representation learning algorithms have been proposed to characterize and analyze network structures. The goal of these algorithms is to represent nodes with semantic relationships in the network with low-dimensional, dense, real-valued vectors, which facilitates computational storage without the need to manually extract features and project heterogeneous information into the same low-dimensional space. For easy downstream calculations.
  • the network is embedded into a geometric space, and the spatial coordinates of each node are regarded as the characteristics of the node, so that they are put into the neural network for learning and training.
  • the map can be mapped into the geometric space, and the spatial coordinates of each user node are calculated as the relationship feature vector.
  • various algorithms can be employed for the calculation of the spatial coordinates of the network nodes.
  • the DeepWalk algorithm is used to determine a vector representation of each node in the network corresponding to the population relationship map.
  • the DeepWalk algorithm a large number of random walk particles are released on the network, and these particles will go out of a sequence of nodes in a given time. If a node is treated as a word, the resulting sequence constitutes a sentence, and thus a "language" in which the node is composed of a sequence can be obtained. Then, using the word vector conversion (Word2Vec) algorithm, a vector representation of each word "word" can be calculated.
  • Word2Vec word vector conversion
  • a node-vector (node2vec) structural feature extraction algorithm is employed to convert the population relationship map into a form of a vector factor.
  • the Node2vec node-vector structure feature extraction algorithm improves the random walk strategy in DeepWalk, achieving a balance between Depth-First Search (DFS) and Breadth-First Search (BFS).
  • DFS Depth-First Search
  • BFS Breadth-First Search
  • the user node in the crowd relationship map can be converted into a form of vector representation, so that the vector expression of the user involved in the current event in the crowd relationship map can be determined as its relationship feature vector.
  • relationship feature vector of the current event related to the user from the crowd relationship map.
  • the dimensions and elements of the obtained relationship feature vectors will be different.
  • the relationship feature vector comprehensively represents the relationship between the user and other users in the crowd relationship network by characterizing the position of the node corresponding to the user in the crowd relationship map and the connection relationship with other nodes.
  • step 24 Based on the event characteristics acquired in step 21, the user personal characteristics acquired in step 22, and the user relationship characteristics acquired in step 23 as described above, in step 24, the above various features are combined to determine the risk probability of the service request event.
  • determining a first evaluation score of the service request event based on the event feature determining a second evaluation score of the service request event based on the user personal characteristic; determining a third evaluation score of the service request event based on the user relationship feature
  • the first, second, and third evaluation scores are weighted and summed to determine the risk probability score of the service request event.
  • the manner in which the first, second, and third evaluation scores are determined may be performed by a pre-trained model algorithm and model parameters.
  • both the user personal characteristics and the user relationship features are represented in the form of a vector.
  • the feature vector of the user's personal feature and the feature vector of the user relationship feature are first spliced to obtain a user integrated feature. Then, based on the user comprehensive feature, determining a first evaluation score of the service request event, determining a second evaluation score of the event based on the event feature of the service request event, and finally determining a service request event based on the first and second evaluation scores Risk probability score.
  • the manner in which the first and second evaluation scores are determined may be performed by a pre-trained model algorithm and model parameters.
  • an evaluation model is pre-trained that evaluates the risk probability of a business request event based directly on event characteristics, user personal characteristics, and user relationship characteristics. It will be appreciated that the evaluation model is based on training data sets that have been calibrated.
  • the event characteristics of the event are acquired, and the user involved in the event User personal characteristics.
  • the user will be involved in the crowd to obtain the relationship characteristics of the user in the crowd relationship map, especially the relationship feature vector. Add the above data to the training data set.
  • the model algorithm and model parameters can be used, and the risk probability of the event is determined based on the event characteristics, the user's personal characteristics and the user relationship characteristics in the training data set, and the risk probability of an event is obtained. Then, based on the obtained risk probability and the actual known risk probability of the event (ie, the loss function), the model algorithm and the model parameters are continuously optimized, thereby training the above evaluation model.
  • the above evaluation model can employ a variety of specific model algorithms.
  • the above evaluation model is trained using a Gradient Boosting Decision Tree (GBDT) method.
  • GBDT Gradient Boosting Decision Tree
  • the gradient boost decision tree GBDT method is a supervised method of integrated learning.
  • the integrated learning method a plurality of learners are used to separately learn the training sample set, and the final model is a synthesis of the above plurality of learners.
  • the two main methods of integrated learning are Bagging and Boosting.
  • the Boosting algorithm there are sequential orders between learners, and they have different weights. At the same time, weights are assigned to each sample. Initially, each sample has the same weight. After learning the training sample with a certain learner, the weight of the wrong sample is increased, the weight of the correct sample is reduced, and then the subsequent learner is used to learn.
  • the final prediction is the combination of multiple learner results.
  • gradient model can be used to optimize the model function based on the prediction result. This method is called Gradient Boost method.
  • each base learner uses the classification regression tree algorithm to form the gradient decision tree GBDT model.
  • the classification regression tree algorithm is a binary learning machine learning algorithm.
  • the accuracy and coverage of the model are more effective.
  • a plurality of learners using a classification regression tree can be trained for various features, including event features, user personal features, and user relationship features, thereby forming the above-described evaluation model.
  • the above evaluation model may also be implemented by other algorithms, such as the aforementioned bagging algorithm in integrated learning, a learner using other algorithms, and the like.
  • the evaluation model can be directly used to determine the risk probability of the current business request event.
  • the risk probability of the service request event can be comprehensively evaluated, thereby controlling the business execution risk more efficiently and accurately.
  • FIG. 5 shows a schematic block diagram of a risk determining device in accordance with one embodiment.
  • the risk determining apparatus 500 includes: an event feature acquiring unit 510 configured to acquire an event feature of a service request event; and a personal feature obtaining unit 520 configured to acquire at least one user involved in the service request event.
  • the relationship feature obtaining unit 530 is configured to determine a relationship feature of the at least one user based on a crowd relationship map of a specific group, wherein the specific group includes the at least one user; and the risk determining unit 540 is configured to The event feature, the user profile of the at least one user, and the relationship feature of the at least one user determine a risk probability of the service request event.
  • the event feature acquired by the event feature acquiring unit 510 includes at least one of the following: a request for a business amount, a service registration time, an event occurrence time, a time difference between a service registration time and an event occurrence time, and an event occurrence location.
  • At least one user involved in the service request event includes a requestor of the service request event, and a beneficiary of the service request.
  • the personal characteristics of the user acquired by the personal feature acquisition unit 520 include one or more of the following: a user basic attribute feature, a user behavior feature, and a user location feature.
  • the relationship feature obtaining unit 530 includes: a crowd obtaining module 531 configured to acquire a specific crowd including the at least one user; and a map acquiring module 532 configured to acquire a crowd relationship map of the specific crowd; The obtaining module 533 is configured to determine a relationship feature of the at least one user based on the crowd relationship map.
  • the crowd obtaining module 531 is configured to determine, in a plurality of pre-divided subsets of users, a subset of users to which the at least one user belongs, and use the subset of users as the specific group.
  • the crowd acquisition module 531 is configured to add the at least one user to a pre-selected set of users, the set of users being the particular group of people.
  • the map acquisition module 532 is configured to: acquire a first relationship map constructed for the pre-selected user set; and acquire the at least one user and the user in the pre-selected user set An association relationship is added to the first relationship map as a crowd relationship map of the specific group of people.
  • a population relationship map for a particular population is established based on one or more of the following relationships: transaction relationships, device relationships, funding relationships, social relationships.
  • the relationship feature obtaining unit 530 is configured to: convert the relationship map into a vector factor by using a node-vector network structure feature extraction algorithm, and determine a relationship feature vector of the at least one user based on the vector factor .
  • the risk determination unit 540 is configured to determine a risk probability of the service request event using a pre-trained evaluation model that is trained based on a gradient boost decision tree algorithm.
  • the event characteristics, the user's personal characteristics and the user relationship characteristics of a service request event are integrated, and the risk probability of the service request event is comprehensively evaluated, thereby controlling the business execution risk more efficiently and accurately.
  • a computer readable storage medium having stored thereon a computer program for causing a computer to perform the method described in connection with FIG. 2 when the computer program is executed in a computer.
  • a computing device comprising a memory and a processor, the memory storing executable code, and when the processor executes the executable code, implementing the method described in connection with FIG. 2 method.
  • the functions described herein can be implemented in hardware, software, firmware, or any combination thereof.
  • the functions may be stored in a computer readable medium or transmitted as one or more instructions or code on a computer readable medium.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Accounting & Taxation (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Technology Law (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé et un appareil permettant de déterminer la probabilité de risque d'un événement de demande de service, le procédé consistant : à acquérir des caractéristiques d'événement d'un événement de demande de service (21) ; à acquérir des caractéristiques personnelles d'utilisateur de l'utilisateur auquel se rapporte l'événement de demande de service (22) ; en fonction d'un graphe de relations de population en fonction d'une population spécifique, à déterminer des caractéristiques de relation d'utilisateur (23) ; et, en fonction des caractéristiques d'événement, des caractéristiques personnelles d'utilisateur et des caractéristiques de relations d'utilisateur, à déterminer la probabilité de risque de l'événement de demande de service (24). Ainsi, le risque de l'événement de demande de service peut être évalué de manière globale.
PCT/CN2019/073869 2018-04-12 2019-01-30 Procédé et appareil de détermination de probabilité de risque d'un événement de demande de service WO2019196546A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810327337.1 2018-04-12
CN201810327337.1A CN108399509A (zh) 2018-04-12 2018-04-12 确定业务请求事件的风险概率的方法及装置

Publications (1)

Publication Number Publication Date
WO2019196546A1 true WO2019196546A1 (fr) 2019-10-17

Family

ID=63100004

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/073869 WO2019196546A1 (fr) 2018-04-12 2019-01-30 Procédé et appareil de détermination de probabilité de risque d'un événement de demande de service

Country Status (3)

Country Link
CN (1) CN108399509A (fr)
TW (1) TW201944305A (fr)
WO (1) WO2019196546A1 (fr)

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108399509A (zh) * 2018-04-12 2018-08-14 阿里巴巴集团控股有限公司 确定业务请求事件的风险概率的方法及装置
CN109377347B (zh) * 2018-09-27 2020-07-24 深圳先进技术研究院 基于特征选择的网络信用预警方法、系统及电子设备
CN109636564A (zh) * 2018-10-16 2019-04-16 平安科技（深圳）有限公司 用于风控的信息核实方法、装置、设备及存储介质
CN109636083A (zh) * 2018-10-16 2019-04-16 深圳壹账通智能科技有限公司 黑名单分析方法、装置、设备及计算机可读存储介质
CN109636565A (zh) * 2018-10-16 2019-04-16 深圳壹账通智能科技有限公司 风险数据的处理方法、装置、设备及计算机可读存储介质
CN109559192A (zh) * 2018-10-25 2019-04-02 深圳壹账通智能科技有限公司 基于关联图谱的风险检测方法、装置、设备及存储介质
CN110033151B (zh) * 2018-11-09 2024-01-19 创新先进技术有限公司 关系风险评价方法、装置、电子设备及计算机存储介质
CN109657917B (zh) * 2018-11-19 2022-04-29 平安科技（深圳）有限公司 评估对象的风险预警方法、装置、计算机设备和存储介质
CN109598513B (zh) * 2018-11-22 2023-06-20 创新先进技术有限公司 一种风险识别方法和装置
CN110046784A (zh) * 2018-12-14 2019-07-23 阿里巴巴集团控股有限公司 一种用户准入的风险确定方法及装置
CN109685647B (zh) * 2018-12-27 2021-08-10 阳光财产保险股份有限公司 信贷欺诈检测方法及其模型的训练方法、装置和服务器
CN109801077A (zh) * 2019-01-21 2019-05-24 北京邮电大学 一种套现用户检测方法、装置及设备
CN109919782A (zh) * 2019-01-24 2019-06-21 平安科技（深圳）有限公司 关联案件识别方法、电子装置及计算机可读存储介质
CN110009511A (zh) * 2019-01-29 2019-07-12 阿里巴巴集团控股有限公司 套利行为识别方法、套利行为识别模型训练方法及系统
CN110008349B (zh) * 2019-02-01 2020-11-10 创新先进技术有限公司 计算机执行的事件风险评估的方法及装置
CN110084468B (zh) * 2019-03-14 2020-09-01 阿里巴巴集团控股有限公司 一种风险识别方法及装置
CN110097450A (zh) * 2019-03-26 2019-08-06 中国人民财产保险股份有限公司 车贷风险评估方法、装置、设备和存储介质
CN110111195A (zh) * 2019-04-04 2019-08-09 平安科技（深圳）有限公司 基于数据分析的账款催收方法及装置、电子设备
CN110599329A (zh) * 2019-09-09 2019-12-20 腾讯科技（深圳）有限公司 信用评估方法、信用评估装置及电子设备
CN110544100A (zh) * 2019-09-10 2019-12-06 北京三快在线科技有限公司 基于机器学习的业务识别方法、装置及介质
CN111198967B (zh) * 2019-12-20 2024-03-08 北京淇瑀信息科技有限公司 基于关系图谱的用户分组方法、装置及电子设备
CN111291900A (zh) * 2020-03-05 2020-06-16 支付宝(杭州)信息技术有限公司 训练风险识别模型的方法及装置
CN111798092B (zh) * 2020-05-27 2024-03-12 深圳奇迹智慧网络有限公司 海关查验监控方法、装置、计算机设备和存储介质
TW202147207A (zh) * 2020-06-08 2021-12-16 財團法人資訊工業策進會 風險檢測系統與風險檢測方法
CN114912717B (zh) * 2022-07-13 2022-10-25 成都秦川物联网科技股份有限公司 基于物联网的智慧城市保障住房申请风险评估方法和系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106469376A (zh) * 2015-08-20 2017-03-01 阿里巴巴集团控股有限公司 一种风险控制方法和设备
CN107679686A (zh) * 2017-08-28 2018-02-09 阿里巴巴集团控股有限公司 一种业务执行方法及装置
CN107741953A (zh) * 2017-09-14 2018-02-27 平安科技（深圳）有限公司 社交平台用户的现实关系匹配方法、装置及可读存储介质
CN107818513A (zh) * 2017-11-24 2018-03-20 泰康保险集团股份有限公司 风险评估方法及装置、存储介质、电子设备
CN108399509A (zh) * 2018-04-12 2018-08-14 阿里巴巴集团控股有限公司 确定业务请求事件的风险概率的方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106469376A (zh) * 2015-08-20 2017-03-01 阿里巴巴集团控股有限公司 一种风险控制方法和设备
CN107679686A (zh) * 2017-08-28 2018-02-09 阿里巴巴集团控股有限公司 一种业务执行方法及装置
CN107741953A (zh) * 2017-09-14 2018-02-27 平安科技（深圳）有限公司 社交平台用户的现实关系匹配方法、装置及可读存储介质
CN107818513A (zh) * 2017-11-24 2018-03-20 泰康保险集团股份有限公司 风险评估方法及装置、存储介质、电子设备
CN108399509A (zh) * 2018-04-12 2018-08-14 阿里巴巴集团控股有限公司 确定业务请求事件的风险概率的方法及装置

Also Published As

Publication number Publication date
TW201944305A (zh) 2019-11-16
CN108399509A (zh) 2018-08-14

Similar Documents

Publication Publication Date Title
WO2019196546A1 (fr) Procédé et appareil de détermination de probabilité de risque d'un événement de demande de service
TWI712981B (zh) 風險辨識模型訓練方法、裝置及伺服器
WO2020253358A1 (fr) Procédé de traitement d'analyse de contrôle de risques de données de service, appareil et dispositif informatique
WO2021114974A1 (fr) Appareil et procédé d'évaluation de risques d'utilisateur, dispositif électronique et support d'enregistrement
US11257041B2 (en) Detecting disability and ensuring fairness in automated scoring of video interviews
US11403643B2 (en) Utilizing a time-dependent graph convolutional neural network for fraudulent transaction identification
US11531987B2 (en) User profiling based on transaction data associated with a user
US11804302B2 (en) Supervised machine learning-based modeling of sensitivities to potential disruptions
CN111553701A (zh) 一种基于会话的风险交易确定方法和装置
US11538029B2 (en) Integrated machine learning and blockchain systems and methods for implementing an online platform for accelerating online transacting
US20230237583A1 (en) System and method for implementing a trust discretionary distribution tool
CN114202336A (zh) 一种金融场景下的风险行为监测方法及系统
CN112016850A (zh) 业务评估方法以及装置
CN115034886A (zh) 一种违约风险预测方法及装置
CN113887214A (zh) 基于人工智能的意愿推测方法、及其相关设备
CN113408627A (zh) 目标对象的确定方法、装置和服务器
US20240161117A1 (en) Trigger-Based Electronic Fund Transfers
CN117437020A (zh) 商户风险判定方法、装置、电子设备和介质
CN112446777A (zh) 一种信用评估方法、装置、设备及存储介质
US20230267352A1 (en) System, Method, and Computer Program Product for Time Series Based Machine Learning Model Reduction Strategy
CN110362981B (zh) 基于可信设备指纹判断异常行为的方法及系统
Shaik et al. Customer loan eligibility prediction using machine learning
CN113886539A (zh) 话术推荐方法、装置、客服设备及存储介质
CN111178535A (zh) 实现自动机器学习的方法和装置
US20240152959A1 (en) Systems and methods for artificial intelligence using data analytics of unstructured data

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19785519

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19785519

Country of ref document: EP

Kind code of ref document: A1