CN113095946B - Insurance customer recommendation method and system based on federal label propagation - Google Patents
Insurance customer recommendation method and system based on federal label propagation Download PDFInfo
- Publication number
- CN113095946B CN113095946B CN202110469727.4A CN202110469727A CN113095946B CN 113095946 B CN113095946 B CN 113095946B CN 202110469727 A CN202110469727 A CN 202110469727A CN 113095946 B CN113095946 B CN 113095946B
- Authority
- CN
- China
- Prior art keywords
- node
- client
- insurance
- overlapping
- insurance company
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 11
- 239000011159 matrix material Substances 0.000 claims abstract description 35
- 238000004364 calculation method Methods 0.000 claims description 14
- 238000013507 mapping Methods 0.000 claims description 6
- 230000010354 integration Effects 0.000 claims description 3
- 238000010606 normalization Methods 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/08—Insurance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- 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/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0631—Item recommendations
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Technology Law (AREA)
- Medical Informatics (AREA)
- Databases & Information Systems (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention relates to an insurance client recommendation method based on federal label propagation, which comprises the steps of taking a plurality of insurance companies as participants, generating a corresponding network graph, carrying out encryption node matching to obtain overlapping node sets of all parties, carrying out homomorphic encryption on an adjacent matrix of a node by the participants and then sending the encrypted adjacent matrix to a coordination end, calculating the adjacent matrix of each participant by the coordination end in a secret state, carrying out node importance on a result sent back by the coordination end in combination with the participants, calculating the node similarity and the adjacent node importance, iteratively updating a label of each node according to the label and the importance of the adjacent node until the updated label is the same as the community found in the previous iteration, and finally finding community distribution, thereby accurately recommending an insurance product to a client. The invention can combine the client data of multiple insurance companies to carry out community discovery on the premise of not losing accuracy, and furthest protects the client information privacy of each insurance company while improving the accuracy.
Description
Technical Field
The invention relates to the technical field of discovery of associated nodes on a plurality of client networks, in particular to an insurance client recommendation method and system based on federal label propagation.
Background
With the development of social productivity and the improvement of living standard, more and more people choose to buy insurance products to transfer the economic loss brought by unknown risks and the associated problems. In the face of the quinqueous insurance product categories, insurance companies can more efficiently provide targeted high-quality insurance recommendation service for customers by analyzing the insurance purchase information of the customers, and mine insurance customer groups of the same category, so as to perform services such as accurate insurance recommendation and advertisement delivery. However, with the progress of society, the problem of privacy protection becomes a primary issue of great attention in various industries. It is increasingly important how to make insurance client recommendations without revealing the privacy of the client. The related research and technology of the current insurance client recommendation based on privacy protection are not mature, and have limitations in the following aspects: the accuracy is not good, the possibility of identifying personal records is high, the personal records are easy to be attacked or can not be resisted, the time consumption is long, and the like. Therefore, the insurance client recommendation analysis and application performed by the privacy-protecting graph data mining algorithm are less, and the accuracy is difficult to guarantee.
Disclosure of Invention
In view of this, an object of the present invention is to provide an insurance client recommendation method and system based on federal label propagation, which can combine client data of multiple insurance companies to perform community discovery without losing accuracy, thereby improving accuracy and protecting client information privacy of each insurance company to the maximum extent.
In order to achieve the purpose, the invention adopts the following technical scheme:
an insurance customer recommendation method based on federal label propagation comprises the following steps
Step S1, taking a plurality of insurance companies as a party A of the federation i Reading each participant insurance company client network G i Carrying out encryption node matching to obtain a client set overlapping node set of each party;
s2, according to all the client sets of each local party, removing the overlapped client set obtained in the step S1 to obtain a non-overlapped node set of each local party, traversing the non-overlapped node sets of each local party, and calculating the similarity between the non-overlapped client nodes of each insurance company;
s3, the participant encrypts the adjacent matrixes of the nodes in a homomorphic way and sends the adjacent matrixes to the coordination terminal;
s4, the coordination end calculates the adjacent matrix of each participant in a secret state, and the nodes, namely NI, similarity SIM and neighbor node importance NNI are calculated locally by combining the results sent back by the coordination end of each participant;
and S5, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community found in the previous iteration, and finally, community distribution is found.
Further, the step S1 specifically includes:
step S11: reading participant insurance company client network G i ＝(V,E)；
Step S12: generating an RSA key pair for each participant, and sending the RSA public key to other participants;
step S13: the participator insurance companies and the execution privacy protection node ID matching protocol carry out pairwise intersection to obtain overlapped clients of the participator insurance companies;
step S14: and solving union between the obtained intersection sets to obtain an overlapping client set contained by the insurance company, namely a local overlapping client set of the participants.
Further, the step S2 specifically includes:
step S21: according to the obtained overlapped customer set;
step S22: for each party insurance company, obtaining a set of non-overlapping client nodes through all local client node sets and overlapping client node sets;
step S23: each party insurance company traverses the local non-overlapping node client set, and the similarity information of the local non-overlapping client nodes is calculated through the node similarity formulas (1) and (2);
where | p | represents the number of paths of length α where node i and node j are directly connected to each other, N b Is the set of all neighbors of a node.
Further, the step S3 specifically includes:
step S31: randomly selecting a party insurance company to generate a homomorphic encryption algorithm key pair;
step S32: the insurance company sends the key pair to other participating insurance companies;
step S33: each participating insurance company uses a hash algorithm to perform hash mapping on each client node of the local overlapping client set;
step S34: each participating insurance company uses homomorphic cryptographic public keys to overlay the adjacency matrix A of the client nodes i Carry out encryption
Step S35: overlapping customer nodes that each participating insurance company hashes and adjacency matrix A i Sending the data to a coordination end;
step S36: the coordination terminal adds the adjacent matrixes of all parties to obtain an adjacent matrix A of complete information in a secret state, and performs encryption matrix calculation in the secret state to obtain A 2 A 3 ；
Step S37: and the coordination terminal respectively sends the hash overlapping nodes and the updated encryption matrix to each participant insurance company according to the hash overlapping nodes sent by each participant insurance company.
Further, step S4 specifically includes:
step S41: each party insurance company obtains an original client node according to the node hash value;
step S42: each party insurance company decrypts the adjacency matrix using the SEAL private key;
step S43: each party insurance company decrypts the adjacent matrix, updates the local subgraph and calculates the importance NI of the local nodes;
wherein k is u Is the degree of the node u in the graph, | N | is the total number of nodes
Each participant locally calculates the similarity of the nodes according to the similarity formulas (2) and (3) mentioned in step S23.
Calculating the neighbor node importance NNI according to a formula (4) through the node importance NI node similarity SIM,
where Sim (u, v) is the similarity between node u and node v, and NI (v) is the importance of the node.
Further, the step S5 specifically includes:
step S51: tag propagation iterations by each participating insurance company
Step S52: and sequencing each client node according to the node importance NI calculated in the step S43, and constructing a node sequence for updating the label each time.
Step S53: for each client node, initializing the self label as b (u, 1), and 1 as the belonging coefficient of the belonging community.
Step S54: each node constructs a label set of itself according to the labels of the neighbor nodes
According to the node updating sequence determined in the step S52, for each node u, updating the label of each node according to the neighbor node importance NNI calculated in the step S43 and the formula (5);
step S55: if it is not
And L is the label number of the current node, and the label is deleted from the label set.
Step S56: carrying out normalization operation on the coefficients of the communities of the nodes;
step S57: and circularly iterating the steps S54 to S56 until the found community is the same as the previous iteration, and obtaining a final community division result according to the labels of all the nodes, namely the node labels in the same community are the same.
An insurance customer recommendation system based on federal label propagation comprises an overlapping customer identification module, a non-overlapping customer similarity calculation module, an overlapping customer information integration module based on privacy protection at a coordination end, a customer information updating module, an insurance customer community division module based on label propagation and an insurance customer recommendation module in the same community;
the overlapping client identification module is used for taking a plurality of insurance companies as each party A of the federation i Reading each participant insurance company client network G i For each participant, an RSA key pair is generated, and the RSA public key is sent to the other participants A i The insurance companies of the participants and the node ID matching protocol executing privacy protection carry out pairwise intersection calculation to obtain overlapping client sets of the participants, and the obtained intersection sets are subjected to union calculation to obtain overlapping client sets contained in the insurance companies, namely the local overlapping client sets of the participants;
the non-overlapping client similarity calculation module is used for removing the obtained overlapping client set from all the client sets locally at each party to obtain the non-overlapping node set of each party, traversing the local non-overlapping node sets of each party, and calculating the similarity between the non-overlapping client nodes of each insurance company through a formula;
the coordination terminal is used for randomly selecting one party insurance company to generate a homomorphic encryption algorithm key pair, the insurance company sends the key pair to other party insurance companies, then each party insurance company uses a hash algorithm to carry out hash mapping on each client node of a local overlapping client set, and uses a homomorphic encryption public key to encrypt an adjacent matrix constructed by a neighbor client which is corresponding to the overlapping client node and has the same interest; the coordinating end is used for the matrix A of each participant in a secret state i Adding, complementing the complete information of the overlapped nodes to obtain A, and performing A in a dense state 2 A 3 Obtaining the number of paths between the nodes through the operation of (3); finally, the hash overlapping node and the corresponding neighbor node information are keyed againThe forms of the value pairs are respectively sent to all the participant insurance companies;
the client information updating module is used for obtaining original client nodes according to the node hash values of all the participant insurance companies, decrypting encrypted neighbor node information of the nodes by using a SEAL private key to obtain complete degree information of the nodes and complete path information among the nodes, and calculating node importance NI, node similarity SIM and neighbor client node importance NNI according to a formula;
the insurance client community division module based on label propagation carries out label propagation community discovery locally by each participant insurance company through NI, SIM and NNI calculated locally, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community discovered in the previous iteration, and finally obtains the division result of each community according to the label of each node, namely the same community is the same as the label of the client node;
and the insurance client recommendation module in the same community carries out accurate insurance recommendation service on insurance clients belonging to the same community according to the obtained community division result.
Further, the coordinating end is acted by a third-party trusted authority.
Compared with the prior art, the invention has the following beneficial effects:
the invention can combine the client data of multiple insurance companies to carry out community discovery on the premise of not losing accuracy, and furthest protects the client information privacy of each insurance company while improving the accuracy.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
The invention is further explained below with reference to the drawings and the embodiments.
Referring to fig. 1, the invention provides an insurance customer recommendation method based on federal label propagation, which comprises the following steps
Step S1, taking a plurality of insurance companies as a party A of the federation i Reading each participantFair insurance company customer set network G i Carrying out encryption node matching to obtain a client set overlapping node set of each party;
step S2, according to all the client sets of each local party, removing the overlapping client set obtained in the step S1 to obtain a non-overlapping node set of each local party, traversing the non-overlapping node sets of each local party, and calculating the similarity between the non-overlapping client nodes of each insurance company;
s3, the participant encrypts the adjacent matrixes of the nodes in a homomorphic way and sends the adjacent matrixes to the coordination terminal;
s4, the coordination end calculates the adjacent matrix of each participant in a secret state, and the nodes, namely NI, similarity SIM and neighbor node importance NNI are calculated locally by combining the results sent back by the coordination end of each participant;
and S5, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community found in the previous iteration, and finally, community distribution is found.
Preferably, in this embodiment, step S1 specifically includes:
step S11: reading participant insurance company client network G i ＝(V,E)；
Step S12: generating an RSA key pair for each participant, and sending the RSA public key to other participants;
step S13: the participator insurance companies and the execution privacy protection node ID matching protocol carry out pairwise intersection to obtain overlapped clients of the participator insurance companies;
step S14: and solving union between the obtained intersection sets to obtain an overlapping client set contained by the insurance company, namely a local overlapping client set of the participants.
Preferably, in this embodiment, step S2 specifically includes:
step S21: according to the obtained overlapped customer set;
step S22: for each party insurance company, obtaining a set of non-overlapping client nodes through all local client node sets and overlapping client node sets;
step S23: each party insurance company traverses the local non-overlapping node client set, and the similarity information of the local non-overlapping client nodes is calculated through the node similarity formulas (1) and (2);
where | p | represents the number of paths of length α where node i and node j are directly connected to each other, N b Is the set of all neighbors of a node.
Preferably, in this embodiment, step S3 specifically includes:
step S31: randomly selecting a party insurance company to generate a homomorphic encryption algorithm key pair;
step S32: the insurance company sends the key pair to the other participating insurance companies;
step S33: each participating insurance company performs hash mapping on each client node of the local overlapping client set by using a hash algorithm;
step S34: adjacent matrix A of each party insurance company to overlapping client nodes using homomorphic cryptographic public keys i Carry out encryption
Step S35: overlapping customer nodes that each participating insurance company hashes and adjacency matrix A i Sending the data to a coordination end;
step S36: the coordinating end adds the adjacent matrixes of all parties to obtain an adjacent matrix A of complete information in a secret state, and an encryption matrix A is calculated in the secret state 2 A 3 ；
Step S37: and the coordination terminal respectively sends the hash overlapping nodes and the updated encryption matrix to each participant insurance company according to the hash overlapping nodes sent by each participant insurance company.
Preferably, in this embodiment, step S4 specifically includes:
step S41: each party insurance company obtains an original client node according to the node hash value;
step S42: each party insurance company decrypts the adjacency matrix using the SEAL private key;
step S43: each party insurance company decrypts the adjacent matrix, updates the local subgraph and calculates the importance NI of the local nodes;
wherein k is u Is the degree of the node u in the graph, | N | is the total number of nodes
Each participant locally calculates the similarity of the nodes according to the similarity formulas (2) and (3) mentioned in step S23.
Calculating the neighbor node importance NNI according to a formula (4) through the node importance NI node similarity SIM,
where Sim (u, v) is the similarity between node u and node v, and NI (v) is the importance of the node.
Preferably, in this embodiment, step S5 specifically includes:
step S51: tag propagation iterations by each participating insurance company
Step S52: and sequencing each client node according to the node importance NI calculated in the step S43, and constructing a node sequence for updating the label each time.
Step S53: for each client node, initializing the self label as b (u, 1), and 1 as the belonging coefficient of the belonging community.
Step S54: each node constructs a label set of itself according to the labels of the neighbor nodes
According to the node updating sequence determined in S52For each node u, updating the label of each node according to the neighbor node importance NNI calculated in the step S43 and the formula (5);
step S55: if it is not
And L is the label number of the current node, and the label is deleted from the label set.
Step S56: carrying out normalization operation on the community belonging coefficient of the node;
step S57: and circularly iterating the steps S54 to S56 until the found community is the same as the previous iteration, and obtaining a final community division result according to the labels of all the nodes, namely the node labels in the same community are the same.
Preferably, the invention also provides an insurance customer recommendation system based on federal label propagation, which comprises an overlapping customer identification module, a non-overlapping customer similarity calculation module, an overlapping customer information integration module based on privacy protection of a coordination terminal, a customer information updating module, an insurance customer community division module based on label propagation and an insurance customer recommendation module of the same community;
the overlapping client identification module is used for taking a plurality of insurance companies as each party A of the federation i Reading each participant insurance company client network G i For each participant, an RSA key pair is generated, and the RSA public key is sent to the other participants A i The insurance companies of the participants and the node ID matching protocol executing privacy protection carry out pairwise intersection calculation to obtain overlapping client sets of the participants, and the obtained intersection sets are subjected to union calculation to obtain overlapping client sets contained in the insurance companies, namely the local overlapping client sets of the participants;
the non-overlapping client similarity calculation module is used for removing the obtained overlapping client set from all the client sets locally at each party to obtain the non-overlapping node set of each party, traversing the local non-overlapping node sets of each party, and calculating the similarity between the non-overlapping client nodes of each insurance company through a formula;
the coordination terminal is used for randomly selecting one party insurance company to generate a homomorphic encryption algorithm key pair, the insurance company sends the key pair to other party insurance companies, then each party insurance company uses a hash algorithm to carry out hash mapping on each client node of a local overlapping client set, and uses a homomorphic encryption public key to encrypt an adjacent matrix constructed by a neighbor client which is corresponding to the overlapping client node and has the same interest; the coordinating end is used for the matrix A of each participant in a secret state i Adding, complementing the complete information of the overlapped nodes to obtain A, and carrying out A in a dense state 2 A 3 Obtaining the number of paths between the nodes by the operation of (1); finally, the hash overlapping node and the corresponding neighbor node information are respectively sent to each participating insurance company in a key value pair mode;
the client information updating module is used for obtaining original client nodes according to the node hash values of all the participant insurance companies, decrypting encrypted neighbor node information of the nodes by using a SEAL private key to obtain complete degree information of the nodes and complete path information among the nodes, and calculating node importance NI, node similarity SIM and neighbor client node importance NNI according to a formula;
the insurance client community division module based on label propagation carries out label propagation community discovery locally by each participant insurance company through NI, SIM and NNI calculated locally, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community discovered in the previous iteration, and finally obtains the division result of each community according to the label of each node, namely the same community is the same as the affiliated label of the client node;
and the insurance client recommendation module in the same community carries out accurate insurance recommendation service on insurance clients belonging to the same community according to the obtained community division result.
The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made in accordance with the claims of the present invention should be covered by the present invention.
Claims (4)
1. An insurance customer recommendation method based on federal label propagation is characterized by comprising the following steps
Step S1, taking a plurality of insurance companies as a party A of the federation i Reading each participant insurance company client network G i Carrying out encryption node matching to obtain an overlapped client set of each participant;
s2, according to all local client sets of all the participants, removing the overlapped client set obtained in the step S1 to obtain non-overlapped client node sets of all the participants, traversing the non-overlapped client node sets of all the participants, and calculating the similarity among the non-overlapped client nodes of all the insurance companies;
s3, the participant encrypts the adjacent matrixes of the nodes in a homomorphic way and sends the adjacent matrixes to the coordination terminal;
s4, the coordination end calculates the adjacent matrix of each participant in a secret state, and the participants combine the result sent back by the coordination end to locally calculate the node importance NI, the node similarity Sim and the neighbor node importance NNI;
s5, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community found in the previous iteration, and finally finds a community division result;
s6, performing insurance recommendation service on insurance company clients belonging to the same community according to the obtained community division result;
the step S2 specifically includes:
step S21: acquiring an overlapping client set;
step S22: for each party insurance company, obtaining a non-overlapping client node set through all local client sets and overlapping client sets;
step S23: each party insurance company traverses the non-overlapping client node set, and the similarity between local non-overlapping client nodes is calculated through the node similarity formulas (1) and (2);
wherein | p | represents the number of paths having a path length of α in which the node i and the node j are directly connected to each other, and N b All neighbors of the node are collected; the step S3 specifically comprises the following steps:
step S31: randomly selecting a party insurance company to generate a homomorphic encryption algorithm key pair;
step S32: the insurance company sends the key pair to the other participating insurance companies;
step S33: each participating insurance company performs hash mapping on each client node of the local overlapping client set by using a hash algorithm;
step S34: adjacent matrix A of each party insurance company to overlapping client nodes using homomorphic cryptographic public keys i Carrying out encryption;
step S35: overlapping customer nodes that each participating insurance company hashes and adjacency matrix A i Sending the data to a coordination end;
step S36: the coordination terminal adds the adjacent matrixes of all parties to obtain an adjacent matrix A of complete information in a secret state, and performs encryption matrix calculation in the secret state to obtain A 2 A 3 ；
Step S37: the coordination terminal sends the Hash overlapping client nodes and the updated encryption matrix to each participant insurance company respectively according to the Hash overlapping client nodes sent by each participant insurance company;
the step S4 specifically comprises the following steps:
step S41: each party insurance company obtains an original client node according to the node hash value;
step S42: each party insurance company decrypts the adjacency matrix using the SEAL private key;
step S43: each party insurance company updates the local subgraph by decrypting the adjacent matrix and calculates the node importance NI;
wherein k is u The degree of a node u in the subgraph, | N | is the total number of nodes;
each participant locally calculates the node similarity Sim according to the node similarity formulas (1) and (2) of the step S23;
calculating the neighbor node importance NNI according to the formula (4) through the node importance NI node similarity Sim,
wherein Sim (u, v) is the similarity between the node u and the node v, and NI (v) is the importance of the node v;
the step S5 specifically comprises the following steps:
step S51: each party insurance company carries out label propagation iteration;
step S52: sequencing each client node according to the node importance NI calculated in the step S43, and constructing a node sequence for updating the label each time;
step S53: for each client node, initializing a self label as b (u, 1), wherein 1 is a belonging coefficient of a belonging community;
step S54: each node constructs a label set of itself according to the labels of the neighbor nodes
According to the node sequence determined in the step S52, for each node u, updating the label of each node according to the neighbor node importance NNI calculated in the step S43 and the formula (5);
step S55: if it is used
Then the tag is deleted from the set of tags;
step S56: carrying out normalization operation on the belonging coefficient of the community to which the node belongs;
step S57: and circularly iterating the steps S54 to S56 until the found community is the same as the previous iteration, and obtaining a final community division result according to the labels of all the nodes, namely the node labels in the same community are the same.
2. The insurance client recommendation method based on federal label propagation according to claim 1, wherein the step S1 specifically comprises:
step S11: reading participant insurance company client set network G i ＝(V,E)；
Step S12: generating an RSA key pair for each participant, and sending the RSA public key to other participants;
step S13: the participator insurance companies and the execution privacy protection node ID matching protocol carry out pairwise intersection to obtain overlapped clients of the participator insurance companies;
step S14: and solving union between the obtained intersections to obtain an overlapping client set contained by the insurance company, namely the local overlapping client set of the participants.
3. An insurance customer recommendation system based on the federal label propagation based insurance customer recommendation method of claim 1 is characterized by comprising an overlapping customer identification module, a non-overlapping customer similarity calculation module, an overlapping customer information integration module based on privacy protection of a coordination terminal, a customer information updating module, an insurance customer community division module based on label propagation and an insurance customer recommendation module of the same community;
the above-mentionedOverlapping client identification modules for federating multiple insurance companies as respective parties A of a federation i Reading each participant insurance company client network G i For each participant, an RSA key pair is generated, and the RSA public key is sent to the other participants A i The insurance company of the participating party and the node ID matching protocol for executing privacy protection carry out pairwise intersection calculation to obtain the overlapped client sets of all the participating parties, and the union calculation is carried out between the obtained intersections to obtain the overlapped client sets contained by the insurance company, namely the local overlapped client sets of the participating parties;
the non-overlapping client similarity calculation module is used for removing the obtained overlapping client set to obtain a non-overlapping client node set of each party in all the local client sets of each participant, traversing the local non-overlapping client node sets of each party and calculating the similarity between the non-overlapping client nodes of each insurance company;
the coordination terminal is used for randomly selecting one party insurance company to generate a homomorphic encryption algorithm key pair, the insurance company sends the key pair to other party insurance companies, then each party insurance company uses a hash algorithm to carry out hash mapping on each client node of a local overlapping client set, and uses a homomorphic encryption public key to encrypt an adjacent matrix constructed by a neighbor client which is corresponding to the overlapping client node and has the same interest; the coordinating end is used for the matrix A of each participant in a secret state i Adding to obtain an adjacent matrix A of complete information, and calculating an encryption matrix in a secret state to obtain A 2 A 3 Obtaining the number of paths among the nodes; finally, the hash overlapping node and the corresponding neighbor node information are respectively sent to each participating insurance company in a key value pair mode;
the client information updating module is used for obtaining original client nodes according to the node hash values of all the participant insurance companies, decrypting encrypted neighbor node information of the nodes by using a SEAL private key to obtain integrity information of the nodes and complete path information among the nodes, and calculating node importance NI, node similarity Sim and neighbor node importance NNI according to a formula;
the insurance client community division module based on label propagation carries out label propagation community discovery locally by each participant insurance company through NI, sim and NNI calculated locally, each node iteratively updates the label of the node according to the label and the importance of the neighbor node until the label is the same as the community discovered in the previous iteration, and finally obtains the division result of each community according to the label of each node, namely the same community is the same as the label of the client node;
and the insurance client recommendation module in the same community carries out insurance recommendation service on insurance company clients belonging to the same community according to the obtained community division result.
4. An insurance client recommendation system based on federal label propagation as claimed in claim 3, wherein the coordinating peer is assumed to be operated by a third party trusted authority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110469727.4A CN113095946B (en) | 2021-04-28 | 2021-04-28 | Insurance customer recommendation method and system based on federal label propagation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110469727.4A CN113095946B (en) | 2021-04-28 | 2021-04-28 | Insurance customer recommendation method and system based on federal label propagation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113095946A CN113095946A (en) | 2021-07-09 |
| CN113095946B true CN113095946B (en) | 2022-10-04 |
Family
ID=76680879
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110469727.4A Expired - Fee Related CN113095946B (en) | 2021-04-28 | 2021-04-28 | Insurance customer recommendation method and system based on federal label propagation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113095946B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114936892B (en) * | 2022-04-24 | 2024-06-18 | 福州大学 | Offline commodity recommendation system and method based on federal migration learning label propagation |
| CN114615090B (en) * | 2022-05-10 | 2022-08-23 | 富算科技(上海)有限公司 | Data processing method, system, device and medium based on cross-domain label propagation |
| CN114638007B (en) * | 2022-05-10 | 2022-08-23 | 富算科技(上海)有限公司 | Method, system, device and medium for determining community relation based on graph data |
| CN115733763A (en) * | 2022-11-25 | 2023-03-03 | 中国银联股份有限公司 | Label propagation method and device for associated network and computer readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110909173A (en) * | 2019-11-13 | 2020-03-24 | 河海大学 | Non-overlapping community discovery method based on label propagation |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108428006A (en) * | 2017-10-25 | 2018-08-21 | 同济大学 | A kind of Internetwork link prediction technique based on common neighbor node and community structure |
| CN108364234A (en) * | 2018-03-08 | 2018-08-03 | 重庆邮电大学 | A kind of microblogging community discovery method propagated based on node influence power label |
| CN110738577B (en) * | 2019-09-06 | 2022-02-22 | 平安科技（深圳）有限公司 | Community discovery method, device, computer equipment and storage medium |
| CN111274485B (en) * | 2020-01-20 | 2023-05-02 | 北京工业大学 | Personalized recommendation method based on community discovery |
| CN112464107B (en) * | 2020-11-26 | 2023-03-31 | 重庆邮电大学 | Social network overlapping community discovery method and device based on multi-label propagation |
-
2021
- 2021-04-28 CN CN202110469727.4A patent/CN113095946B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110909173A (en) * | 2019-11-13 | 2020-03-24 | 河海大学 | Non-overlapping community discovery method based on label propagation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113095946A (en) | 2021-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113095946B (en) | Insurance customer recommendation method and system based on federal label propagation | |
| Zhao et al. | Machine learning based privacy-preserving fair data trading in big data market | |
| Hao et al. | Towards efficient and privacy-preserving federated deep learning | |
| WO2021197037A1 (en) | Method and apparatus for jointly performing data processing by two parties | |
| Chen et al. | When homomorphic encryption marries secret sharing: Secure large-scale sparse logistic regression and applications in risk control | |
| Liu et al. | Boosting privately: Federated extreme gradient boosting for mobile crowdsensing | |
| Liu et al. | Boosting privately: Privacy-preserving federated extreme boosting for mobile crowdsensing | |
| Erkin et al. | Privacy-preserving distributed clustering | |
| CN111967514B (en) | Sample classification method of privacy protection decision tree based on data packaging | |
| CN108737115A (en) | A kind of efficient privately owned property set intersection method for solving with secret protection | |
| Ma et al. | Secure multiparty learning from the aggregation of locally trained models | |
| CN115242371B (en) | Differential privacy-protected set intersection and base number calculation method, device and system thereof | |
| CN110380845A (en) | Quantum secret communication alliance chain method of commerce based on group's pool of symmetric keys, system, equipment | |
| CN114553883B (en) | Cloud edge end cooperative data acquisition and privacy protection method and system based on blockchain | |
| Liu et al. | Privacy-preserving data sharing scheme with fl via mpc in financial permissioned blockchain | |
| CN113094598B (en) | Video recommendation method and system based on federal group penetration | |
| EP4283917A1 (en) | Privacy-preserving clustering methods and apparatuses | |
| Saha et al. | Private equality test using ring-LWE somewhat homomorphic encryption | |
| CN114936892B (en) | Offline commodity recommendation system and method based on federal migration learning label propagation | |
| CN116402159A (en) | Federal learning method, federal learning prediction device, federal learning electronic device, and federal learning storage medium | |
| KR100995123B1 (en) | Methods and apparatuses for cipher indexing in order to effective search of ciphered-database | |
| CN113746621B (en) | Multi-chain architecture information sharing system based on block chain technology | |
| CN114462626A (en) | Federal model training method and device, terminal equipment and storage medium | |
| Hsu et al. | Construction of lightweight authenticated joint arithmetic computation for 5G IoT networks | |
| CN113407860A (en) | Privacy protection-based multi-social platform user recommendation method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20221004 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |