CN113190717A - Method, system, device and medium for identifying user identification - Google Patents
Method, system, device and medium for identifying user identification Download PDFInfo
- Publication number
- CN113190717A CN113190717A CN202110461582.3A CN202110461582A CN113190717A CN 113190717 A CN113190717 A CN 113190717A CN 202110461582 A CN202110461582 A CN 202110461582A CN 113190717 A CN113190717 A CN 113190717A
- Authority
- CN
- China
- Prior art keywords
- identification
- user
- identifier
- module
- connected component
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Software Systems (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method, a system, equipment and a medium for identifying user identification, wherein the identification method comprises the following steps: acquiring an identifier of at least one user, wherein each user has a plurality of associated identifiers; constructing a graph structure according to the association identifier; setting unique corresponding identification IDs for each connected component obtained by calculation based on the graph structure; and identifying other associated identifications corresponding to the acquired identification ID according to the acquired identification ID corresponding to the input associated identification and the corresponding connected component. According to the method and the device, the unique corresponding identification ID is respectively set for each connected component obtained through calculation based on the constructed graph structure, and other associated identifications corresponding to the obtained identification ID are identified according to the obtained identification ID corresponding to the input associated identification and the corresponding connected component, so that other identifications of the user are identified based on any identification ID of the same user, the uniform user identification is used in business application, and the working efficiency is improved.
Description
Technical Field
The present invention relates to the field of identifier processing technologies, and in particular, to a method, a system, a device, and a medium for identifying a user identifier.
Background
There are many kinds of identification of a person, and the identification can be roughly classified into the following types: enterprise internal unified ID (identity): commonly referred to as user ID in enterprise IT (internet technology) systems, herein collectively referred to as UserId (unique identification); legal user coding: legal certificate numbers such as uniform identification numbers or international passport numbers; the contact way is as follows: the contact information of the user, such as a mobile phone, a mailbox, a WeChat, a QQ and the like; the terminal equipment related identification: when a user accesses the system, collected terminal device identifiers, such as cookies (data stored on a user local terminal) at a PC (personal computer) end, imei (international mobile equipment identity) at a wireless end, idfa (advertisement identifier of an apple mobile phone), oaid (advertisement identifier), and the like; other identity-related identifiers: such as a license plate number, has an associated identification with a degree of identification for the user.
Generally, different identifiers of users are required to be used in different scenarios, for example, when a certain advertisement delivery or advertisement marketing is performed to registered users of some websites, the advertisement delivery or advertisement marketing is usually performed through an existing user identifier, for example, in the obtained user identifier, an advertisement is sent to a user in a form of a short message for a user with only a mobile phone number, and is sent to a user in a mailbox for a user with only a mailbox, and for the user in a QQ, the advertisement is generally delivered to the user through different identifiers (for example, a mobile phone number, a mailbox, or a QQ, etc.) filled by the website registered by the user in the prior art, and the use of different identifiers of users in a specific service application causes problems of cumbersome work and low efficiency.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method, a system, a device and a medium for identifying a user identifier, in order to overcome the defects of complicated work and low efficiency caused by using different identifiers of users in specific service applications in the prior art.
The invention solves the technical problems through the following technical scheme:
the first aspect of the present invention provides a method for identifying a user identifier, where the method includes:
acquiring an identifier of at least one user, wherein each user has a plurality of associated identifiers;
constructing a graph structure according to the association identification of each user;
calculating the graph structure to obtain at least one connected component;
setting unique corresponding identification ID for each connected component;
receiving an associated identifier input by a user, and acquiring an identifier ID corresponding to the input associated identifier;
and identifying other associated identifications corresponding to the obtained identification ID according to the obtained identification ID and the corresponding connected component.
Preferably, after the step of obtaining the identifier of at least one user, each user having a plurality of associated identifiers, the identification method further includes:
coding the association identifier of each user to obtain a coded association identifier;
and constructing a graph structure according to the coded association identifier.
Preferably, the identification method further comprises:
calculating the weight values of all the associated identifiers in the graph structure;
and if the number of the other associated identifications belonging to the same type is more than two, selecting the other associated identification with the highest weight value as output.
Preferably, the step of encoding the association identifier of each user comprises:
performing Long (integer) type numerical coding on the associated identifier of each user, wherein the coding values of different associated identifiers are different;
the step of setting a unique corresponding identification ID for each of the connected components includes:
and selecting any coding value in each connected component as a corresponding identification ID.
The second aspect of the invention provides a system for identifying a user identifier, which comprises a first acquisition module, a construction module, a first calculation module, a setting module, a second acquisition module and an identification module;
the first acquisition module is used for acquiring the identification of at least one user, and each user has a plurality of associated identifications;
the construction module is used for constructing a graph structure according to the association identification of each user;
the first calculation module is used for calculating the graph structure to obtain at least one connected component;
the setting module is used for setting unique corresponding identification ID for each connected component;
the second acquisition module is used for receiving the association identification input by the user and acquiring the identification ID corresponding to the input association identification;
the identification module is used for identifying other associated identifications corresponding to the obtained identification ID according to the obtained identification ID and the corresponding connected component.
Preferably, the identification system further comprises an encoding module;
the coding module is used for coding the association identifier of each user to obtain a coded association identifier;
the construction module is specifically configured to construct a graph structure according to the encoded association identifier.
Preferably, the identification system further comprises a second calculation module and a selection module;
the second calculation module is used for calculating the weight values of all the associated identifiers in the graph structure;
and the selection module is used for selecting other associated identifications with the highest weight values as output if the number of the other associated identifications belonging to the same type is more than two.
Preferably, the encoding module is specifically configured to perform Long type numerical encoding on the association identifier of each user, where the encoding values of different association identifiers are different;
the setting module is specifically configured to select any encoded value in each connected component as a corresponding identifier ID.
A third aspect of the present invention provides an electronic device, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for identifying a user identifier according to the first aspect when executing the computer program.
A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for identifying a user identity according to the first aspect.
The positive progress effects of the invention are as follows:
according to the method and the device, the graph structure is constructed according to the obtained associated identification of each user, the unique corresponding identification ID is respectively set for each connected component obtained through calculation based on the graph structure, and other associated identifications corresponding to the obtained identification ID are identified according to the obtained identification ID corresponding to the input associated identification and the corresponding connected component, so that other identifications of the user are identified based on any identification ID of the same user, further, the uniform user identification can be used in specific service application, and the working efficiency is improved.
Drawings
Fig. 1 is a flowchart of a user identifier identification method according to embodiment 1 of the present invention.
Fig. 2 is a schematic diagram of connected components of the method for identifying a user identifier according to embodiment 1 of the present invention.
Fig. 3 is a schematic diagram of a processing procedure of a user identifier identification method according to embodiment 1 of the present invention.
Fig. 4 is a schematic block diagram of a user identifier recognition system according to embodiment 2 of the present invention.
Fig. 5 is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention.
Detailed Description
The invention is further illustrated by the following examples, which are not intended to limit the scope of the invention.
Example 1
As shown in fig. 1, this embodiment provides a method for identifying a user identifier, where an execution subject of the method may be an application program such as a search engine, or may also be an electronic device, and is not limited herein. Specifically, the identification method comprises the following steps:
In this embodiment, the identifier of at least one user is obtained from each upstream system, for example, the identifier of at least one user registered in different websites may be obtained, and several associated identifiers of each user are extracted from the identifiers of the users.
And 102, coding the association identifier of each user to obtain a coded association identifier.
In this embodiment, Long type numerical coding is performed on the association identifier of each user, and the coding values of different association identifiers are different. For convenience of statistics, the users may be sorted, and the association identifier for each user may be coded and sorted in an increasing manner, for example, the association identifier for each user may be coded and sorted in an increasing manner of 1, 2, 3, and the like.
And 103, constructing a graph structure according to the coded association identifier.
In this embodiment, a graph structure is constructed according to the association identifier of each user, specifically, a graph structure is constructed according to the encoded association identifier.
And 104, calculating a graph structure to obtain at least one connected component.
In this embodiment, the Spark graph structure is used to obtain at least one connected component, and each connected component may be regarded as one user.
And 105, respectively setting unique corresponding identification IDs for each connected component.
In this embodiment, when setting the identification ID of each connected component, any encoded value in each connected component is selected as the corresponding identification ID, and usually, the minimum encoded value or the maximum encoded value is preferably the most as the corresponding identification ID.
In this embodiment, the user identifier may be abstracted as one vertex, the associated two identifier-connected lines may be abstracted as edges of the two identifiers, and a graph structure may be constructed based on the edges.
For example, based on the graph structure calculation, 3 connected components as shown in fig. 2 are obtained, and each identifier in each connected component has a corresponding code value, specifically, vertex 1, vertex 2, vertex 5, vertex 6, vertex 7, vertex 8, vertex 9, vertex 10, vertex 11, vertex 12, and vertex 13, where vertex 1 is associated with vertex 5, vertex 6, vertex 7, vertex 8, and vertex 9, respectively, vertex 2 is associated with vertex 8, vertex 9, vertex 10, vertex 11, vertex 12, and vertex 13, and each of the associated vertices is connected by a plurality of edges to form a first connected component, and any code value in the connected components may be selected as a corresponding identifier ID, for example, a minimum code value is selected as an identifier ID corresponding to the first connected component, that is, the identifier ID of the first connected component is 1, can be expressed as a connected component: 1; for vertex 0, vertex 3, vertex 14, vertex 15, and vertex 16, vertex 3 is respectively associated with vertex 0, vertex 14, vertex 15, and vertex 16, and other vertices associated with vertex 3 are connected together by multiple edges to form a second connected component, and 0 is selected as the identifier ID of the second connected component, which may be expressed as a connected component: 0; vertex 4 and vertex 17 are associated and connected together to form a third connected component, and 4 is selected as the identifier ID of the third connected component, which can be expressed as a connected component: 4.
and 106, receiving the associated identification input by the user, and acquiring an identification ID corresponding to the input associated identification.
It should be noted that, in this embodiment, one association identifier input by the user may be received, or a plurality of different association identifiers imported by the user in batch may be received, and when the plurality of different association identifiers input by the user are received, the identifier ID corresponding to each input association identifier is obtained.
And step 107, identifying other associated identifications corresponding to the acquired identification ID according to the acquired identification ID and the corresponding connected component.
In this embodiment, a connected component corresponding to the acquired ID is identified according to the acquired ID, and then other associated IDs corresponding to the acquired ID are identified based on the connected component.
For example, the mailbox corresponding to the mobile phone number needs to be identified through a certain mobile phone number, specifically, the user corresponding to the mobile phone number is identified according to the obtained mobile phone number 138, and then the mailbox corresponding to the mobile phone number 138 can be identified based on the user.
In an optional embodiment, the identification method further includes:
the weight values of all associated labels in the graph structure are calculated.
In the embodiment, a graph structure is calculated by adopting a PageRank (webpage sorting algorithm) algorithm, and PR (rank value) values of the associated identifiers of all users are output, wherein the PR values can be used as weighing indexes corresponding to the weights of the associated identifiers, and the weight values of the associated identifiers can be used as the priority order of user identifier identification under the same type or the basis of index proportion allocation, so that the requirements of user identifier identification and statistical index allocation under different scenes are met.
In this embodiment, the step 104 may be executed and the step of calculating the weight values of all the associated labels in the graph structure may be executed; after the step 104 is executed, the weight values of all the association identifiers in the whole graph structure may be obtained by calculating the weight values of the association identifiers in each connected component.
And if the number of the other associated identifications belonging to the same type is more than two, selecting the other associated identification with the highest weight value as output.
In this embodiment, if it is recognized that the number of other associated identifiers belonging to the same type and corresponding to the acquired identifier ID exceeds two according to the acquired identifier ID and the corresponding connected component, the other associated identifier having the highest weight value is selected as an output.
For example, in a specific implementation process, as shown in fig. 3, according to the requirement of an actual project, an identifier of at least one user is obtained, then association identifiers among the identifiers of the users are combed, the identifier of each user in the < KeyType, Key > format is uniformly encoded into a Long type numerical value (the Long type numerical value may be recorded as KeyID (identifier)), and then the encoded association identifiers are output as Edges < KeyID1, KeyID2 >; specifically, < Userid >, Mobile >, < Userid, Email >, < Userid, Cid >, < Mobile, WeChat > are uniformly encoded into a Long type numerical value, and then edge < KeyID1, KeyID2> is output; then, a graph structure is constructed according to edge < KeyID1, KeyID2>, a Spark graph structure is adopted to calculate the graph structure, at least one connected component is obtained, each KeyID is attributed to the corresponding connected component, any coding value in each connected component is selected as the corresponding identification ID, it needs to be noted that a min (KeyID) value in each connected component is generally selected as the identification ID of the connected component (namely, the identification ID is used as the identification ID of the user and can be marked as OneId), the associated identification input by the user is received, the identification ID corresponding to the input associated identification is obtained, the connected component corresponding to the obtained identification ID is firstly identified according to the obtained identification ID, namely, the corresponding relation Mapping < KeyID, OneId > of the obtained identification ID and the corresponding connected component is output, and then other associated identifications corresponding to the obtained identification ID are identified based on the connected component; and continuously calculating the graph structure by adopting a PageRank algorithm, and acquiring a PR value of the association identifier of each user, wherein the PR value can be a measurement index corresponding to the weight of the association identifier, and the PR value is combined with the corresponding relation to finally output < KeyID, OneId, PR >.
The graph structure calculation in the embodiment is based on the calculation of the code value (namely, the number), and the calculation process is the code value, so that the calculation efficiency can be improved, and after the calculation based on the code value is completed, the corresponding identification type and the text associated identification are added to the code value, so that the subsequent use is facilitated.
According to the method and the device, the graph structure is constructed according to the obtained associated identification of each user, the unique corresponding identification ID is respectively set for each connected component obtained through calculation based on the graph structure, and other associated identifications corresponding to the obtained identification ID are identified according to the obtained identification ID corresponding to the input associated identification and the corresponding connected component, so that other identifications of the user are identified based on any identification ID of the same user, further, the uniform user identification can be used in specific service application, and the working efficiency is improved.
Example 2
As shown in fig. 4, the present embodiment provides a system for identifying a user identifier, where the system includes a first obtaining module 1, a coding module 2, a building module 3, a first calculating module 4, a setting module 5, a second obtaining module 6, and an identifying module 7.
The first obtaining module 1 is configured to obtain an identifier of at least one user, where each user has several associated identifiers.
In this embodiment, the identifier of at least one user is obtained from each upstream system, for example, the identifier of at least one user registered in different websites may be obtained, and several associated identifiers of each user are extracted from the identifiers of the users.
The encoding module 2 is configured to encode the association identifier of each user to obtain an encoded association identifier.
In this embodiment, the encoding module 2 is specifically configured to perform Long type numerical encoding on the association identifier of each user, where the encoding values of different association identifiers are different. For convenience of statistics, the users may be sorted, and the association identifier for each user may be coded and sorted in an increasing manner, for example, the association identifier for each user may be coded and sorted in an increasing manner of 1, 2, 3, and the like.
The building module 3 is specifically configured to build a graph structure according to the encoded association identifier.
In this embodiment, a graph structure is constructed according to the association identifier of each user, specifically, a graph structure is constructed according to the encoded association identifier.
The first calculation module 4 is configured to calculate a graph structure to obtain at least one connected component.
In this embodiment, the Spark graph structure is adopted in this embodiment to obtain at least one connected component, and each connected component can be regarded as one user.
The setting module 5 is configured to set a unique corresponding identification ID for each connected component.
In this embodiment, when setting the identifier ID of each connected component, the setting module 5 is specifically configured to select any encoded value in each connected component as the corresponding identifier ID, and it is usually preferable that the minimum encoded value or the maximum encoded value is the most as the corresponding identifier ID.
In this embodiment, the user identifier may be abstracted as one vertex, the associated two identifier-connected lines may be abstracted as edges of the two identifiers, and a graph structure may be constructed based on the edges.
For example, based on the graph structure calculation, 3 connected components as shown in fig. 2 are obtained, and each identifier in each connected component has a corresponding code value, specifically, vertex 1, vertex 2, vertex 5, vertex 6, vertex 7, vertex 8, vertex 9, vertex 10, vertex 11, vertex 12, and vertex 13, where vertex 1 is associated with vertex 5, vertex 6, vertex 7, vertex 8, and vertex 9, respectively, vertex 2 is associated with vertex 8, vertex 9, vertex 10, vertex 11, vertex 12, and vertex 13, and each of the associated vertices is connected by a plurality of edges to form a first connected component, and any code value in the connected components may be selected as a corresponding identifier ID, for example, a minimum code value is selected as an identifier ID corresponding to the first connected component, that is, the identifier ID of the first connected component is 1, can be expressed as a connected component: 1; for vertex 0, vertex 3, vertex 14, vertex 15, and vertex 16, vertex 3 is respectively associated with vertex 0, vertex 14, vertex 15, and vertex 16, and other vertices associated with vertex 3 are connected together by multiple edges to form a second connected component, and 0 is selected as the identifier ID of the second connected component, which may be expressed as a connected component: 0; vertex 4 and vertex 17 are associated and connected together to form a third connected component, and 4 is selected as the identifier ID of the third connected component, which can be expressed as a connected component: 4.
the second obtaining module 6 is configured to receive the association identifier input by the user, and obtain an identifier ID corresponding to the input association identifier.
It should be noted that, in this embodiment, one association identifier input by the user may be received, or a plurality of different association identifiers imported by the user in batch may be received, and when the plurality of different association identifiers input by the user are received, the identifier ID corresponding to each input association identifier is obtained.
The identification module 7 is configured to identify other associated identifiers corresponding to the obtained identifier ID according to the obtained identifier ID and the corresponding connected component.
In this embodiment, a connected component corresponding to the acquired ID is identified according to the acquired ID, and then other associated IDs corresponding to the acquired ID are identified based on the connected component.
For example, the mailbox corresponding to the mobile phone number needs to be identified through a certain mobile phone number, specifically, the user corresponding to the mobile phone number is identified according to the obtained mobile phone number 138, and then the mailbox corresponding to the mobile phone number 138 can be identified based on the user.
In an alternative embodiment, the identification system further comprises a second calculation module 8 and a selection module 9.
The second calculating module 8 is configured to calculate the weight values of all the associated identifiers in the graph structure.
In the embodiment, a graph structure is calculated by adopting a PageRank algorithm, and PR values of the associated identifiers of all users are output, wherein the PR values can be used as weighing indexes corresponding to the weight of the associated identifiers, and the weight values of the associated identifiers can be used as the priority of user identifier identification under the same type or the basis of proportional allocation of the indexes, so that the requirements of user identifier identification and statistical index allocation under different scenes are met.
In this embodiment, the weight values of all the associated identifiers in the graph structure may be calculated while the graph structure obtains at least one connected component; the weight values of all the association markers in the whole graph structure can also be obtained by calculating the weight value of the association marker in each connected component.
The selecting module 9 is configured to select, as an output, another associated identifier with the highest weight value if it is identified that the number of the other associated identifiers belonging to the same type exceeds two.
In this embodiment, if it is recognized that the number of other associated identifiers belonging to the same type and corresponding to the acquired identifier ID exceeds two according to the acquired identifier ID and the corresponding connected component, the other associated identifier having the highest weight value is selected as an output.
For example, in a specific implementation process, as shown in fig. 3, according to the requirement of an actual project, an identifier of at least one user is obtained, then association identifiers among the identifiers of the users are combed, the identifier of each user in the < KeyType, Key > format is uniformly encoded into a Long type numerical value (the Long type numerical value may be recorded as KeyID), and then the encoded association identifiers are output as Edges < KeyID1, KeyID2 >; specifically, < Userid >, Mobile >, < Userid, Email >, < Userid, Cid >, < Mobile, WeChat > are uniformly encoded into a Long type numerical value, and then edge < KeyID1, KeyID2> is output; then, a graph structure is constructed according to edge < KeyID1, KeyID2>, a Spark graph structure is adopted to calculate the graph structure, at least one connected component is obtained, each KeyID is attributed to the corresponding connected component, any coding value in each connected component is selected as the corresponding identification ID, it needs to be noted that a min (KeyID) value in each connected component is generally selected as the identification ID of the connected component (namely, the identification ID is used as the identification ID of the user and can be marked as OneId), the associated identification input by the user is received, the identification ID corresponding to the input associated identification is obtained, the connected component corresponding to the obtained identification ID is firstly identified according to the obtained identification ID, namely, the corresponding relation Mapping < KeyID, OneId > of the obtained identification ID and the corresponding connected component is output, and then other associated identifications corresponding to the obtained identification ID are identified based on the connected component; and continuously calculating the graph structure by adopting a PageRank algorithm, and acquiring a PR value of the association identifier of each user, wherein the PR value can be a measurement index corresponding to the weight of the association identifier, and the PR value is combined with the corresponding relation to finally output < KeyID, OneId, PR >.
The graph structure calculation in the embodiment is based on the calculation of the code value (namely, the number), and the calculation process is the code value, so that the calculation efficiency can be improved, and after the calculation based on the code value is completed, the corresponding identification type and the text associated identification are added to the code value, so that the subsequent use is facilitated.
According to the method and the device, the graph structure is constructed according to the obtained associated identification of each user, the unique corresponding identification ID is respectively set for each connected component obtained through graph calculation, other associated identifications corresponding to the obtained identification ID are identified according to the obtained identification ID corresponding to the input associated identification and the corresponding connected component, other identifications of the user are identified based on any identification ID of the same user, further, the uniform user identification can be used in specific service application, and therefore working efficiency is improved.
Example 3
Fig. 5 is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention. The electronic device comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor implements the user identification recognition method of embodiment 1 when executing the computer program. The electronic device 30 shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 5, the electronic device 30 may be embodied in the form of a general purpose computing device, which may be, for example, a server device. The components of the electronic device 30 may include, but are not limited to: the at least one processor 31, the at least one memory 32, and a bus 33 connecting the various system components (including the memory 32 and the processor 31).
The bus 33 includes a data bus, an address bus, and a control bus.
The memory 32 may include volatile memory, such as Random Access Memory (RAM)321 and/or cache memory 322, and may further include Read Only Memory (ROM) 323.
The processor 31 executes various functional applications and data processing, such as the user identification recognition method provided in embodiment 1 of the present invention, by executing the computer program stored in the memory 32.
The electronic device 30 may also communicate with one or more external devices 34 (e.g., keyboard, pointing device, etc.). Such communication may be through input/output (I/O) interfaces 35. Also, the resulting device 30 may also communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet) via a network adapter 36. As shown in FIG. 5, network adapter 36 communicates with the other modules of model-generating device 30 via bus 33. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the model-generating device 30, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (disk array) systems, tape drives, and data backup storage systems, etc.
It should be noted that although in the above detailed description several units/modules or sub-units/modules of the electronic device are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the units/modules described above may be embodied in one unit/module according to embodiments of the invention. Conversely, the features and functions of one unit/module described above may be further divided into embodiments by a plurality of units/modules.
Example 4
The present embodiment provides a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the steps of the method for identifying a user identifier provided in embodiment 1.
More specific examples, among others, that the readable storage medium may employ may include, but are not limited to: a portable disk, a hard disk, random access memory, read only memory, erasable programmable read only memory, optical storage device, magnetic storage device, or any suitable combination of the foregoing.
In a possible implementation manner, the present invention can also be implemented in the form of a program product, which includes program code for causing a terminal device to execute the steps of implementing the method for identifying a subscriber identity described in embodiment 1 when the program product is run on the terminal device.
Where program code for carrying out the invention is written in any combination of one or more programming languages, the program code may be executed entirely on the user device, partly on the user device, as a stand-alone software package, partly on the user device and partly on a remote device or entirely on the remote device.
While specific embodiments of the invention have been described above, it will be appreciated by those skilled in the art that this is by way of example only, and that the scope of the invention is defined by the appended claims. Various changes and modifications to these embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention, and these changes and modifications are within the scope of the invention.
Claims (10)
1. A method for identifying a user identifier, the method comprising:
acquiring an identifier of at least one user, wherein each user has a plurality of associated identifiers;
constructing a graph structure according to the association identification of each user;
calculating the graph structure to obtain at least one connected component;
setting unique corresponding identification ID for each connected component;
receiving an associated identifier input by a user, and acquiring an identifier ID corresponding to the input associated identifier;
and identifying other associated identifications corresponding to the obtained identification ID according to the obtained identification ID and the corresponding connected component.
2. The method of claim 1, wherein after the step of obtaining the identity of at least one user, each user having a number of associated identities, the method further comprises:
coding the association identifier of each user to obtain a coded association identifier;
and constructing a graph structure according to the coded association identifier.
3. A method of identifying a subscriber identity as claimed in claim 1, characterized in that the method of identifying further comprises:
calculating the weight values of all the associated identifiers in the graph structure;
and if the number of the other associated identifications belonging to the same type is more than two, selecting the other associated identification with the highest weight value as output.
4. The method for identifying a subscriber identity of claim 2, wherein the step of encoding the association identity of each subscriber comprises:
performing Long type numerical coding on the associated identification of each user, wherein the coding values of different associated identifications are different;
the step of setting a unique corresponding identification ID for each of the connected components includes:
and selecting any coding value in each connected component as a corresponding identification ID.
5. The identification system of the user identification is characterized by comprising a first acquisition module, a construction module, a first calculation module, a setting module, a second acquisition module and an identification module;
the first acquisition module is used for acquiring the identification of at least one user, and each user has a plurality of associated identifications;
the construction module is used for constructing a graph structure according to the association identification of each user;
the first calculation module is used for calculating the graph structure to obtain at least one connected component;
the setting module is used for setting unique corresponding identification ID for each connected component;
the second acquisition module is used for receiving the association identification input by the user and acquiring the identification ID corresponding to the input association identification;
the identification module is used for identifying other associated identifications corresponding to the obtained identification ID according to the obtained identification ID and the corresponding connected component.
6. The system for identifying a subscriber identity of claim 5, wherein said identification system further comprises an encoding module;
the coding module is used for coding the association identifier of each user to obtain a coded association identifier;
the construction module is specifically configured to construct a graph structure according to the encoded association identifier.
7. The system for identifying a subscriber identity of claim 5, wherein said identification system further comprises a second calculation module and a selection module;
the second calculation module is used for calculating the weight values of all the associated identifiers in the graph structure;
and the selection module is used for selecting other associated identifications with the highest weight values as output if the number of the other associated identifications belonging to the same type is more than two.
8. The system according to claim 6, wherein the encoding module is specifically configured to perform Long type numerical encoding on the association identifier of each user, and the encoding values of different association identifiers are different;
the setting module is specifically configured to select any encoded value in each connected component as a corresponding identifier ID.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of identifying a subscriber identity according to any of claims 1-4 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method for identifying a subscriber identity according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110461582.3A CN113190717A (en) | 2021-04-27 | 2021-04-27 | Method, system, device and medium for identifying user identification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110461582.3A CN113190717A (en) | 2021-04-27 | 2021-04-27 | Method, system, device and medium for identifying user identification |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113190717A true CN113190717A (en) | 2021-07-30 |
Family
ID=76979585
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110461582.3A Pending CN113190717A (en) | 2021-04-27 | 2021-04-27 | Method, system, device and medium for identifying user identification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113190717A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101266654A (en) * | 2007-03-14 | 2008-09-17 | 中国科学院自动化研究所 | Image text location method and device based on connective component and support vector machine |
| CN102279738A (en) * | 2010-06-10 | 2011-12-14 | 微软公司 | Identifying entries and exits of strongly connected components |
| CN110825919A (en) * | 2018-07-23 | 2020-02-21 | 阿里巴巴集团控股有限公司 | ID data processing method and device |
-
2021
- 2021-04-27 CN CN202110461582.3A patent/CN113190717A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101266654A (en) * | 2007-03-14 | 2008-09-17 | 中国科学院自动化研究所 | Image text location method and device based on connective component and support vector machine |
| CN102279738A (en) * | 2010-06-10 | 2011-12-14 | 微软公司 | Identifying entries and exits of strongly connected components |
| CN110825919A (en) * | 2018-07-23 | 2020-02-21 | 阿里巴巴集团控股有限公司 | ID data processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109918205B (en) | Edge equipment scheduling method, system, device and computer storage medium | |
| CN107895011B (en) | Session information processing method, system, storage medium and electronic equipment | |
| CN113326991B (en) | Automatic authorization method, device, computer equipment and storage medium | |
| CN111124917B (en) | Method, device, equipment and storage medium for managing and controlling public test cases | |
| CN114095567B (en) | Data access request processing method and device, computer equipment and medium | |
| CN112800197A (en) | Method and device for determining target fault information | |
| CN110807050B (en) | Performance analysis method, device, computer equipment and storage medium | |
| CN114328632A (en) | User data analysis method and device based on bitmap and computer equipment | |
| CN113010542B (en) | Service data processing method, device, computer equipment and storage medium | |
| CN111914101B (en) | File association relationship abnormality identification method and device and computer equipment | |
| CN112685115A (en) | International cue language generating method, system, computer equipment and storage medium | |
| CN106651408B (en) | Data analysis method and device | |
| CN113190717A (en) | Method, system, device and medium for identifying user identification | |
| CN112650940A (en) | Recommendation method and device of application program, computer equipment and storage medium | |
| CN113343713B (en) | Intention recognition method and device, computer equipment and storage medium | |
| CN110119337B (en) | Data analysis method and device and server | |
| CN114638308A (en) | Method and device for acquiring object relationship, electronic equipment and storage medium | |
| CN110020166A (en) | A kind of data analysing method and relevant device | |
| CN113590310A (en) | Resource allocation method and device based on rule touch rate scoring and electronic equipment | |
| CN110737662A (en) | data analysis method, device, server and computer storage medium | |
| CN114663073B (en) | Abnormal node discovery method and related equipment thereof | |
| CN117689428B (en) | Advertisement waterfall stream price inquiry strategy generation method and device, electronic equipment and medium | |
| CN112261134B (en) | Network data access auditing method, device, equipment and storage medium | |
| CN115225609B (en) | User data processing method and device and server | |
| CN112965993B (en) | Data processing system, method, device and storage medium |
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 |