A data processing system for acquiring a target portrait label based on an extended quantity ID

Abstract

The application provides a data processing system for obtaining a target portrait label based on an expanded ID, which comprises a processor and a memory storing a computer program, and when the computer program is executed by the processor, the following steps are implemented: receiving a data expansion request, obtaining an initial user ID list sent by a first data platform, obtaining a first intermediate expanded ID list according to the initial user ID list, obtaining a second target expanded ID list according to the first intermediate expanded ID list, obtaining a second intermediate expanded ID list according to the second target expanded ID list and performing deduplication to obtain a first key expanded ID list, obtaining a third intermediate expanded ID list and performing deduplication to obtain a second key expanded ID list, and obtaining a target portrait label corresponding to the initial user according to the first key expanded ID list and the second key expanded ID list. The application avoids the leakage of information of both parties based on the fuzzing expansion of the initial user ID.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of user ID technology processing, and particularly relates to a data processing system for obtaining target portrait tags based on extended ID. BACKGROUND

[0002] With the popularity and development of big data, how to use big data to promote economic development, improve social governance and enhance the government's service and regulatory capacity has become a trend in the global range. Network data technology is constantly progressing, and user ID information is stored in various databases. When data interaction occurs between two or more parties, there is a risk of personal information leakage. How to encrypt and protect user ID information in the database during data interaction and effectively obtain user ID tags has become a hot research topic.

[0003] At present, in the prior art, the method for obtaining portrait tags is as follows: obtaining a target extended ID list according to an initial ID, inputting the target extended ID list into a first database, and performing fuzzification on the initial ID and the target extended ID in the first database to avoid the initial ID being decrypted by a third party. The above-mentioned method for obtaining portrait tags has the following problems:

[0004] On the one hand, when the initial ID and the extended ID are fuzzified, the critical value of the number of extended quantities and the number of fuzzification strings is not considered, so that when the number of second extended IDs sent from a second data platform is too large, the running efficiency is low and the obtained portrait tags are confused.

[0005] On the other hand, the corresponding relationship between the number of initial user IDs and the number of fuzzification bits is not considered, and the case that the same number of user IDs can be matched when the number of extended quantities and the number of fuzzification bits are different is not considered. SUMMARY

[0006] In view of the above technical problems, the technical scheme adopted by the present application is as follows: a data processing system for obtaining target portrait tags based on extended ID, the system comprising: a processor and a memory storing a computer program, when the computer program is executed by the processor, the following steps are implemented:

[0007] S100, receiving a tag obtaining request, obtaining an initial user ID list A={A1, A2,..., An} sent by a first data platform, An is the i-th initial user ID, i=1, 2,..., n, n is the number of initial user IDs. i ,..., An}, An is the i-th initial user ID, i=1, 2,..., n, n is the number of initial user IDs. n i

[0008] S200, obtaining a first intermediate extended ID set A' corresponding to A, A'={A'1, A'2,..., A'n}, A'n is the i-th first intermediate extended ID, i=1, 2,..., n, n is the number of first intermediate extended IDs. i ​​..., A' n}, A' i = {A' i1 , A' i2 ..., A' ir ..., A' iz}, A' ir = (A' 1 ir , A' 2 ir ..., A' y ir ..., A' q ir ), A' y ir is A i the initial value corresponding to the y-th sequence bit in the r-th first intermediate expanded ID, y = 1, 2,..., q, q is the number of initial values in the first intermediate expanded ID, and r = 1, 2,..., z, z is the number of first intermediate expanded IDs.

[0009] S300, according to A', the first target expanded ID set BA' corresponding to A' is obtained, BA' = {BA'1, BA'2,..., BA' i ..., BA' n}, BA' i = {BA' i1 , BA' i2 ..., BA' ir ..., BA' iz}, BA' ir = (A' 1 ir , A' 2 ir ..., A' δ ir ), A' δ ir is A' ir the initial value corresponding to the δ-th sequence bit in A' and δ ≤ q.

[0010] S400, according to BA', the second intermediate expanded ID set AX corresponding to BA' is obtained, AX = {AX1, AX2,..., AX i ..., AX n}, AX i = {AX i1 , AX i2 ..., AX ic ..., AX id(i)}, AX ic = {AX 1 ic , AX 2ic ..., AX θ ic ..., AX η ic ..., AX θ ic for BA' i the θth second intermediate expansion ID in the corresponding cth second intermediate expansion ID list, θ = 1, 2,..., η, η is the number of second intermediate expansion ID lists corresponding to BA' i the number of second intermediate expansion IDs in the corresponding cth second intermediate expansion ID list, c = 1, 2,..., d(i), d(i) is the number of first key expansion IDs corresponding to BA' i the number of second intermediate expansion ID lists corresponding to BA'.

[0011] S500, according to AX, obtaining a first key expansion ID set AX corresponding to AX 0 ={AX 0 1, AX 0 2,..., AX 0 i ..., AX

[0012] AX 0 n ..., AX 0 i ={AX 0 i1 , AX 0 i2 ,..., AX 0 ic ,..., AX 0 id(i) ..., AX 0 ic ={AX 1 ic , AX 2 ic ,..., AX θ-1 ic , AX

[0013] θ+1 ic ,..., AX η ic}, wherein AX 0 ic is deleted from AX θ ic = A' ir when AX ic θ ic is obtained.

[0014] ​S600, Based on A, obtain the second key expansion ID set YA = {YA1, YA2, ..., YA} corresponding to A. i , ..., YA n}, YA i ={YA 1 i YA 2 i , ..., YA u i , ..., YA ψ i}, YA u i For A i The u-th second key expansion ID in the corresponding second key expansion ID list, u = 1, 2, ..., ψ, where ψ is A i The number of corresponding second key expansion IDs.

[0015] S700, based on YA and AX 0 Obtain the target profile label corresponding to A.

[0016] This invention provides a data processing system for obtaining target profile tags based on augmented IDs. The system includes a processor and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps: receiving a data augmentation request; obtaining an initial user ID list sent by a first data platform; obtaining a first intermediate augmented ID list corresponding to the initial user ID list; obtaining a first target augmented ID list corresponding to the first intermediate augmented ID list; obtaining a second target augmented ID list corresponding to the first intermediate augmented ID list; obtaining a second intermediate augmented ID list corresponding to the second target augmented ID list; performing deduplication processing on the second intermediate augmented ID list to obtain a first key augmented ID list corresponding to the second intermediate augmented ID list; obtaining a second key augmented ID list corresponding to the third intermediate augmented ID list corresponding to the initial user ID list; and obtaining the target profile tag corresponding to the initial user based on the first key augmented ID list and the second key augmented ID list. It can be seen that, on the one hand, when obfuscating the initial user ID and the expanded ID, the critical value between the expanded quantity and the number of obfuscated strings is taken into account, ensuring the number of expanded IDs sent by the second data platform, thus making the operation more efficient and avoiding the situation of chaotic obtained profile tags; on the other hand, the correspondence between the initial user ID expanded quantity and the number of obfuscated bits is taken into account, considering the situation where the same number of user IDs can be matched even when the expanded quantity and the number of obfuscated bits are different. Attached Figure Description

[0017] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings needed in the embodiment description. Obviously, the drawings in the following description only show some of the embodiments of the present application, and other drawings can be obtained by those skilled in the art without any creative effort.

[0018] Figure 1 The flowchart of the computer program executed by the data processing system for obtaining the target portrait label based on the expanded ID is provided for the embodiments of the present application.

[0019] Figure 2 The flowchart of S700 is provided for the embodiments of the present application. DETAILED DESCRIPTION

[0020] The technical solutions in the embodiments of the present application will be described clearly and completely in the following with reference to the drawings of the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, not all. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without any creative effort are within the scope of the present application.

[0021] It should be noted that the terms "first", "second" and the like in the specification and claims of the present application and the above drawings are used to distinguish similar objects, and do not necessarily indicate a specific order or a chronological sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or server including a series of steps or units does not necessarily have to include those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to the process, method, product or device.

[0022] The present application provides a data processing system for obtaining a target portrait label based on an expanded ID, which comprises a processor and a memory storing a computer program, when the computer program is executed by the processor, the following steps are implemented, as shown in Figure 1

[0023] S100, receiving a label obtaining request, obtaining an initial user ID list A={A1, A2,..., An} sent by a first data platform, An is an initial user ID, i=1, 2,..., n, n is the number of initial user IDs. i n i An is the i-th initial user ID, i=1, 2,..., n, n is the number of initial user IDs.​​​

[0024] Specifically, the initial user ID represents a unique identifier of the initial user's identity. For example, the initial user ID is the SIM card number corresponding to the initial user's mobile device.

[0025] Specifically, the tag acquisition request is a request issued by the first data platform to acquire user tags.

[0026] Furthermore, the first data platform is the data platform corresponding to the party that obtains the user tags.

[0027] Specifically, the value of n ranges from 80 to 120. Those skilled in the art can select the number of initial user IDs according to actual needs, which will not be elaborated here.

[0028] As described above, by setting a critical value for the number of initial user IDs, it is possible to ensure improved operating efficiency when the computer is executed by the processor, and to avoid situations where the operating efficiency is reduced or the computer cannot operate due to an excessive amount of initial user ID data sent by the first data platform.

[0029] S200, Obtain the first intermediate expansion ID set A' = {A'1, A'2, ..., A'} corresponding to A. i , ..., A' n}, A' i ={A' i1 A' i2 , ..., A' ir , ..., A' iz}, A' ir =(A' 1 ir A' 2 ir , ..., A' y ir , ..., A' q ir ), A' y ir For A i The initial value corresponding to the y-th sequence position in the r-th first intermediate expansion ID, y = 1, 2, ..., q, where q is the number of initial values ​​in the first intermediate expansion ID, and r = 1, 2, ..., z, where z is the number of first intermediate expansion IDs.

[0030] Specifically, the number of initial values ​​in the first intermediate expansion ID is the same as the number of initial values ​​in the initial user ID.

[0031] Specifically, the first intermediate expansion ID is a randomly generated user ID that is inconsistent with the initial user ID, wherein the type of the first intermediate expansion ID is consistent with the type of the initial user ID.

[0032] Specifically, A' i1 ≠A' i2 ≠……≠A' ir ≠……≠A' iτ ≠……≠A' iz .

[0033] S300, Based on A', obtain the first target expansion ID set BA' = {BA'1, BA'2, ..., BA'} corresponding to A'. i , ..., BA' n}, BA' i ={BA' i1 BA' i2 , ..., BA' ir , ..., BA' iz}, BA' ir =(A' 1 ir A' 2 ir , ..., A' δ ir ), A' δ ir For A' ir The initial value corresponding to the δth sequence position in the sequence, where δ≤q; can be understood as: from A' ir Select the initial values ​​corresponding to the first δ positions in the sequence to construct BA'. ir .

[0034] S400, Based on BA', obtain the second intermediate expansion ID set AX = {AX1, AX2, ..., AX'} corresponding to BA'. i , ..., AX n}, AX i ={AX i1 AX i2 , ..., AX ic , ..., AX id(i)}, AX ic ={AX 1 ic AX 2 ic , ..., AX θ ic , ..., AX η ic}, AX θ ic for BA' i The corresponding c-th second intermediate expansion ID is the θ-th second intermediate expansion ID in the list, where θ = 1, 2, ..., η, and η is BA'. iThe corresponding number of second intermediate expansion IDs in the c-th second intermediate expansion ID list, c = 1, 2, ..., d(i), where d(i) is BA' i The number of corresponding second intermediate expansion ID lists.

[0035] Specifically, the S400 also includes the following steps to obtain AX. θ ic :

[0036] S401, perform deduplication on BA' and obtain the second target expansion ID set TA' = {TA'1, TA'2, ..., TA'} corresponding to BA'. i , ……, TA' n},TA' i ={TA' i1 ,TA' i2 , ……, TA' ic , ……, TA' id(i)},TA' ic for BA' i The c-th second target expansion ID in the corresponding second target expansion ID list; any deduplication method known to those skilled in the art falls within the protection scope of this invention, and will not be elaborated here.

[0037] As mentioned above, by deduplicating the obtained first target expansion ID, the amount of data can be reduced, which can improve the efficiency of subsequent matching and avoid repeated expansion due to data duplication.

[0038] S403, according to TA' ic Get AX θ ic =(TA' ic AX θ1 ic , ..., AX θγ ic , ..., AX θξ ic ), AX θγ ic For AX θ ic The adjustment value corresponding to the γth sequence position, γ = 1, 2, ..., ξ, where ξ is AX θ ic The number of adjustment values.

[0039] Specifically, any of the adjustment values ​​mentioned can be any value between 0 and 9.

[0040] Furthermore, ξ = q - δ.

[0041] Furthermore, AX θγic any value in [L1, L2], wherein L1 is a lower limit value of each value in the initial user ID corresponding to the type of the initial user ID, and L2 is an upper limit value of each value in the initial user ID corresponding to the type of the initial user ID, and a person skilled in the art knows how to determine the lower limit value and the upper limit value of each value in the ID according to the type of the ID, which will not be described here again. For example, when the initial user ID is a SIM card number corresponding to the mobile device of the initial user, L1 = 0 and L2 = 9.

[0042] Specifically, AX 1 ic ≠ AX 2 ic ≠ … ≠ AX θ ic ≠ … ≠ AX η ic It can be understood that: based on AX θ1 ic to AX θξ ic , different second intermediate expanded ID is generated.

[0043] Further, η = C ξ q and W1 / z ≤ η ≤ W2 / z, wherein W1 is a lower limit value of the number of the first expanded ID, and W2 is an upper limit value of the number of the first expanded ID.

[0044] Further, p(i) = η × z.

[0045] S500, according to AX, the first key expanded ID set AX 0 = {AX 0 1, AX 0 2, …, AX 0 i , …,

[0046] AX 0 n}, AX 0 i = {AX 0 i1 , AX 0 i2 , …, AX 0 ic , …, AX 0 id(i)}, AX 0 ic = {AX 1 ic , AX 2 ic , …, AX θ-1 icAX

[0047] θ+1 ic , ..., AX η ic}, where AX 0 ic For when AX θ ic =A' ir At that time, from AX ic Delete AX θ ic Obtained.

[0048] S600, Based on A, obtain the second key expansion ID set YA = {YA1, YA2, ..., YA} corresponding to A. i , ..., YA n}, YA i ={YA 1 i YA 2 i , ..., YA u i , ..., YA ψ i}, YA u i For A i The u-th second key expansion ID in the corresponding second key expansion ID list, u = 1, 2, ..., ψ, where ψ is A i The number of corresponding second key expansion IDs.

[0049] Specifically, the S600 also includes the following steps:

[0050] S601, Based on A, obtain the first ID set CA = {CA1, CA2, ..., CA} corresponding to A. i , ..., CA n}, CA i For A i The corresponding first ID list; specifically, the steps in S601 can be referred to the steps in S300, and will not be repeated here.

[0051] S603, Based on CA, obtain the intermediate ID set CA' = {CA'1, CA'2, ..., CA'} corresponding to CA. i , ..., CA' n};CA' i For A i The corresponding intermediate ID list; specifically, the steps in S603 can be referred to the steps in S400, and will not be repeated here.

[0052] S605, according to the CA', the second key expansion ID set YA corresponding to CA' is obtained; specifically, the steps of S605 can refer to the steps of S500, which will not be repeated here.

[0053] The above, by adjusting the sequence bit of each first intermediate expansion ID corresponding to the initial user ID, increasing the adjustment value, can ensure the subsequent decryption of the first intermediate expansion ID, so that the initial user ID cannot be decrypted when the second intermediate expansion ID is decrypted, and the security of the first expansion ID data is ensured.

[0054] S700, according to YA and AX 0 , the target portrait label corresponding to A is obtained.

[0055] Specifically, S700 further includes the following steps, as shown in Figure 2 :

[0056] S701, YA i and AX 0 ic are inserted into LA' i , the first expansion ID set LA corresponding to A sent by the first data platform is obtained LA={LA1, LA2, …, LA i , …, LA n}, LA i ={A i , LA' i}, LA' i ={LA 1 i , LA 2 i , …, LA x i , …, LA p(i) i}, LA x i is the xth first expansion ID corresponding to A i , x=1, 2, …, p(i), p(i) is the number of first expansion IDs corresponding to A i .

[0057] S703, send LA to the second data platform, obtain the second expansion ID set B corresponding to LA sent by the second data platform B={B1, B2, …, B i , …, B n}, B i ={B i1 , B i2 , …, B ij , …, B imand B corresponds to the intermediate image label set DB = {DB1, DB2, …, DB i , …, DB n}, DB i = {DB i1 , DB i2 , …, DB ij , …, DB im}, B ij is the jth second expansion ID corresponding to LA i , DB ij is the B ij corresponding to the intermediate image label list, j = 1, 2, …, m, and m is the number of second expansion IDs.

[0058] Specifically, the second data platform is a data platform corresponding to a provider of user labels.

[0059] Specifically, m satisfies the following condition:

[0060] m = p(i) + 1.

[0061] Specifically, S703 further includes the following steps:

[0062] S7031, obtaining the sample ID list C = {C1, C2, …, C g , …, C s} sent by the second data platform, wherein C g is the gth sample ID, g = 1, 2, …, s, and s is the number of sample IDs.

[0063] Further, the sample ID refers to a user ID stored in the second data platform in the second data platform, wherein the type of the sample ID is consistent with the type of the initial user ID, that is, when the initial user ID is a SIM card number corresponding to a mobile device of an initial user, the sample ID is a SIM card number corresponding to a mobile device of a sample user.

[0064] S7032, traversing C and when A i = C g , inserting C g as a second expansion ID into B i and obtaining the key ID list D g = {D g1 , D g2 , …, D gt , …, D gk} corresponding to C gt , D g is the tth key ID corresponding to C g , t = 1, 2, …, k, and k is the number of key IDs.

[0065] Further, C g The corresponding key ID is when A i = C g , C g is deleted from C

[0066] Further, k satisfies the following condition:

[0067] k = s - 1.

[0068] S7033, traverse D g , and when LA x i = D gt , D gt is inserted into value B i as the second expansion ID.

[0069] S7034, get the sample label set C' = {C'1, C'2, …, C' g , …, C' s} corresponding to C g , C' g is the sample label list corresponding to C

[0070] Further, the sample label list is a label list constructed by all portrait labels of the user corresponding to the sample ID.

[0071] S7035, when A i = C g , C' g is inserted into value DB i as the intermediate portrait label list and get the key label set D' = {D' g1 , D' g2 , … D' gt , …, D' gk} corresponding to C' g , D' g is the key label list corresponding to the D gt th. gt

[0072] Further, any D' g key label list is when A i = C g , C' g is deleted from C'

[0073] S7036, when LA x i = D gt , D' gt ​DB is inserted as an intermediate image tag list. i middle.

[0074] As described above, by comparing the processed initial user ID with the sample ID, the second expanded ID list corresponding to the processed initial user ID and the sample tag set corresponding to the second expanded ID list are obtained. During this process, the second data platform cannot know the information of the initial user ID, thus keeping the initial user ID confidential and ensuring data security.

[0075] S705, Based on A, obtain the first target ID list FA = {FA1, FA2, ..., FA} corresponding to A sent by the first data platform. i , ..., FA n}, FA i For A i The corresponding first target ID.

[0076] Specifically, S705 also includes the following steps:

[0077] S7051, Get A i =(A 1 i A 2 i , ..., A y i , ..., A q i ), A y i For A i The initial value corresponding to the y-th sequence position.

[0078] S7053, according to A i , obtain A i The corresponding ID string to be encrypted, A 0 i =(A 1 i A 2 i , ..., A y i , ..., A q i ,β), where β is the encrypted value of ID.

[0079] Furthermore, the value of β can be any integer from 0 to 9.

[0080] S7055, for A 0 i Encryption processing is performed to obtain FA. iWherein, those skilled in the art know that obtaining an encrypted ID using any encryption method in the prior art falls within the protection scope of the present invention; preferably, the encryption process is SM3 encryption.

[0081] S707, Based on B, obtain the second target ID list FB = {FB1, FB2, ..., FB} corresponding to B sent by the second data platform. i ..., FB n}, among which, FB i ={FB i1 FB i2 ..., FB ij ..., FB im}, FB ij For B ij The corresponding second target ID.

[0082] Specifically, the FB i Acquisition method and FA i The acquisition method is the same.

[0083] Furthermore, S707 also includes the following steps:

[0084] S7071, obtain B ij = (B 1 ij B 2 ij , ..., B y ij , ..., B q ij ), B y ij For B ij The ID value corresponding to the y-th position in the sequence.

[0085] S7073, according to B ij , obtain B ij The corresponding ID string to be encrypted, B 0 ij = (B 1 ij B 2 ij , ..., B y ij , ..., B q ij ,β), where B 0 ij β and A 0 i The β values ​​are consistent.

[0086] S7075, for B 0ij Encryption processing is performed to obtain FB. ij Among them, FB ij The corresponding encryption processing method and FA i The corresponding encryption methods are the same, so they will not be repeated here.

[0087] As described above, by encrypting the list of second expansion IDs obtained from the sample IDs, the second expansion IDs sent from the second database can be protected during data interaction, thus preventing the leakage of second expansion ID information sent from the second database when obtaining the target profile tag corresponding to the initial ID.

[0088] S709, Based on FA and FB, obtain the target label set U = {U1, U2, ..., U} corresponding to A. i , ..., U n}, U i For A i The corresponding list of target tags.

[0089] Specifically, in S709, U is obtained through the following steps. i :

[0090] S7091, Obtain the tag set FDB = {FDB1, FDB2, ..., FDB} corresponding to the FB sent by the second data platform. i , ..., FDB n}, FDB i ={FDB i1 FDB i2 , ..., FDB ij , ..., FDB im}, FDB ij For DB ij The corresponding list of tags to be parsed.

[0091] Specifically, the list of tags to be parsed is a list of tags after the intermediate image tag list has been encrypted. Those skilled in the art know that obtaining the encrypted ID using any encryption method in the prior art falls within the protection scope of this invention.

[0092] S7093, will FA i With Facebook ij Compare and obtain FA i With Facebook ij The comparison results between them.

[0093] Specifically, S7093 also includes the following steps:

[0094] S70931, Obtain FA iThe corresponding first target vector GFA i ={GFA i1 GFA i2 ..., GFA ie ..., GFA if GFA ie For FA i The corresponding bit value of the e-th bit in the first target vector, where e = 1, 2, ..., f, and f is FA. i The corresponding bit dimension in the first target vector.

[0095] S70933, Get FB ij The corresponding second target vector GFB ij ={GFB 1 ij GFB 2 ij ..., GFB e ij ..., GFB f ij}, GFB ije For FB ij The corresponding bit value of the e-th bit in the second target vector.

[0096] S70935, according to GFA i and GFB ij Obtain GFA i The corresponding target similarity F j i , of which F j i Meets the following conditions ：

[0097]

[0098] S70937, when F j i When =F0, determine FA. i =FB ij As FA i With Facebook ij The comparison results between them, where F0 is the preset similarity threshold.

[0099] Preferred, F0 = 100%.

[0100] S7095, based on FA i With Facebook ij The comparison results between them yielded the FDB. ij Corresponding DB ij This can be understood as: in S7095, when FA... i =FBij FDB ij is decrypted to obtain the FDB ij corresponding to the DB ij , wherein those skilled in the art know that any encryption and decryption method in the prior art can be used, and details are not repeated here.

[0101] S7097, the DB ij is sent to the first data platform as U i .

[0102] Through the above data interaction process, the decryption of the portrait label is finally performed in an environment without intersection with the first data platform and the second data platform, the independence of the data of the two parties is ensured, the data leakage is avoided, and the security of the data information of the first data platform and the second data platform in the data interaction process is realized.

[0103] The application provides a data processing system for obtaining a target portrait label based on an expanded ID, which comprises a processor and a memory storing a computer program, and when the computer program is executed by the processor, the following steps are realized: receiving a data expansion request, obtaining an initial user ID list sent by a first data platform, obtaining a first intermediate expanded ID list corresponding to the initial user ID list according to the initial user ID list, obtaining a first target expanded ID list corresponding to the first intermediate expanded ID list according to the first intermediate expanded ID list, obtaining a second target expanded ID list corresponding to the first intermediate expanded ID list according to the first target expanded ID list, obtaining a second intermediate expanded ID list corresponding to the second target expanded ID list according to the second target expanded ID list, performing a de-duplication process on the second intermediate expanded ID list, obtaining a first key expanded ID list corresponding to the corresponding second intermediate expanded ID list, obtaining a second key expanded ID list corresponding to a third intermediate expanded ID list corresponding to the initial user ID list according to the initial user ID list, and obtaining a target portrait label corresponding to the initial user according to the first key expanded ID list and the second key expanded ID list. It can be known that, on the one hand, the critical value between the expansion quantity and the number of fuzzy strings is considered when the initial user ID and the expanded ID are fuzzed, so that the number of expanded IDs sent by the second data platform is ensured, the running efficiency is higher, and the situation that the obtained portrait label is chaotic is avoided; on the other hand, the corresponding relationship between the expansion quantity of the initial user ID and the number of fuzzy bits is considered, and it is considered that the same user ID quantity can be matched when the expansion quantity and the number of fuzzy bits are different.

[0104] While particular embodiments of the application have been described in detail hereinabove, it is understood that the foregoing examples have been presented by way of example and are not intended to limit the scope of the application. It will be apparent to persons skilled in the art that various modifications can be made without departing from the spirit and scope of the application. The scope of the application is defined by the appended claims.

Claims

1. A data processing system for acquiring a target profile label based on an extended quantity ID, characterized by, The system comprises a processor and a memory storing a computer program, when the computer program is executed by the processor, the following steps are implemented: S100, Receive tag acquisition request, obtain the initial user ID list A={A1, A2, ..., A...} sent by the first data platform. i , ..., A n }, A i Let be the initial user ID of the i-th user, where i = 1, 2, ..., n, and n is the number of initial user IDs. S200, Obtain the first intermediate expansion ID set A'={A'1, A'2, ..., A'} corresponding to A. i , ..., A' n }, A' i ={A' i1 A' i2 , ..., A' ir , ..., A' iz }, A' ir =(A' 1 ir A' 2 ir , ..., A' y ir , ..., A' q ir ), A' y ir For A i The initial value corresponding to the y-th sequence position in the r-th first intermediate expansion ID, y=1,2,...,q, where q is the number of initial values ​​in the first intermediate expansion ID, and r=1,2,...,z, where z is the number of first intermediate expansion IDs; S300, according to A', acquiring a first target quantity expansion ID set BA' corresponding to A' {BA'1, BA'2, …, BA' i , …, BA' n}, BA' i = {BA' i1 , BA' i2 , …, BA' ir , …, BA' iz}, BA' ir = (A' 1 ir , A' 2 ir , …, A' δ ir ), A' δ ir is the initial value corresponding to the δth sequence bit in A' ir and δ≤q; S400, Based on BA', obtain the second intermediate expansion ID set AX={AX1, AX2, ..., AX'} corresponding to BA'. i , ..., AX n }, AX i ={AX i1 AX i2 , ..., AX ic , ..., AX id（i） }, AX ic ={AX 1 ic AX 2 ic , ..., AX θ ic , ..., AX η ic }, AX θ ic for BA' i The corresponding c-th second intermediate expansion ID is the θ-th second intermediate expansion ID in the list, where θ = 1, 2, ..., η, and η is BA'. i The corresponding number of second intermediate expansion IDs in the c-th second intermediate expansion ID list, c=1,2,...,d(i), d(i) is BA' i The corresponding number of the second intermediate expansion ID list; S500, based on AX, obtain the first key expansion ID set AX corresponding to AX. 0 ={AX 0 1, AX 0 2, ..., AX 0 i , ..., AX 0 n }, AX 0 i ={AX 0 i1 AX 0 i2 , ..., AX 0 ic , ..., AX 0 id（i） }, AX 0 ic ={AX 1 ic AX 2 ic , ..., AX θ-1 ic AX θ+1 ic , ..., AX η ic }, where AX 0 ic For when AX θ ic =A' ir At that time, from AX ic Delete AX θ ic Obtained; S600, Based on A, obtain the second key expansion ID set YA={YA1, YA2, ..., YA...} corresponding to A. i , ..., YA n }, YA i ={YA 1 i YA 2 i , ..., YA u i , ..., YA ψ i }, YA u i For A i The u-th second key expansion ID in the corresponding second key expansion ID list, u=1,2,...,ψ, where ψ is A i The corresponding number of second key expansion IDs; S700, obtaining a target image label corresponding to A according to YA and AX 0 , and obtaining a target image label corresponding to A.

2. The data processing system for acquiring a target profile label based on an extended ID according to claim 1, wherein, The first data platform is a data platform corresponding to a user label acquisition party.

3. The data processing system for obtaining target profile tags based on expanded ID according to claim 1, characterized in that, The following step is further included in S400: S401, the BA' is de-duplication processing, obtaining the second target expansion ID set TA' corresponding to BA' = {TA'1, TA'2, …, TA' i , …, TA' n}, TA' i = {TA' i1 , TA' i2 , …, TA' ic , …, TA' id（i）}, TA' ic is the cth second target expansion ID in the second target expansion ID list corresponding to BA' i ; S403, obtaining AX ic θ ic = (TA' ic , AX θ1 ic , …, AX θγ ic , …, AX θξ ic ), AX θγ ic is the adjustment value corresponding to the γth sequence bit in AX θ ic , γ = 1, 2, …, ξ, and ξ is the number of adjustment values in AX θ ic .​ 4. The data processing system for acquiring a target profile label based on an extended ID according to claim 3, wherein, ξ = q - δ.

5. The data processing system for acquiring a target profile label based on an extended ID according to Claim 1, wherein, The following step is further included in S600: S601, according to A, obtaining a first ID set CA={CA1, CA2, …, CA i , …, CA n} corresponding to A, which is a first ID list corresponding to A; i i ;​ S603, according to the CA, obtaining the intermediate ID set CA' corresponding to the CA, CA'={CA'1, CA'2, …, CA' i , …, CA' n}; CA' i is the intermediate ID list corresponding to the A i ​ S605, according to CA', the second key expansion ID set YA corresponding to CA' is acquired.

6. The data processing system for acquiring a target profile label based on an extended ID according to Claim 1, wherein, η = C ξ q and W1 / z < η < W2 / z, where W1 is a lower limit value of the first expanded ID number and W2 is an upper limit value of the first expanded ID number.

7. The data processing system for acquiring a target profile label based on an extended ID according to Claim 1, wherein, The following step is further included in S700: S701, obtaining a first data platform sending a first set of LA i and AX 0 ic inserted into LA' i , the first data platform sends the first set of LA={LA1, LA2, …, LA i , …, LA n}, LA i ={A i , LA' i}, LA' i ={LA 1 i , LA 2 i , …, LA x i , …, LA p（i） i}, LA x i is the xth first set of LA corresponding to A i , x=1, 2, …, p(i), p(i) is the number of first sets of LA corresponding to A i ​ S703, send LA to the second data platform, and obtain the second expansion ID set B={B1, B2, ..., B...} corresponding to the LA sent by the second data platform. i , ..., B n }, B i ={B i1 B i2 , ..., B ij , ..., B im } and the intermediate image tag set DB={DB1, DB2, ..., DB} corresponding to B i , ..., DB n }, DB i ={DB i1 DB i2 , ..., DB ij , ..., DB im }, B ij For LA i The corresponding j-th second expansion ID, DB ij For B ij The corresponding intermediate image tag list, j=1, 2, ..., m, where m is the number of second expansion IDs; S705, according to A, obtaining the first target ID list corresponding to A sent by the first data platform FA={FA1, FA2, …, FA i , …, FA n}, FA i is the first target ID corresponding to A i ; S707, according to B, obtaining the second target ID list FB corresponding to B sent by the second data platform, FB={FB1, FB2, …, FB i , …, FB n}, wherein FB i ={FB i1 , FB i2 , …, FB ij , …, FB im}, FB ij is the second target ID corresponding to B ij ; S709, according to the FA and FB, obtaining the target label set U corresponding to A = {U1, U2, …, U i , …, U n} corresponding to A, U i is the target label list corresponding to A. i ​ 8. The data processing system for acquiring a target profile label based on an extended ID according to claim 7, wherein, The following step is further included in S703: S7031, Obtain the sample ID list C={C1, C2, ..., C...} sent by the second data platform. g , ..., C s }, where C g Let g be the ID of the g-th sample, where g = 1, 2, ..., s, and s is the number of sample IDs. S7032, traverse C and when A i = C g , insert C g as the second expansion ID insertion value B i , and get the corresponding key ID list D g {D g , D g1 , …, D g2 , …, D gt , …, D gk}, D gt is the first corresponding t key ID of C g , t = 1, 2, …, k, k is the number of key IDs; S7033, traverse D g and when LA x i = D gt , insert D gt as the second extended ID insertion value B i in value B; S7034, obtain the sample label set C' corresponding to C, C' = {C'1, C'2, …, C' g , …, C' s} g , C' is the sample label list corresponding to C g ; S7035, when A i = C g , C' g is inserted as an intermediate image tag list insertion value DB i in and C' g corresponding key tag set D' g = {D' g1 , D' g2 , ……D' gt , ……, D' gk} is obtained, D' gt is the D gt th corresponding key tag list; S7036, when LA x i = D gt gt D' as an intermediate image tag list insertion value DB i in.​ 9. The data processing system for acquiring a target profile label based on an extended ID according to claim 7, wherein, The following step is further included in S705: S7051, obtain A i = (A 1 i , A 2 i ,..., A y i ,..., A q i ), A y i for A i corresponding to the initial value of the y-th sequence bit; S7053, according to A i , obtaining A i corresponding to the ID string A 0 i = (A 1 i , A 2 i ,..., A y i ,..., A q i , β), wherein β is the encrypted value of the ID; S7055, to A 0 i encryption processing, and FA is acquired i .

10. The data processing system for acquiring a target profile label based on an extended ID according to claim 9, wherein, The FB i is acquired in the same way as the FA i .

Images