Data fusion method based on distributed encryption calculation
Through the data fusion method of distributed encryption computing, the problem of passive update, split training and data exchange in distributed model training is solved, and efficient and secure financial product recommendation model training is achieved, improving recommendation efficiency and accuracy.
Patent Information
- Application Number
- CN202411580434.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-07
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-11-07
AI Technical Summary
The existing distributed model training methods have problems such as passive model update, split training and data exchange insecure, complex and time-consuming model fusion, resulting in low efficiency and insufficient security in financial product recommendation model training.
The data fusion method based on distributed encryption computing is adopted, and the supervision node monitors intended customer samples, constructs iterative samples and recommended index prediction models, realizes local model updates and encrypted data exchanges, and ensures security with dynamically changing keys.
It improves the efficiency and security of model training, reduces the number of model iterations and the complexity of data transmission, and ensures the accuracy and efficiency of financial product recommendations.
Smart Images

Figure CN119089480A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of data analysis, and in particular to a data integration method based on distributed encryption computing. Background Art
[0002] Machine learning has been widely used in the fields of corporate customer recommendation due to its good data feature mining, nonlinear data analysis and processing capabilities. The process of banks recommending financial products to corporate customers using machine learning methods is mainly as follows: banks obtain data from corporate customers who have purchased the financial product in the past through multiple channels, including corporate operating data, corporate credit information, etc., and then use the acquired data to profile the characteristics of these customers, such as analyzing the contribution of each customer feature to the decision to purchase the financial product, so as to establish a mapping relationship between customer data and the financial product to determine whether to purchase, and form a financial product recommendation model. Finally, the model predicts the input customer sample and outputs the financial product to be recommended.
[0003] In order to increase the security of data exchange and improve the ability to analyze and process large amounts of data, existing methods usually use distributed encryption computing and analysis methods for model training. Taking financial product recommendation as an example, in the existing method, the bank sends model training parameters to each local enterprise end, and the enterprise trains the model based on its own customer data on the local end according to the sent parameters, and then transmits the trained model to the bank end through some encryption algorithm exchange; the bank end evaluates the performance of the models uploaded by each local end, and if the evaluation fails, the parameters are updated and sent, and the local end is instructed to retrain, or if the evaluation passes, the models trained by each local end are merged into a comprehensive model.
[0004] The above distributed model training method has the following technical problems: 1. The local end is "passive" in model update training. Each time, the performance evaluation results of the model on the bank end are required as instructions. It is also very troublesome for the bank to perform performance evaluation on the models trained by each local end at each moment. 2. The model training process of each local end is "fragmented". Each local end performs model training based on its own local data. Even if there are some methods in the existing methods to exchange and transmit data between local ends through encryption technology, the fixed encryption algorithm or the fixed key in the encryption algorithm may be cracked, and the data exchange transmission is not necessarily safe. When the number of local ends that need to exchange data is large, the exchange transmission will affect the efficiency of model training; 3. The bank integrates the models trained on each local side into a comprehensive model in order to make up for the insufficient performance of the models trained on each local side due to the "fragmented" training of single data. However, the model fusion process is usually a complex process, time-consuming and labor-intensive, and the fusion effect needs further verification. The distributed architecture will greatly increase the difficulty of training the overall financial product recommendation model, and does not really bring into play the efficiency advantage of distributed computing. Summary of the invention
[0005] The present invention aims to provide a financial product recommendation method with distributed data analysis and processing capabilities and high data exchange and transmission security, and provides a data financing method based on distributed encryption computing.
[0006] To achieve this object, the present invention adopts the following technical solutions: A data financing method based on distributed encryption computing is provided. The financing system includes a plurality of distributed encryption computing chains respectively associated with financial products of specified types. The method for data financing of each distributed encryption computing chain includes the following steps: L1, judging based on the supervision node exist Customer samples of new customers suspected of purchasing designated types of financial products monitored at all times, and the regulatory nodes specified in the instructions of the server-side data financing device Is the node that is connected and successfully connected the corresponding Regulatory nodes at the moment , If so, the server-side data integration device instructs the supervision node structure The iterative sample corresponding to the moment, and through the supervision node Instructions for monitoring nodes Construct iterative sample construction based on data and transmission The recommendation index prediction model is updated at all times, and then the process goes to step L2; If not, the server-side data integration device passes the supervision node Instructions for monitoring nodes and correspondence Regulatory nodes at the moment Provide prediction data exchange to the supervisory node in parallel , then go to step L2; L2, the supervisory node The iterative sample construction basis data and the recommendation index prediction model are exchanged and transmitted to the supervision node ; or the supervisory node , the supervisory node The prediction is transmitted to the supervisory node based on data exchange respectively ; L3, the supervisory node After updating the recommendation index prediction model based on the exchanged iterative samples, the financial product recommendation results are predicted and output for the newly monitored potential customers, or the financial product recommendation results are directly output based on the prediction data and sent to the server-side data integration device, and the communication connection between the supervision nodes is released after the financial product recommendation results are output.
[0007] Preferably, in step L1, the server-side data integration device instructs the supervision node Connect the supervisory node The method is: Determine the supervisory node exist The customer samples and the supervision nodes monitored at all times Whether at least one element in the uploaded sample calibration set has feature similarity, If so, instruct the supervisory node Connect the supervisory node ; If not, instruct the supervisory node At the same time, connect to the supervisory node and the supervisory node .
[0008] Preferably, in step L1, the supervisory node Successfully connected to the supervisory node The method is: Parse the server-side data integration device to instruct the supervision node Instruct it to connect to the supervisory node The first key carried in the first instruction includes the supervisory node exist At least one iteration sample constructed at the moment is related to the supervisory node exist The replacement relationship of the template samples generated at the moment, and / or the recommendation index correction coefficient corresponding to at least one of the iterative samples; Carrying the first key to the supervisory node Initiate a first connection request, the supervisory node After verifying the first key carried in the first connection request, the supervisory node A communication connection is established.
[0009] Preferably, the iterative sample construction is based on data for the supervisory node The updated customer multi-type feature data graph template, the updating method includes the following steps: A1, filter out Compare model updates at all times Always update the difference samples of the training samples used by the model; A2, converting each feature element in each type of feature array in each of the difference samples into a corresponding color feature, and obtaining the feature element in The first template color comprehensive feature in the first customer multi-type feature data graph template bound at the moment; A3, calculating the average value of the color feature of each feature element in each difference sample and the first template color comprehensive feature, as the average value of the color feature of each feature element in each difference sample The second template color comprehensive features in the second customer multi-type feature data graph template are updated at all times.
[0010] Preferably, the supervisory node Successfully connected to the supervisory node The method is: Parse the server-side data integration device to instruct the supervision node Instruct it to connect to the supervisory node The second key carried in the second instruction includes the supervisory node Compare with Regulatory nodes at the moment The second template color comprehensive feature of at least one characteristic element in the monitored difference sample, and / or the supervision node The updated recommendation index prediction model predicts and outputs a recommendation index for at least one template sample; Carry the second key to the supervisory node Initiate a second connection request, the supervisory node After verifying the second key carried in the second connection request, the supervisory node A communication connection is established.
[0011] Preferably, the prediction basis data includes the supervision node The generated correction sample set, the recommended index correction coefficient associated with each iterative sample in the correction sample set, and the supervision node The trained recommendation index prediction model predicts the recommendation index of each template sample.
[0012] Preferably, the replacement relationship as the first key is generated by the following method: From the supervisory node Update the customer multi-type feature data graph template based on each template sample, which is the supervision node Each iterative feature array in the constructed iterative sample data set specifies the corresponding template sample; The iteration feature array is replaced with a template feature array of the same type in the specified template sample, and the template sample after replacement is modified to be an iteration sample having the iteration feature array.
[0013] Preferably, the recommended index correction coefficient serving as the first key is calculated by the following method: When it is determined that the absolute value of the difference between the sample characteristic value deviation associated with the iteration sample and the recommendation index prediction deviation is less than a preset difference threshold, the recommendation index prediction deviation corresponding to the iteration sample is used as the recommendation index correction coefficient corresponding to the iteration sample; The sample feature value deviation is: the array feature value deviation between the iteration feature array and the template sample array having a replacement relationship; The recommendation index prediction deviation is: using the supervision node The deviation between the intention recommendation index for the specified type of financial product predicted and output by the trained recommendation index prediction model for the iterative sample and the template recommendation index predicted and output by the same recommendation index prediction model for the template sample with a replacement relationship.
[0014] Preferably, the supervisory node The method for generating the calibration sample set comprises the steps of: S1, using the supervisory node A customer multi-type feature data graph template constructed or updated for a specified type of financial product, for the regulatory node The obtained multi-type feature data of each suspected customer who is suspected of intending to purchase the specified type of financial product is pre-processed to obtain the supervision node Iterative sample data set; S2, according to the supervisory node The iterative sample data set constructs the supervision node Performing iterative samples of the model iteration, and calculating the recommended index correction coefficient corresponding to each of the iterative samples; S3, according to the supervisory node Each of the constructed iterative samples updates the supervisory node The recommended index prediction model is trained, and then the correctness of the recommended index correction coefficient associated with each iterative sample added to the sample set to be corrected is verified by using the updated model, and each iterative sample that passes the verification is added to the supervision node The bound calibration sample set.
[0015] Preferably, in step S1, the method for preprocessing the multi-type feature data of each of the suspected potential customers comprises the steps of: B1, for the supervisory node For each new sample monitored, a corresponding multi-type feature data graph of potential customers is constructed using the following construction method: Convert each feature element in each type of feature array in the newly added sample into a corresponding color feature, and then assign it to a specified pixel position of each feature element in the preset empty image; B2, for each pixel site in the multi-type feature data graph of the intended customer belonging to the same type of feature array, determine whether it is an unchanged pixel site one by one, and calculate the ratio of the number of the unchanged pixel sites to the total number of assigned pixel sites in the feature array to which it belongs; B3: When it is determined that the ratio is less than a preset ratio threshold, the feature array is added as a construction unit to the iterative sample data set.
[0016] The present invention has the following beneficial effects: 1. Just need to build , , , These four time points correspond to four regulatory nodes. The supervision node corresponding to the moment After monitoring the newly added potential customers, it is only necessary to determine the supervisory node to which the server data integration device instructs it to connect. When the recommendation index prediction model is updated locally, the bank does not need to evaluate the performance of the model, nor does it need to integrate the local training models. This makes model training in a distributed environment more efficient and local training data more secure.
[0017] 2. When the supervisory node After monitoring the newly added potential customer, the server-side data integration device determines that the supervision nodes it is connected to include and When the supervisory node You can determine the current There is no need to iterate model training based on new potential customers monitored at all times, which reduces the frequency of model training.
[0018] 3. At this moment, the server data integration equipment instruction supervision node connect Or connect simultaneously , The basis (i.e., regulatory node The elements in the uploaded sample calibration set are Some of the iterative samples constructed at the moment are not supervision nodes. exist Instead of the original customer samples monitored at all times, the original customer samples are encrypted and processed into a sample correction set. Uploading data to the server-side data integration device is safer, ensuring the security of customer sample transmission.
[0019] 4. Data exchange between regulatory nodes first requires the establishment of a communication connection between them through encryption and decryption technology. The key to establish the communication connection is , , , It changes dynamically with time without any rules, so it cannot be cracked, which increases the security of data exchange and model training.
[0020] 5. Through Build or update customer multi-type feature data graph templates at all times, construct Iteration samples that iterate the model at all times, as well as calculation of the deviation between the iteration samples and the template samples, enable rapid identification Whether the customer samples obtained at any time are sufficient to affect the financial product recommendation performance of the model, and if it is judged that they are not sufficient to affect the model performance, The constantly updated model continues to iterate, reducing the number of model iterations; 6. By calculation The recommended index correction coefficient for each iterative sample constructed at the moment, and The recommended index corresponding to the template sample with the maximum feature similarity obtained at the moment is corrected by the iterative sample with the maximum feature similarity, and the correction result is directly used as the reference. The recommendation index of the specified type of financial products recommended to the specified customers by the customer samples obtained at all times realizes the direct output of the recommendation results of the specified type of financial products for the suspected potential customers, and improves the recommendation efficiency while ensuring the accuracy of the recommendation of the specified type of financial products.
[0021] 7. Through the construction of customer multi-type feature data graph templates and potential customer multi-type feature data graphs, the image segmentation method is used to achieve The iterative samples that iterate the model are constructed at all times; and through the judgment of the unchanged pixel positions, the constructed iterative samples retain the background characteristics of the customer's multi-type data graph template. Comparison Under the condition that the number of new samples at the moment is limited, the number of iterative samples is increased, which improves The diversity of samples used in model update training is beneficial to improving the performance of the updated model.
[0022] 8. When When the customer sample obtained at the moment has feature similarity with the iterative sample in the calibration sample set, there is no need to The recommendation index prediction model is iteratively updated at all times, and the appropriate recommendation index correction coefficient is directly extracted to The corresponding recommendation index output by the moment prediction can be output after correction, which reduces the frequency of model iteration and ensures a high correction accuracy. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0024] Figure 1 It is a diagram of implementation steps of a data integration method based on distributed encryption computing provided by an embodiment of the present invention; Figure 2 It is a technical roadmap of a method for recommending customers using a data integration method provided by an embodiment of the present invention; Figure 3 This is an example diagram of a multi-type feature data diagram of potential customers; Figure 4 This is an example diagram of the customer multi-type feature data diagram template; Figure 5 This is an example image of a one-pixel window; Figure 6 This is a distributed architecture diagram of the financial product recommendation provided in this embodiment. DETAILED DESCRIPTION
[0025] The technical solution of the present invention is further described below with reference to the accompanying drawings and through specific implementation methods.
[0026] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on this patent; in order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of the actual product; for those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.
[0027] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "inner", "outer", etc. appear, the orientation or position relationship indicated is based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as a limitation on this patent. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.
[0028] In the description of the present invention, unless otherwise clearly specified and limited, if the term "connection" or the like appears to indicate the connection relationship between components, the term should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two components or the interaction relationship between two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0029] Before describing the data integration method based on distributed encryption computing provided by the embodiment of the present invention, the customer recommendation method provided by the embodiment is first described. Figure 2 As shown, the customer recommendation method provided in this embodiment includes the steps of: S1, using A customer multi-type feature data graph template that is built or updated for a specified type of financial product at any time. The multi-type feature data of each suspected customer who is suspected of intending to purchase the specified type of product is preprocessed to obtain Iterative sample data set at time; S2, according to Iterative sample data set at time, construct Iteration samples of the model iteration are performed at all times, and the recommendation index correction coefficient corresponding to each iteration sample is calculated; S3, according to Each iterative sample constructed at the moment is updated The recommendation index prediction model is trained at all times, and then the correctness of the recommendation index correction coefficient associated with each iterative sample is verified using the updated model, and each iterative sample that passes the verification is added to In the calibration sample set bound at the moment; S4, yes The customer samples acquired at each moment are subjected to feature similarity calculation with each iteration sample in the correction sample set, so as to extract the specified recommendation index correction coefficient associated with the specified iteration sample having the maximum feature similarity with the customer sample; S5, extracted in The template sample that has been used to calculate the recommended index correction coefficient with the specified iteration sample at the time Recommendation index at the moment; S6, correcting the recommended index with a specified recommended index correction coefficient, and using the correction result as a direct recommendation result for recommending a specified type of financial product to the customer represented by the customer sample.
[0030] The following describes in detail how to implement each of the above steps S1-S6.
[0031] In step S1, the designated type of financial products includes fund products, stock products, financial products, bond products, etc.
[0032] Indicates The moment to build or update the customer multi-type feature data graph template corresponding to the specified type of financial product. express The last moment; Time display The next moment of the moment.
[0033] Customers’ multi-type characteristic data include their historical transaction data, historical consumption data, etc. The historical transaction data includes the customers’ historical transaction data on stocks, funds, bonds, and wealth management in financial institutions; the historical consumption data includes the customers’ historical purchase data on daily necessities and services.
[0034] In step S1, a financial product of a specified type is constructed or updated. The method for generating a customer multi-type feature data graph template corresponding to a certain moment specifically comprises the following steps: A1, filter out Compare model updates at all times Always update the difference samples of the training samples used by the model; For example, suppose The training samples used to update the model at any time include e1, e2, and e3. The training samples to be used for model updating at all times include e1, e2, e3, e4, and e5. Samples e4 and e5 are the difference samples selected in step A1.
[0035] A2, convert each feature element in each type of feature array in each difference sample into the corresponding color feature, and obtain the feature element in The first template color comprehensive feature in the first customer multi-type feature data graph template bound at the moment; The customer's historical transaction data corresponds to the first type of feature array, and the customer's historical consumption data corresponds to the second type of feature array. The customer's historical stock transaction data in the financial institution in the customer's historical transaction data is one of the feature elements in the first type of feature array; the customer's historical fund transaction data in the financial institution in the customer's historical transaction data is another feature element in the first type of feature array.
[0036] The same feature element in different training samples has the same or different first template color comprehensive feature assignment method in the customer multi-type feature data graph template. For example, for the feature element of stock historical transaction data, the template color comprehensive feature assignment method is: Assume that At this moment, there are three samples, e1, e2, and e3, as the basis for constructing or updating the first customer multi-type feature data graph template. The number of stock historical transactions recorded in the stock historical transaction data in e1, e2, and e3 is, for example, 3, 5, and 8 transactions respectively. Assuming that the initial color value given to the feature element of stock historical transaction data is "003", and each time a historical transaction is added, the color value is deepened, then the color feature of the feature element of the stock historical transaction data of the e1 sample in the first multi-type feature data graph template can be defined as "003-3", the e2 sample is "003-5", and the e3 sample is "003-8". "003-3", "003-5", and "003-8" have corresponding color values respectively. The first template color comprehensive feature of the feature element of the stock historical transaction data in the first customer multi-type feature data graph template is the average value of the color values corresponding to "003-3", "003-5", and "003-8" respectively.
[0037] A3, calculate the average value of the color feature of each feature element in each difference sample and the first template color comprehensive feature, as the average value of the feature element in each difference sample The second template color comprehensive features in the second customer multi-type feature data graph template are updated at all times.
[0038] Taking the characteristic element of stock historical transaction data as an example, assuming that the color features of difference samples e4 and e5 are "003-6" and "003-11" respectively, the second template color comprehensive feature of this characteristic element in the second customer multi-type feature data graph template is the average of "003-6", "003-11" and the first template color comprehensive feature.
[0039] In step S1, The multi-type feature data of each suspected customer who is suspected of intending to purchase the specified type of financial product is preprocessed to obtain Iterative sample data set at time; There are many ways to obtain potential customers at any time. For example, financial products A and B have product similarity. Customers a, b, and c have purchased financial product A in the past. When analyzing suspected potential customers of financial product B at any time, customers a, b, and c can be regarded as suspected potential customers who purchase financial product B.
[0040] The method for preprocessing multi-type feature data of suspected potential customers includes the following steps: B1, yes Each newly added sample at a certain moment constructs a corresponding multi-type feature data graph of potential customers. The construction method is: Convert each feature element in each feature array of the newly added samples into a corresponding color feature, and then assign it to the specified pixel position of each feature element in the preset empty image; The following combination Figure 3 The following is a detailed description of how to construct a multi-type feature data graph of potential customers: Assumptions There are five customer samples at the moment: e1, e2, e3, e4, and e5. There are three customer samples at the moment: e1, e2, and e3. Then e4 and e5 are Compare to time Each new sample carries several types of feature arrays, including the customer's historical transaction data and customer's historical consumption data. The feature array also includes the customer's historical stock transaction data and bond transaction data in financial institutions. Each feature element has a corresponding color feature assignment method. At this time, the customer feature carried by each feature element in the new sample is converted into a corresponding color feature, and then assigned to each feature element in Figure 3 At the specified pixel location in the example preset empty image, the assignment process here is like the process of coloring the customer features carried by the feature elements on the preset empty image.
[0041] For example, suppose the feature array of "customer historical transaction data" carried by the newly added sample e4 includes 12 feature elements. The system generates a feature array of "customer historical transaction data" in the following order: Figure 3 The designated coloring area on the preset empty image shown is, for example, area 100. The coloring position of the feature element "historical stock trading data of the customer in the financial institution" in the feature array in area 100 is designated as pixel position 1, and the color feature of the feature element "historical stock trading data of the customer in the financial institution" of the newly added sample e4 is assigned to pixel position 1.
[0042] B2, for each pixel site in the multi-type feature data graph of the intended customer that belongs to the same type of feature array, determine whether it is an unchanged pixel site one by one, and calculate the ratio of the number of unchanged pixel sites to the total number of assigned pixel sites in the feature array to which it belongs; For example, suppose Figure 3 The region 100 in the preset empty image of the example includes 9 pixel sites, each of which refers to a corresponding feature element. However, after adding the customer feature of the newly added sample e4 to the preset empty image, it is found that only the pixel sites 1-7 in the region 100 are assigned values, so the total number of assigned pixel sites in the region 100 is 7 instead of 9.
[0043] In this embodiment, The newly added samples need to be used to determine the unchanged pixel locations. Therefore, in order to facilitate the machine to quickly identify the image position of the basis area for the judgment of the unchanged pixel position from the template, preferably, the setting position of the pixel position corresponding to the same feature element is the same in the intended customer multi-type feature data map and the customer multi-type feature data map template. For example, the size of the intended customer multi-type feature data map and the customer multi-type feature data map template is exactly the same, and area 100 is Figure 3 The setting position in the multi-type feature data map of potential customers shown in the figure is exactly the same as the setting position in the multi-type feature data map template of customers. The same feature element, such as "historical stock trading data of customers in financial institutions", has the same designated position of the pixel site in the multi-type feature data map of potential customers and the multi-type feature data map template of customers, for example, both are designated as Figure 3 Pixel location 1 shown in .
[0044] The method for determining the unchanged pixel position specifically includes the following steps: B21, calculating the color feature differences between two pixel sites in the potential customer multi-type feature data map and the customer multi-type feature data map template that belong to the same type feature array and have the same designated position, and determining the pixel sites in the potential customer multi-type feature data map whose color feature differences are greater than the difference threshold as suspected changed pixel sites; For example, Figure 4 The feature array belonging to area 100' in the example customer multi-type feature data map template is Figure 3The type of feature array to which region 100 in the multi-type feature data map of potential customers in the example is assigned is the same, both belonging to the feature array of “customer historical transaction data”, and the setting position and area range of region 100 in the multi-type feature data map of potential customers are the same as the setting position and area range of region 100' in the customer multi-type feature data map template. And the customer multi-type feature data map template and the multi-type feature data map of potential customers have the same size. The feature element corresponding to pixel position 1' in region 100' is, for example, “customer’s historical stock transaction record in a financial institution”, and its setting position in region 100' is the same as that in the multi-type feature data map template. Figure 3 The pixel site 1 in the region 100 is set at the same designated position, and the feature element corresponding to the pixel site 1 is also "the customer's stock transaction history record in the financial institution". Therefore, the pixel site 1' and the pixel site 1 meet the conditions of belonging to the same type of feature array and having the same designated position, and thus the color feature difference (the color feature of the two pixel sites (the color value assigned, where the color feature of the pixel site 1' is the color value assigned to the pixel site 1') is calculated for the pixel site 1' and the pixel site 1. The comprehensive template color feature of each sample obtained at the moment is the mean; and the color feature of pixel position 1 is the color feature of the newly added sample assigned at pixel position 1, which is the absolute value of the difference between the single value).
[0045] Assuming that the color feature difference between the pixel site 1 and the pixel site 1' is greater than a preset difference threshold, the pixel site 1 is determined as a suspected changed pixel site.
[0046] It should be noted here that the data of customer characteristics (feature elements) of users who purchase different financial products are rich and diverse, and the degree to which each customer characteristic affects the customer's willingness to purchase a specified type of financial product is usually different. In this embodiment, this degree of influence is defined as the contribution of customer characteristics to the model recommendation performance. The greater the degree of influence, the greater the contribution of the customer characteristic. Therefore, in order to capture the contribution of different feature elements to model prediction, in this embodiment, a set of methods for capturing the contribution of feature elements to model prediction performance is provided through steps C1-C3, so that the neighboring sites belonging to the same feature array assigned in the customer multi-type feature data graph template have a close contribution to the model performance, and further judge whether the neighboring sites of the suspected changed pixel sites determined in step B21 are unchanged pixel sites. In this way, when correcting unchanged pixels, it is not easy to mistakenly correct the suspected changed pixel sites that have a large contribution to the model performance as unchanged pixel sites, thereby improving Compared with the iterative samples obtained at the moment The difference of training samples at each moment can improve The model iteration effect at all times ensures the accuracy of customer recommendations.
[0047] Specifically, the following steps C1-C3 are used to capture the contribution of each feature element belonging to the same feature array to the model prediction performance, and to specify the assignment position in the customer multi-type feature data graph template for each feature element: C1, from Extract the characteristic elements belonging to the same characteristic array from the sample set acquired at the moment to form a unit sample set, and extract the remaining sample set as the background sample set; and define the pixel window of the characteristic array in the image template according to the number of characteristic elements in the unit sample set; For example, Assume that we have obtained 3 customer samples, e1, e2, and e3, which constitute Corresponding sample set. When it is necessary to capture the contribution of each feature element in the "customer historical transaction data" to the model prediction performance, extract each feature element belonging to the feature array of "customer historical transaction data" from each customer sample in the sample set. For example, the feature array of "customer historical transaction data" in sample e1 includes the feature element of "customer's historical stock transaction data in financial institutions", and the feature array of "customer historical transaction data" in sample e2 includes the feature element of "customer's historical bond transaction data in financial institutions". Then add the two feature elements under e1 and e2 to the unit sample set. From After extracting these two characteristic elements from the sample set acquired at each moment, the remaining sample set is used as the background sample set.
[0048] An example of a method for defining the pixel window of the feature array in the image template according to the number of feature elements in the unit sample set is as follows: Assuming that the number of characteristic elements in the unit sample set is less than or equal to 9, the size of the corresponding pixel window is set to three rows and three columns with a total of 9 pixel sites. Assuming that the number of characteristic elements in the unit sample set is greater than 9 but less than or equal to 25, the size of the corresponding pixel window is set to five rows and five columns with a total of 25 pixel sites. Assuming that the number of characteristic elements in the unit sample set is greater than 25 but less than or equal to 49, the size of the corresponding pixel window is set to seven rows and seven columns with a total of 49 pixel sites, and so on. When the number of characteristic elements in the unit sample set is less than the number of pixel sites in the pixel window, the color value of the pixel site that is not assigned a color feature is "null value". When judging the unchanged pixel site, the system will automatically filter out these "null value" pixel sites.
[0049] C2, extract one unit sample from the unit sample set and the background sample set one by one to form a corresponding assignment sample set, and use the same parameters to train each assignment sample set to obtain the recommendation index prediction unit model corresponding to each unit sample; For example, the unit sample (feature element) of "the customer's historical stock trading data in a financial institution" in sample e1 in the above example and the background sample set constitute the corresponding e1 value assignment sample set; the unit sample of "the customer's historical bond trading data in a financial institution" in sample e2 and the same background sample set constitute the corresponding e2 value assignment sample set.
[0050] Then, the same training parameters are used to train each assigned sample set to obtain the e1 recommendation index prediction unit model corresponding to the unit sample of "historical stock trading data of customers in financial institutions" in sample e1, and the e2 recommendation index prediction unit model corresponding to the unit sample of "historical bond trading data of customers in financial institutions" in sample e2.
[0051] C3, evaluates the performance of each recommendation index prediction unit model and sorts the corresponding unit samples from low to high according to performance; For example, assuming that the e1 recommendation index prediction unit model has higher model performance than the e2 recommendation index prediction unit model, and the e3 recommendation index prediction unit model has higher model performance than the e1 recommendation index prediction unit model, then the unit sample e2 of the e2 recommendation index prediction unit model is trained. 单元 Sort first, train the e1 recommendation index prediction unit model unit sample e1 单元 Next in ranking, train the e3 recommendation index prediction unit model with unit sample e3 单元 Sort at the end.
[0052] C4, taking the unit sample with the median performance as the central pixel position of the pixel window, and specifying the corresponding pixel positions for each unit sample arranged in an outward expansion manner from left to right and from top to bottom relative to the central pixel position in the pixel window.
[0053] For example, the unit sample e1 with the median performance 单元 exist Figure 3 The assignment position in the pixel window (area 100) shown is designated as pixel position 5 (pixel position 5 is the center pixel position of the pixel window). Then, in the pixel window, the unit samples e2 are arranged in order from left to right and from top to bottom relative to the center pixel position. 单元 、e3 单元 Specify the corresponding pixel locations, i.e. unit sample e2 单元 The pixel locations specified are Figure 3 Pixel location 1 in region 100, unit sample e3 单元 The pixel locations specified are Figure 3The pixel site 2 in the area 100 in the pixel window. The "external expansion method" described here means: assuming that there are 25 pixel sites in five rows and five columns in the pixel window, the pixel sites are numbered in order from left to right and from top to bottom, and the central pixel site is pixel site 13. Assuming that there are only 6 unit samples in the unit sample set, the pixel sites specified by the 6 unit samples in the pixel window are pixel sites 7-9 and 12-14 respectively. Assuming that there are 10 unit samples in the unit sample set, the pixel sites specified by the 10 unit samples in the pixel window are pixel sites 7-9, 12-14, 17-19, and 1 respectively.
[0054] The method for specifying the assignment position of each feature element in the multi-type feature data graph of potential customers is the same as the method for specifying the assignment position of the feature element in the customer multi-type feature data graph template, and will not be repeated here.
[0055] After identifying each suspected changed pixel position belonging to the same type of feature array through step B21, the determination method of the unchanged pixel position in step B2 proceeds to step: B22, determining whether the neighboring site of the suspected changed pixel site is a suspected unchanged pixel site or an unchanged pixel site, If so, the suspected changed pixel position is corrected to an unchanged pixel position; If not, the suspected changed pixel site is determined to be a changed pixel site.
[0056] For example, suppose Figure 5 The pixel site 7 in step B21 is determined as a suspected changed pixel site. In this embodiment, the neighboring sites refer to eight neighboring sites, namely, the top, bottom, left, right, upper left, lower left, upper right, and lower right of the pixel site. For example, Figure 5 In the figure, the neighboring pixels of pixel 13 are pixel 7-9, 12, 14, 17-19. The color features of the top, left, bottom left, and top right of the suspected changed pixel 7 are assigned "null value". Therefore, the final judgment of whether it is an unchanged pixel or a changed pixel is based on its neighboring pixel 1, 8, 12, and 13.
[0057] It should be noted here that The data richness in the iterative sample data set at the time can be controlled by setting the explicit standard of the adjacent sites in step B22. The higher the explicit standard of the adjacent sites, the worse the data richness. However, the data obtained by steps B1-B3 is The iterative sample data set at time The greater the difference in sample characteristics of the sample set at the moment, the greater the difference in sample characteristics of the sample set at the moment. The higher the performance of the recommendation index prediction model, the higher the training performance of the iterative sample data set obtained at any time. The lower the clear standard of the adjacent sites, the lower the performance of the recommendation index prediction model. The data richness of the iterative sample data set at time When the sample data of the sample set obtained at any time is insufficient, it will further affect The performance of the model is updated all the time, so a balance can be found between the data richness of the iterative sample dataset and ensuring the performance of the updated model by setting reasonable criteria for clarifying neighboring sites.
[0058] In this embodiment, in step B22, preferably, when any one of the neighboring sites of the suspected changed pixel site is determined to be a suspected unchanged pixel site or an unchanged pixel site, the suspected changed pixel site is corrected to an unchanged pixel site. Alternatively, when all the neighboring sites of the suspected changed pixel site are determined to be suspected unchanged pixel sites or unchanged pixel sites, the suspected changed pixel site is corrected to an unchanged pixel site. Alternatively, when the neighboring sites of the suspected changed pixel site are determined to be suspected unchanged pixel sites or the ratio of the number of neighboring sites of the unchanged pixel site to the total number of neighboring sites is greater than a preset ratio threshold, the suspected changed site is corrected to an unchanged pixel site.
[0059] In step B2, the method for calculating the ratio of the number of unchanged pixel sites to the total number of assigned pixel sites in the attribute array is exemplified as follows: Assumptions Figure 5 In the above figure, pixel positions 1, 7, and 8 are determined to be unchanged pixel positions. Figure 5 The total number of pixel sites assigned values is 10, and the ratio calculated in step B2 is three tenths.
[0060] After step B2, in step S1, the method of preprocessing the multi-type feature data of each suspected potential customer proceeds to step: B3, when the ratio calculated in step B2 is determined to be less than a preset ratio threshold, the feature array is added as a construction unit to the iterative sample data set.
[0061] The implementation of step S2 is described in detail below: In step S2, according to The iterative sample data set at time t is constructed The method of iterating samples at each moment of model iteration comprises the steps of: D1, specifies the corresponding template sample for each iterative feature array in the iterative sample data set; For example, suppose you update The customer samples of the customer multi-type feature data graph template corresponding to the moment include template samples m1, m2, m3, and m4. The iteration sample data set includes iteration feature arrays n1, n2, and n3. Then, the template sample corresponding to iteration feature array n1 can be specified as m2, the template sample corresponding to n2 as m1, and the template sample corresponding to n3 as m4.
[0062] D2, replace the template feature array of the same type in the template sample with the iterative feature array, and obtain the template sample modified to have the iterative sample with the iterative feature array.
[0063] For example, the template feature array of the same type as the iteration feature array n3 in the template sample m4 is n3', then n3 is replaced with n3' in m4, and the template sample m4 is modified to be an iteration sample with the iteration feature array n3.
[0064] In step S2, the method for calculating the recommendation index correction coefficient corresponding to each iterative sample is: Determine whether the absolute value of the difference between the sample characteristic value deviation of the associated iterative sample and the recommendation index prediction deviation is less than the preset difference threshold, If yes, then taking the recommendation index prediction deviation corresponding to the iteration sample as the recommendation index correction coefficient corresponding to the iteration sample; If not, it is determined that the calculation of the recommended index correction coefficient for the iterative sample has failed.
[0065] In this embodiment, the sample feature value deviation of the associated iterative sample is: the array feature value deviation between the iterative feature array and the template feature array having a replacement relationship.
[0066] For example, in the above example, the iterative feature array n3 replaces the template feature array n3' in the template sample m4, so n3 and n3' have a replacement relationship.
[0067] The array feature deviation with a replacement relationship refers to: the weighted average of the absolute values of the differences between the element eigenvalues of the feature elements in n3 and the eigenvalues of the same type of feature elements in n3'. For example, n3 includes three feature elements, x1, x2, and x3, and the corresponding element eigenvalues are y1, y2, and y3, respectively. The eigenvalue of the feature element x1' of the same type as x1 in n3' is, for example, y1', the eigenvalue of the feature element x2' of the same type as x2 is, for example, y2', and the eigenvalue of the feature element x3' of the same type as x3 is, for example, y3'. Then the array feature deviation of n3 and n3' is the weighted average of the absolute values of the first difference between y1 and y1', the absolute value of the second difference between y2 and y2', and the absolute value of the third difference between y3 and y3'.
[0068] The recommendation index prediction deviation with substitution relationship refers to: using The deviation between the intention recommendation index for a specified type of financial product output by the iterative sample prediction model trained at each moment and the template recommendation index output by the same recommendation index prediction model for a template sample with a replacement relationship (also taken as the absolute value of the difference). The implementation of step S3 is described in detail below: In step S3, the method for verifying the correctness of the recommendation index correction coefficient associated with each iterative sample in the sample set to be corrected includes the following steps: S31, update the model to take the iteration sample as input, predict the first recommendation index corresponding to the output iteration sample, and then obtain The recommendation index prediction model trained at the moment predicts a second recommendation index outputted by the template sample having a replacement relationship with the iteration sample; S32, calculating a first absolute value of a difference between the first recommendation index and the second recommendation index, and then determining whether a second absolute value of a difference between the first absolute value of the difference and a recommendation index correction coefficient associated with the iteration sample is less than a preset absolute value threshold of the difference, If yes, it is determined that the correctness verification of the recommendation index correction coefficient has passed, and when the first recommendation index is greater than or equal to the second recommendation index, the recommendation index correction coefficient associated with the iterative sample is recorded as a positive value, otherwise it is recorded as a negative value; If not, the verification is determined to have failed.
[0069] The implementation of step S4 is described in detail below: In step S4, There are many existing methods for calculating feature similarity between customer samples acquired at any time and each iterative sample in the correction sample set. Since the feature similarity calculation method is not within the scope of rights to be protected by this application, it will not be explained in detail.
[0070] The purpose of the feature similarity calculation in step S4 is to: extract the recommendation index correction coefficient (defined as the specified recommendation index correction coefficient) associated with the iteration sample (defined as the specified iteration sample) having the maximum feature similarity with the customer sample; It should be noted here that, through step S32, each recommendation index correction coefficient in the correction sample set has been assigned a positive value or a negative value.
[0071] The implementation of step S5 is described in detail below: In step S5, the template sample for which the recommended index correction coefficient has been calculated with the specified iteration sample is extracted. The recommendation index at the moment. That is: extract The recommendation index prediction model trained at the moment predicts the recommendation index output by the template sample having a replacement relationship with the specified iteration sample; The implementation of step S6 is described in detail below: In step S6, the recommended index extracted in step S5 is corrected by the correction coefficient of the specified recommended index extracted in step S4, and the correction method is to find the sum of the two. It should be noted here that the correction coefficient of the specified recommended index extracted in step S4 has been assigned a positive value or a negative value through steps S31-S32. Therefore, the sum of the two may be the sum of two positive numbers, or the difference between one positive and the other negative. The correction result is directly used as the correction coefficient of the recommended index extracted in step S4. The customer sample obtained at the moment refers to the recommendation result of the specified type of financial product. When the customer sample obtained at the moment has feature similarity with the iterative sample in the calibration sample set, there is no need to The recommendation index prediction model is iteratively updated again, and the appropriate recommendation index correction coefficient is directly extracted to The corresponding recommendation index output by the moment prediction can be output after correction, which reduces the frequency of model iteration and ensures a high correction accuracy.
[0072] The following is a detailed description of the data integration method based on distributed encryption computing provided in this embodiment: The financial system provided in this embodiment includes: Figure 6 The distributed encryption computing chains 200 shown in FIG. 2 are respectively associated with a specified type of financial product, such as Figure 1 As shown, the method for data integration of each distributed encryption computing chain includes the following steps: L1, judging based on the supervision node exist Customer samples of new customers suspected of purchasing designated types of financial products monitored at all times, and server-side data financing equipment instruction supervision nodes Is the node that is connected and successfully connected the corresponding Regulatory nodes at the moment , Server-side data integration equipment instruction supervision node Connecting to supervisory nodes The method is: Determine the supervision node exist Customer samples and regulatory nodes monitored at all times Whether at least one element in the uploaded sample calibration set has feature similarity, If so, instruct the supervisory node Connecting to supervisory nodes ; If not, instruct the supervisory node Connect to the supervisory node at the same time and supervisory nodes .
[0073] Supervisory Node Successfully connected to the supervisory node The method is: Parse the server-side data integration equipment instruction supervision node Instruct it to connect to the supervisory node The first key carried in the first instruction of the supervisory node exist At least one iterative sample constructed at the moment and the supervision node exist The replacement relationship of the template samples generated at the moment (which can be expressed in a coding manner, for example, if the iteration sample with the replacement relationship is coded as "d001" and the template sample is coded as "m001", then the replacement relationship can be coded as "d001m001"), and / or the recommendation index correction coefficient corresponding to at least one iteration sample; Carry the first key to the supervisory node Initiate the first connection request and monitor the node Verify the first key carried in the first connection request (verify the correctness of the first key, the supervisory node The first key is stored in A communication connection is established.
[0074] Iterative sample construction based on data as supervision nodes The updated customer multi-type feature data graph template, the updating method has been specifically explained in the above steps A1-A3, and will not be repeated here. and Establishing a communication connection is an update instruction.
[0075] Supervisory Node Successfully connected to the supervisory node The method is: Parse the server-side data integration equipment instruction supervision node Instruct it to connect to the supervisory node The second key carried in the second instruction includes the supervisory node Compare with Regulatory nodes at the moment The second template color comprehensive feature of at least one characteristic element in the monitored difference sample, and / or the supervision node The updated recommendation index prediction model predicts the recommendation index outputted by at least one template sample; Carry the second key to the supervisory node Initiate a second connection request to monitor the node After the second key carried in the second connection request is verified, the supervisory node A communication connection is established.
[0076] Prediction based data includes regulatory nodes The generated correction sample set, the recommended index correction coefficient associated with each iterative sample in the correction sample set, and the supervision node The trained recommendation index prediction model predicts the recommendation index of each template sample.
[0077] After the judgment of step L1 is completed and the communication connection is completed, the data integration method based on distributed encryption calculation provided in this embodiment is as follows: Figure 1 As shown, proceed to step: L2, supervisory node The iterative sample construction is based on the data and the recommendation index prediction model exchanged and transmitted to the supervision node ; or supervisory node , Supervision Node Transmit the predictions to the supervisory nodes based on data exchange ; L3, Supervisory Node After constructing a recommendation index prediction model based on the exchanged iterative samples, the model outputs the financial product recommendation results for the monitored new potential customers, or directly outputs the financial product recommendation results based on the prediction data and sends them to the server-side data integration device, and releases the communication connection between the regulatory nodes after outputting the financial product recommendation results.
[0078] In step L3, how to construct the recommendation index prediction model based on the iterative sample data has been explained in the above content and will not be repeated here. How to directly output the financial product recommendation results based on the prediction data has also been explained in the above content and will not be repeated here.
[0079] In summary, the data integration method based on distributed encryption computing provided in this embodiment only needs to build , , , These four time points correspond to four regulatory nodes. The supervision node corresponding to the moment After monitoring the newly added potential customers, it is only necessary to determine the supervisory node to which the server data integration device instructs it to connect. When the recommendation index prediction model is updated locally, the bank does not need to evaluate the performance of the model, nor does it need to integrate the local training models. This makes the model training in a distributed environment more efficient and the local training data more secure. The data exchange between the regulatory nodes first needs to establish a communication connection with each other through encryption and decryption technology. The key to establish the communication connection is random. , , , It changes dynamically with time without any rules, so it cannot be cracked, which increases the security of data exchange and model training.
[0080] It should be noted that the above specific implementations are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art should understand that various modifications, equivalent substitutions, changes, etc. can be made to the present invention. However, as long as these changes do not deviate from the spirit of the present invention, they should be within the scope of protection of the present invention. In addition, some terms used in the specification and claims of this application are not restrictive, but are only for the convenience of description.
Claims
1. A data integration method based on distributed encryption computing, characterized in that: The financing system includes a plurality of distributed encryption computing chains respectively associated with financial products of a specified type, and the method for data financing of each of the distributed encryption computing chains includes the following steps: L1, judging based on the supervision node exist Customer samples of new customers suspected of purchasing designated types of financial products monitored at all times, and the regulatory nodes specified in the instructions of the server-side data financing device Is the node that is connected and successfully connected the corresponding Regulatory nodes at the moment , If so, the server-side data integration device instructs the supervision node structure The iterative sample corresponding to the moment, and through the supervision node Instructions for monitoring nodes Construct iterative sample construction based on data and transmission The recommendation index prediction model is updated at all times, and then the process goes to step L2; If not, the server-side data integration device passes the supervision node Instructions for monitoring nodes and correspondence Regulatory nodes at the moment Provide prediction basis data exchange to the supervisory node in parallel , then go to step L2; L2, the supervisory node The iterative sample construction basis data and the recommendation index prediction model are exchanged and transmitted to the supervision node ; or the supervisory node , the supervisory node The prediction is transmitted to the supervisory node based on data exchange respectively ; L3, the supervisory node After updating the recommendation index prediction model based on the exchanged iterative samples, the financial product recommendation results are predicted and output for the newly monitored potential customers, or the financial product recommendation results are directly output based on the prediction data and sent to the server-side data integration device, and the communication connection between the supervision nodes is released after the financial product recommendation results are output.
2. The data integration method based on distributed encryption computing according to claim 1 is characterized in that: In step L1, the server-side data integration device instructs the supervisory node Connect the supervisory node The method is: Determine the supervisory node exist The customer samples and the supervision nodes monitored at all times Whether at least one element in the uploaded sample calibration set has feature similarity, If so, instruct the supervisory node Connect the supervisory node ; If not, instruct the supervisory node At the same time, connect to the supervisory node and the supervisory node .
3. The data integration method based on distributed encryption computing according to claim 1 is characterized in that: In step L1, the supervisory node Successfully connected to the supervisory node The method is: Parse the server-side data integration device to instruct the supervision node Instruct it to connect to the supervisory node The first key carried in the first instruction includes the supervisory node exist At least one iteration sample constructed at the moment is related to the supervisory node exist The replacement relationship of the template samples generated at the moment, and / or the recommendation index correction coefficient corresponding to at least one of the iterative samples; Carrying the first key to the supervisory node Initiate a first connection request, the supervisory node After verifying the first key carried in the first connection request, the supervisory node A communication connection is established.
4. The data integration method based on distributed encryption computing according to claim 1 is characterized in that: The iterative sample construction is based on the data of the supervisory node The updated customer multi-type feature data graph template, the updating method includes the following steps: A1, filter out Compare model updates at all times Always update the difference samples of the training samples used by the model; A2, converting each feature element in each type of feature array in each of the difference samples into a corresponding color feature, and obtaining the feature element in The first template color comprehensive feature in the first customer multi-type feature data graph template bound at the moment; A3, calculating the average value of the color feature of each feature element in each difference sample and the first template color comprehensive feature, as the average value of the color feature of each feature element in each difference sample The second template color comprehensive features in the second customer multi-type feature data graph template are updated at all times.
5. The data integration method based on distributed encryption computing according to claim 1 is characterized in that: The supervisory node Successfully connected to the supervisory node The method is: Parse the server-side data integration device to instruct the supervision node Instruct it to connect to the supervisory node The second key carried in the second instruction includes the supervisory node Compare with Regulatory nodes at the moment The second template color comprehensive feature of at least one characteristic element in the monitored difference sample, and / or the supervision node The updated recommendation index prediction model predicts and outputs a recommendation index for at least one template sample; Carry the second key to the supervisory node Initiate a second connection request, the supervisory node After verifying the second key carried in the second connection request, the supervisory node A communication connection is established.
6. The data integration method based on distributed encryption computing according to claim 1 is characterized in that: The prediction basis data includes the supervision node The generated correction sample set, the recommended index correction coefficient associated with each iterative sample in the correction sample set, and the supervision node The trained recommendation index prediction model predicts the recommendation index of each template sample.
7. The data integration method based on distributed encryption computing according to claim 3 is characterized in that: The replacement relationship as the first key is generated by the following method: From the supervisory node Update the customer multi-type feature data graph template based on each template sample, which is the supervision node Each iterative feature array in the constructed iterative sample data set specifies the corresponding template sample; The iteration feature array is replaced with a template feature array of the same type in the specified template sample, and the template sample after replacement is modified to be an iteration sample having the iteration feature array.
8. The data integration method based on distributed encryption computing according to claim 7 is characterized in that: The recommended index correction coefficient as the first key is calculated by the following method: When it is determined that the absolute value of the difference between the sample characteristic value deviation associated with the iteration sample and the recommendation index prediction deviation is less than a preset difference threshold, the recommendation index prediction deviation corresponding to the iteration sample is used as the recommendation index correction coefficient corresponding to the iteration sample; The sample feature value deviation is: the array feature value deviation between the iteration feature array and the template sample array having a replacement relationship; The recommendation index prediction deviation is: using the supervision node The deviation between the intention recommendation index for the specified type of financial product predicted and output by the trained recommendation index prediction model for the iterative sample and the template recommendation index predicted and output by the same recommendation index prediction model for the template sample with a replacement relationship.
9. The data integration method based on distributed encryption computing according to claim 6 is characterized in that: The supervisory node The method for generating the calibration sample set comprises the steps of: S1, using the supervisory node A customer multi-type feature data graph template constructed or updated for a specified type of financial product, for the regulatory node The obtained multi-type feature data of each suspected customer who is suspected of intending to purchase the specified type of financial product is pre-processed to obtain the supervision node Iterative sample data set; S2, according to the supervisory node The iterative sample data set constructs the supervision node Performing iterative samples of the model iteration, and calculating the recommended index correction coefficient corresponding to each of the iterative samples; S3, according to the supervisory node Each of the constructed iterative samples updates the supervisory node The recommended index prediction model is trained, and then the correctness of the recommended index correction coefficient associated with each iterative sample added to the sample set to be corrected is verified by using the updated model, and each iterative sample that passes the verification is added to the supervision node The bound calibration sample set.
10. The data integration method based on distributed encryption computing according to claim 9 is characterized in that: In step S1, the method for preprocessing the multi-type feature data of each of the suspected potential customers comprises the following steps: B1, for the supervisory node For each new sample monitored, a corresponding multi-type feature data graph of potential customers is constructed using the following construction method: Convert each feature element in each type of feature array in the newly added sample into a corresponding color feature, and then assign it to a specified pixel position of each feature element in the preset empty image; B2, for each pixel site in the multi-type feature data graph of the intended customer belonging to the same type of feature array, determine whether it is an unchanged pixel site one by one, and calculate the ratio of the number of the unchanged pixel sites to the total number of assigned pixel sites in the feature array to which it belongs; B3: When it is determined that the ratio is less than a preset ratio threshold, the feature array is added as a construction unit to the iterative sample data set.
Citation Information
Patent Citations
Symbol stream virtual radio organism method and apparatus
CN101167320A
Real-time recommendation system and method of financial products of banks based on Naive Bayesian classification
CN106600369A
Intelligent data interaction method, interaction system, computer equipment and application
CN116307757A
Data dynamic fusion iterative training modeling and application method
CN118802734A
System, method, and apparatus for setting a regulatory operating mode of a device
US20170156149A1
