CN111382459A - Private data integration method and server - Google Patents
Private data integration method and server Download PDFInfo
- Publication number
- CN111382459A CN111382459A CN201910485170.6A CN201910485170A CN111382459A CN 111382459 A CN111382459 A CN 111382459A CN 201910485170 A CN201910485170 A CN 201910485170A CN 111382459 A CN111382459 A CN 111382459A
- Authority
- CN
- China
- Prior art keywords
- data
- algorithm
- server
- generated
- generation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000010354 integration Effects 0.000 title claims abstract description 35
- 239000002131 composite material Substances 0.000 claims abstract description 8
- 238000009826 distribution Methods 0.000 claims description 28
- 230000003044 adaptive effect Effects 0.000 claims description 4
- 230000003042 antagnostic effect Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 6
- 238000005265 energy consumption Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 101000964582 Homo sapiens Zinc finger protein 165 Proteins 0.000 description 1
- 102100040814 Zinc finger protein 165 Human genes 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 230000002194 synthesizing effect Effects 0.000 description 1
Images
Classifications
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Medical Informatics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The disclosure provides a private data integration method and a server. The privacy data integration method comprises the following steps. The first processing device and the second processing device respectively obtain a first generative model and a second generative model according to the first privacy data and the second privacy data. The server generates first generation data and second generation data through the first generation model and the second generation model respectively. The server integrates the first generated data and the second generated data to generate composite data.
Description
Technical Field
The disclosure relates to a private data integration method and a server.
Background
For some business purposes, companies may need to share customer data with each other. However, the fields of different customer data may be different, so data integration is a very difficult task. Therefore, it is necessary to provide a data integration method to perform the work of data integration.
Furthermore, the customer data may contain some private information. There may be concerns about revealing customer private data during the data integration process. Therefore, how to develop a data integration method with privacy protection has become an important development direction of big data technology.
Disclosure of Invention
The disclosure relates to a private data integration method and a server.
According to an embodiment of the present disclosure, a method for integrating private data is provided. The privacy data integration method comprises the following steps. The first processing device and the second processing device respectively obtain a first generative model and a second generative model according to the first privacy data and the second privacy data. The server generates first generation data and second generation data through the first generation model and the second generation model respectively. The server integrates the first generated data and the second generated data to generate composite data.
According to an embodiment of the present disclosure, a server is provided. The server is used for executing the privacy data integration method. The privacy data integration method comprises the following steps. First and second production data are generated by the first and second production models, respectively. The first generative model and the second generative model are obtained according to the first privacy data and the second privacy data respectively. And integrating the first generated data and the second generated data to generate composite data.
In order that the manner in which the above recited and other aspects of the present disclosure are obtained can be understood in detail, a more particular description of the disclosure, briefly summarized above, may be had by reference to the embodiments thereof which are illustrated in the appended drawings.
Drawings
FIG. 1 is an architecture of lateral data integration according to an embodiment;
FIG. 2A is a flow diagram illustrating one embodiment of a Database linking Algorithm (Database Join Algorithm) performing horizontal data integration;
FIG. 2B is a block diagram illustrating one embodiment of a Record Link Algorithm (Record Link Algorithm) performing horizontal data integration;
FIG. 2C is a flow diagram illustrating one embodiment of a Statistical matching Algorithm (Statistical Match Algorithm) performing horizontal data integration;
FIG. 3 illustrates a one-to-one processing device, a two-to-one processing device, and a server according to an embodiment;
FIG. 4 is a flow diagram of a method of private data integration, according to an embodiment;
FIG. 5 is a flow diagram of a database linking algorithm, record linking algorithm, or statistical matching algorithm, chosen in accordance with one embodiment;
FIG. 6 is a flowchart illustrating a process for obtaining a joint probability distribution according to one embodiment;
FIG. 7 is a joint probability distribution according to another embodiment.
Description of the symbols:
100: first processing device
200: second processing device
300: server
900: network
A. B, C, D, DA, EC, IC, ID, NR, X, Y, Z: field(s)
CT 53: linked list
GD 51: first generation data
GD 52: second generation data
GM 51: first generation model
GM 52: second generative model
HV 1: first hash value
HV 2: second hash value
LK: link scores
JPD53, JPD 53': joint probability distribution
NCT 53: noise list table
ND: noisy data
PD11, PD21, PD31, PD41, PD 51: first privacy data
PD12, PD22, PD32, PD42, PD 52: second privacy data
RV1, RV 2: random vector
S110, S120, S130, S131, S132, S133, S134, S135, S136, S140, S150: step (ii) of
SD13, SD23, SD33, SD43, SD 53: synthesizing data
SP 53: sampling data
Detailed Description
Please refer to fig. 1, which is a structure of horizontal data integration according to an embodiment. The first privacy data PD11 has a field Y and a field X, which include "(Y11, X11), (Y12, X12), (Y13, X13)", and the second privacy data PD12 has a field Z and a field X, which include "(Z21, X21), (Z22, X22), (Z23, X23)".
The first privacy data PD11 and the second privacy data PD12 may be integrated into a composite data SD13 having a field Y, X, Z. For example, the synthetic data SD13 includes "(y 31, x31, z31), (y32, x32, z32), (y33, x33, z 33)". The field Y, X of the synthesized data SD13 and the field Y, X of the first privacy data PD11 have similar joint probability distributions, and the field Z, X of the synthesized data SD13 and the field Z, X of the second privacy data PD12 have similar joint probability distributions. Therefore, the synthesized data SD13 may represent the first privacy data PD11 and the second privacy data PD12 at the same time.
In addition, "(y 11, x11), (y12, x12), (y13, x 13)" of the first privacy data PD11 and "(z 21, x21), (z22, x22), (z23, x 23)" of the second privacy data PD12 are not directly displayed in the synthesized data SD 13. Therefore, the result of data integration has a function of privacy protection.
Please refer to fig. 2A, which illustrates an embodiment of a Database linking Algorithm (Database Join Algorithm) for performing horizontal data integration. A first privacy data PD21 has fields EC, ID, IC. The field EC is an Energy Consumption Level (Energy Consumption Level), the field ID is a User identity (User Identification), and the field IC is an Income Level (Income Level). The user identity is a Direct Identifier column (Direct Identifier), and the energy consumption level and the income level are Indirect Identifier columns (Indirect Identifier column). The direct identification column may point directly to a person; and a non-direct identification column cannot point directly to a person. A second privacy data PD22 has fields NR, ID, IC. The field NR is the Total Number of Rooms (Total Number of Rooms). The total number of rooms is an indirect identification column. In the database link algorithm, a field ID and an IC are connection Key items (Joint keys). For example, the contents of the field ID of the first privacy data PD21 (or the second privacy data PD22) are filled in the field ID of a synthesized data SD 23. The contents of the field EC of the first privacy data PD21 are correspondingly filled in the field EC of the synthetic data SD23 in accordance with the contents of the field ID of the first privacy data PD 21. The content of the field NR of the second privacy data PD22 is correspondingly filled in the field NR of the synthetic data SD23 in accordance with the content of the field ID of the second privacy data PD 22. The contents of the field IC of the first privacy data PD21 (or the second privacy data PD22) are correspondingly filled in the field IC of the synthesized data SD23 in accordance with the contents of the field ID of the first privacy data PD21 (or the second privacy data PD 22).
Please refer to fig. 2B, which illustrates an embodiment of performing horizontal data integration by Record linking Algorithm (Record linking Algorithm). A first privacy data PD31 has fields EC, IC, DA. The field EC is the energy consumption level, the field IC is the income level, and the field DA is the total liability. The energy consumption level, income level and total liability are indirect identification columns. A second privacy data PD32 has fields NR, IC, DA. The field NR is the total number of rooms. The total number of rooms is an indirect identification column. In the record linking algorithm, the fields IC, DA are used to calculate a linking Score (linking Score) LK. For example, the linking score LK of the first column of the first privacy data PD31 and the first column of the second privacy data PD32 is 1.8. The first column of the first privacy data PD21 has a link score of 0.8 with the seventh column of the second privacy data PD 22. The first privacy data PD31 is linked with the second privacy data PD32 by a linking score LK to obtain synthesized data SD33 having fields EC, IC, NR.
Please refer to fig. 2C, which illustrates an embodiment of a Statistical matching Algorithm (Statistical Match Algorithm) performing horizontal data integration. The first privacy data PD41 has fields EC, IC, DA. The field EC is the energy expenditure level, the field IC is the income level, and the field DA is the total liability. The energy consumption level, income level and debt total are the indirect identification columns. A second privacy data PD42 has fields NR, IC, DA. The field NR is the total number of rooms. The total number of rooms is an indirect identification column. In the statistical matching algorithm, a common field DA is used to calculate an Absolute Value of Error (Absolute Value of Error). For example, the absolute value of the error with respect to 302 (the first column of the field DA of the first privacy data PD 41) is "2, 13, 189, 77, 49, 4, 142" for the field DA of the second privacy data PD 42. The absolute value of the error with respect to 310 (second column of the field DA of the first privacy data PD 41) is "189, 204, 2, 114, 240, 177, 49" for the field DA of the second privacy data PD 42. The first privacy data PD41 and the second privacy data PD42 are linked by the absolute values of the errors to obtain a synthesized data SD43 having fields EC, IC, NR.
Please refer to fig. 3 to 4. Fig. 3 shows a first processing device 100, a second processing device 200, and a server 300 according to an embodiment. FIG. 4 is a flow diagram of a method of private data integration, according to an embodiment. The first processing device 100 and the second processing device 200 are, for example but not limited to, a computer, a chip or a circuit board. The first processing device 100 is installed in one company, and the second processing device 200 is installed in another company. The server 300 is, for example but not limited to, a computer, a cloud Computing center, a Computing Cluster System (Computing Cluster System) or an Edge Computing System (Edge Computing System). The server 300 is provided to a third party. The first processing device 100 and the server 300 may communicate via the network 900, and the second processing device 200 and the server 300 may communicate via the network 900. The private data matching method is described with reference to the first processing device 100, the second processing device 200, and the server 300.
In step S110, the first processing device 100 and the second processing device 200 respectively obtain a first generation model GM51 and a second generation model GM52 according to a first privacy data PD51 and a second privacy data PD 52. For example, the first privacy data PD51 has a field A, B, C and the second privacy data PD52 has a field D, B, C. The generative model is that given a target value of Y variable "Y", X variable is a conditional probability (i.e., X | Y ═ Y) c that a category content of the first privacy data PD51 or the second privacy data PD52 is converted into a numerical content. The first privacy data PD51 and the second privacy data PD52 are not directly transmitted to the server 300. In fact, only the parameters of the first generative model GM51 and the parameters of the second generative model GM52 are transmitted to the server 300.
Next, in step S120, the server 300 generates the first and second generated data GD51 and GD52 using the first and second generated models GM51 and GM 52. The first generation model GM51 or the second generation model GM52 is obtained by a generation Algorithm (generic Algorithm), such as a variant Auto-Encoder (VAE) Algorithm, a Generic Adaptive Network (GAN) Algorithm, an information-generating antagonistic Network (Info-GAN), an AAE Algorithm, or an ALI Algorithm. In this step, after a random vector RV1 is input to the first generation model GM51, the first generation model GM51 outputs first generation data GD 51. The first generated data GD51 is not identical to the first privacy data PD51, but has a similar joint probability distribution. After another random vector RV2 is input to the second generative model GM52, the second generative model GM52 outputs second generative data GD 52. The second generated data GD52 is not identical to the second privacy data PD52, but has a similar joint probability distribution.
Then, in step S130, the server 300 integrates the first generated data GD51 and the second generated data GD52 to obtain a combined data SD 53. In step S130, the first generated data GD51 and the second generated data GD52 may be obtained through a database linking algorithm (e.g., the manner described in fig. 2A), a record linking algorithm (e.g., the manner described in fig. 2B), or a statistical matching algorithm (e.g., the manner described in fig. 2C). The final synthesized data SD53 contains category contents that were converted into numerical contents.
Referring now to FIG. 5, a flowchart illustrating a database linking algorithm, record linking algorithm, or statistical matching algorithm selected according to one embodiment is shown. In step S131, the server 300 obtains a First Hash Value (First Hash Value) HV1 (shown in fig. 3) of the First private data PD51 and a Second Hash Value (Second Hash Value) HV2 (shown in fig. 3) of the Second private data PD52 from the First processing apparatus 100 and the Second processing apparatus 200. The first hash value HV1 is obtained by encoding the content of a directly identified column or a representative indirectly identified column of the first privacy data PD 51. The second hash value HV2 is obtained by encoding the content of a directly identified column or a representative indirectly identified column of the second privacy data PD 52.
In step S132, the server 300 compares the first hash value HV1 with the second hash value HV2 to determine whether the overlapping ratio of the first generated data GD51 and the second generated data GD52 is higher than a predetermined value. The overlapping rate of the first generated data GD51 and the second generated data GD52 is a ratio of the repeated contents. If the overlap ratio is not higher than the predetermined value, the process goes to step S136; if the overlap ratio is higher than the predetermined value, the process proceeds to step S133.
In step S133, the server 300 determines whether the first generated data GD51 and the second generated data GD52 have at least one connection Key (Joint Key). If the first generated data GD51 and the second generated data GD52 have a connection key item, proceed to step S134; if the first generated data GD51 and the second generated data do not have the connection key item, the process proceeds to step S135.
In step S134, the server 300 integrates the first generated data GD51 and the second generated data GD52 by using a database linking algorithm (the method described in fig. 2A).
In step S135, the server 300 integrates the first generated data GD51 and the second generated data GD52 by using a record linking algorithm (the method described in fig. 2B). In this step, the recording link algorithm is adopted to integrate the first generated data GD51 with the second generated data GD52 without using the connection key item.
In step S136, the server 300 integrates the first generated data GD51 and the second generated data GD52 by using a statistical matching algorithm (the method described in fig. 2C).
In step S140 of fig. 4, the server 300 obtains a joint probability Distribution (join probability Distribution) JPD53 of the synthesized data SD 53. In step S140, a noise data ND is added to the joint probability distribution JPD 53. Referring to fig. 6, a process of obtaining a joint probability distribution JPD53 according to an embodiment is described. First, the synthetic data SD53 is converted into a linked list (containment Table) CT 53. The number of times of various combinations of fields EC, IC, NR is filled in the listing table CT 53. Then, the noise data ND is added to the netlist CT53 to obtain a noise netlist (noise contignance Table) NCT 53. Then, the degree of the noise list NCT53 is converted into a probability value to obtain a joint probability distribution JPD 53.
Furthermore, in another embodiment, the dimension of the joint probability distribution JPD53 may be reduced. Please refer to fig. 7, which shows a joint probability distribution JPD 53' according to another embodiment. The joint probability distribution JPD53 of dimension 3 is converted into a joint probability distribution JPD 53' of dimension 2. Therefore, the complexity can be reduced from 5A 3 to 5A 2+ 5A 2, so that the operation load and the operation time can be effectively reduced.
Next, in step S150 of fig. 4, the server 300 samples the resultant data SD53 according to the joint probability distribution JPD53 (or the joint probability distribution JPD 53') to obtain a sampled data SP 53. The content of the sampled data SP53 approximates the content of the first privacy data PD51 and the second privacy data PD 52.
According to the privacy data integration method described above, the sample data SP53 is obtained by integration of the first privacy data PD51 and the second privacy data PD 52. The sampled data SP53 can represent the approximate contents of the first privacy data PD51 and the second privacy data PD52, but without revealing any privacy data of the client. This is quite useful for big data technologies. Furthermore, the amount of private data is not intended to limit the present disclosure. For example, three or more than three private data may also be performed by the above-mentioned private data integration method.
In summary, although the present disclosure has been described with reference to the above embodiments, the disclosure is not limited thereto. Various modifications and alterations may occur to those skilled in the art without departing from the spirit and scope of the disclosure. Therefore, the protection scope of the present disclosure should be determined by the following claims.
Claims (22)
1. A method for integrating private data is characterized in that the method for integrating private data comprises the following steps:
the first processing device and the second processing device respectively obtain a first generative model and a second generative model according to the first privacy data and the second privacy data;
the server generates first generating data and second generating data through the first generating model and the second generating model respectively; and
the server integrates the first generated data and the second generated data to generate composite data.
2. The private data integration method of claim 1, wherein in the step of obtaining the first Generative model and the second Generative model, the first Generative model or the second Generative model is obtained by a variational auto-Encoder (VAE) algorithm, a Generative Adaptive Network (GAN) algorithm, an information-Generative adaptive Network (Info-GAN), an AAE algorithm, or an ALI algorithm.
3. The method according to claim 1, wherein in the step of obtaining the first generative model and the second generative model, the category content of the first private data or the second private data is converted into numerical content, and the composite data includes the category content.
4. The private data integration method of claim 1, wherein the step of integrating the first generated data and the second generated data comprises:
if the first generation data and the second generation data have at least one connection Key item (Joint Key), integrating the first generation data and the second generation data by adopting a Database link Algorithm (Database Join Algorithm).
5. The private data integration method of claim 4, wherein the step of integrating the first generated data and the second generated data comprises:
if the overlapping rate of the first generated data and the second generated data is not higher than the predetermined value, a Statistical matching Algorithm (Statistical Match Algorithm) is used to integrate the first generated data and the second generated data.
6. The private data integration method of claim 5, wherein the step of integrating the first generated data and the second generated data comprises:
if the overlapping rate of the first generation data and the second generation data is higher than a predetermined value and the first generation data and the second generation data do not have the connection key item, integrating the first generation data and the second generation data by using a Record linking Algorithm (Record linking Algorithm).
7. The private data syndication method according to claim 1, further comprising:
a Joint Probability Distribution (Joint Probability Distribution) of the synthetic data is obtained.
8. The method of claim 7, wherein the joint probability distribution is transformed to reduce dimensionality.
9. The method of claim 7, wherein in the step of obtaining the joint probability distribution, noise data is added to the joint probability distribution.
10. The private data syndication method according to claim 7, further comprising:
the resultant data is sampled to obtain a sampled data.
11. The privacy data integration method according to claim 10, wherein contents of the sample data approximate contents of the first privacy data and contents of the second privacy data.
12. A server for performing a private data integration method, the private data integration method comprising:
generating first generating data and second generating data through a first generating model and a second generating model respectively, wherein the first generating model and the second generating model are obtained according to first privacy data and second privacy data respectively; and
the first generated data and the second generated data are integrated to generate composite data.
13. The server of claim 12, wherein the first generative model or the second generative model is obtained by a Variational Auto-Encoder (VAE) algorithm, a Generative Adaptive Network (GAN) algorithm, an information-generating antagonistic Network (Info-GAN), an AAE algorithm, or an ALI algorithm.
14. The server according to claim 12, wherein category contents of the first privacy data or the second privacy data are converted into numerical contents, and the composite data contains the category contents.
15. The server of claim 12, wherein the step of integrating the first generated data and the second generated data comprises:
if the first generation data and the second generation data have at least one connection Key item (Joint Key), integrating the first generation data and the second generation data by adopting a Database link Algorithm (Database Join Algorithm).
16. The server of claim 15, wherein the step of integrating the first generated data and the second generated data comprises:
if the overlapping rate of the first generated data and the second generated data is not higher than the predetermined value, a Statistical matching Algorithm (Statistical Match Algorithm) is used to integrate the first generated data and the second generated data.
17. The server of claim 16, wherein the step of integrating the first generated data and the second generated data comprises:
if the overlapping rate of the first generation data and the second generation data is higher than a predetermined value and the first generation data and the second generation data do not have the connection key item, integrating the first generation data and the second generation data by using a Record linking Algorithm (Record linking Algorithm).
18. The server of claim 12, wherein the private data syndication method further comprises:
a Joint Probability Distribution (Joint Probability Distribution) of the synthetic data is obtained.
19. The server of claim 18 wherein the joint probability distribution is transformed to reduce dimensionality.
20. The server of claim 18, wherein in the step of obtaining the joint probability distribution, noise data is added to the joint probability distribution.
21. The server of claim 18, wherein the private data syndication method further comprises:
the resultant data is sampled to obtain sampled data.
22. The server of claim 18, wherein the content of the sampled data approximates the content of the first private data and the content of the second private data.
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/234,203 | 2018-12-27 | ||
| US16/234,203 US11138327B2 (en) | 2018-12-27 | 2018-12-27 | Privacy data integration method and server |
| TW108116621 | 2019-05-14 | ||
| TW108116621A TWI706344B (en) | 2018-12-27 | 2019-05-14 | Privacy data integration method and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111382459A true CN111382459A (en) | 2020-07-07 |
| CN111382459B CN111382459B (en) | 2022-05-17 |
Family
ID=71216953
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910485170.6A Active CN111382459B (en) | 2018-12-27 | 2019-06-05 | Private data integration method and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111382459B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070143289A1 (en) * | 2005-12-16 | 2007-06-21 | Microsoft Corporation | Differential data privacy |
| CN107273755A (en) * | 2016-04-07 | 2017-10-20 | 良好科技控股有限公司 | Control the access of application data |
| CN107368752A (en) * | 2017-07-25 | 2017-11-21 | 北京工商大学 | A kind of depth difference method for secret protection based on production confrontation network |
| CN109033873A (en) * | 2018-07-19 | 2018-12-18 | 四川长虹智慧健康科技有限公司 | A kind of data desensitization method preventing privacy compromise |
-
2019
- 2019-06-05 CN CN201910485170.6A patent/CN111382459B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070143289A1 (en) * | 2005-12-16 | 2007-06-21 | Microsoft Corporation | Differential data privacy |
| CN107273755A (en) * | 2016-04-07 | 2017-10-20 | 良好科技控股有限公司 | Control the access of application data |
| CN107368752A (en) * | 2017-07-25 | 2017-11-21 | 北京工商大学 | A kind of depth difference method for secret protection based on production confrontation network |
| CN109033873A (en) * | 2018-07-19 | 2018-12-18 | 四川长虹智慧健康科技有限公司 | A kind of data desensitization method preventing privacy compromise |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111382459B (en) | 2022-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8595171B2 (en) | System and method for rule set validation | |
| CN112884092B (en) | AI model generation method, electronic device, and storage medium | |
| US8214232B2 (en) | Healthcare insurance claim fraud detection using datasets derived from multiple insurers | |
| CN107944481B (en) | Method and apparatus for generating information | |
| CN107886414B (en) | Order combination method and equipment and computer storage medium | |
| CN104967620A (en) | Access control method based on attribute-based access control policy | |
| Kleijnen et al. | Validation of trace-driven simulation models: a novel regression test | |
| CN109582550B (en) | Method, device and server for acquiring full-service scene fault set | |
| CN111694926A (en) | Interactive processing method and device based on scene dynamic configuration and computer equipment | |
| CN112995201B (en) | Resource value evaluation processing method based on cloud platform and related device | |
| EP3503004A1 (en) | Method and system for evaluating user portrait data | |
| CN110633571A (en) | Efficient online checking method and device for information system security configuration | |
| WO2019041913A1 (en) | Insurance data processing method and apparatus, computer device and storage medium | |
| CN107395623B (en) | Interface access data verification method and device, computer storage medium and equipment | |
| KR20200019741A (en) | Data Analysis Support System and Data Analysis Support Method | |
| CN111783830A (en) | Retina classification method and device based on OCT, computer equipment and storage medium | |
| CN111382459B (en) | Private data integration method and server | |
| TWI706344B (en) | Privacy data integration method and server | |
| CN112949866A (en) | Poisson regression model training method and device, electronic equipment and storage medium | |
| CN114595470A (en) | Data processing method and device | |
| CN113869996A (en) | Stepped credit analysis measuring and calculating method, device, equipment and medium | |
| CN115545088A (en) | Model construction method, classification method and device and electronic equipment | |
| CN110096266B (en) | Feature processing method and device | |
| CN113592529A (en) | Potential customer recommendation method and device for bond products | |
| EP3142019A1 (en) | Data integration method and device |
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 |