Method and device for implementing ID Mapping based on graph database

By cleaning up ID nodes and relationships with activity below the threshold by a graph database, the reliability and stability of the user ID relationship network is solved, the processing of ID expiration and multiplexing relationships is realized, and the user ID relationship network is improved. completeness and accuracy.

CN114880522BActive Publication Date: 2024-12-06BANG DAO TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202210303694.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-24
Publication Date
2024-12-06
Estimated Expiration
2042-03-24

AI Technical Summary

Technical Problem

In the prior art, the reliability, accuracy and stability of the user ID relationship network is not high, and it is difficult to effectively deal with the problems of ID expiration, ID multiplexing and complex ID relationships, making it difficult for the user ID relationship network to build complete information.

Method used

Using a graph database-based method, the cleaning of expired ID nodes and ID node relationships with activity below the threshold can be achieved to improve the reliability, accuracy and stability of the user ID relationship network. .

Benefits of technology

By cleaning out expiration IDs and disconnecting weak associations, the reliability, accuracy and stability of the user ID relationship network are improved, and the problems of ID expiration, ID multiplexing and complex ID relationships are solved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114880522B_ABST
    Figure CN114880522B_ABST
Patent Text Reader

Abstract

The present invention provides a method and device for implementing ID Mapping based on a graph database, the method comprising: obtaining the ID nodes and ID node relationships that appeared on the Tth day from source ID data records; connecting the ID nodes that appeared on the Tth day, the ID node relationships that appeared on the Tth day, and the ID relationship network corresponding to the T-1st day by identification, and obtaining the first ID relationship network corresponding to the Tth day; cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtaining the second ID relationship network corresponding to the Tth day. The present invention cleans up expired IDs by cleaning up ID nodes whose activity is lower than a threshold, and cleans up weakly associated relationships of ID nodes by disconnecting ID node relationships whose activity is lower than a threshold, thereby improving the reliability, accuracy, and stability of the user ID relationship network.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of big data technology, and in particular to a method and device for implementing ID Mapping based on a graph database. Background Art

[0002] In real life, users can obtain services provided by enterprises through a variety of devices and from a variety of entrances; enterprises can also develop multiple business lines, form multiple products, and provide services to users through different channels. As a result, the data of the same user comes from different data sources, the data types are complex and scattered in various locations.

[0003] The big data platform physically solves the "data island" problem where data is scattered in various locations. However, logically, it is difficult to establish associations between data from multiple different sources, and the data is still in a fragmented state. This results in only being able to build a one-sided portrait of the user from a single or very small amount of data, which is equivalent to "a blind man touching an elephant" and makes it difficult to provide complete information about a user.

[0004] One thing that data from different sources have in common is that they come from the same user, and usually the data records information that identifies the user, collectively referred to as "user identification (Identity document, ID)". User ID is a string of serial numbers that represents a user entity, such as ID number, mobile phone number, email address, WeChat account, device number, Cookie ID, and Media Access Control (MAC) address. Therefore, establishing a relationship between user IDs can establish a connection between data. Among them, the process of building relationships between user IDs is the main process of ID Mapping.

[0005] In layman's terms, ID Mapping is to identify user IDs in multiple different source data as the same subject through various technical means and generate a unified identity identifier (unified identity identifier is one-ID) that identifies the user's unique identity. According to the data structure used in the processing process, the implementation methods of ID Mapping can be roughly summarized into three categories: dictionary method, table method and graph method. However, the current specific implementation methods of these three methods mainly focus on building ID relationships, and do not pay attention to the solution of ID expiration and reuse problems and complex relationship problems between IDs. These two problems seriously affect the reliability, accuracy and stability of the constructed user ID relationship network. Among them, the ID expiration and reuse problems are caused by the different life cycle and precision of user IDs. For example, a person usually has only one ID number in his life, while the mobile phone number, email address and device number will change more frequently; the complex relationship problem between IDs is caused by complex real-world scenarios, such as multiple accounts on the same device, multiple devices on the same account, multiple accounts, multiple data sources and abnormal data. Summary of the invention

[0006] The present invention provides a method and device for implementing ID Mapping based on a graph database, so as to solve the defects of low reliability, low accuracy and low stability of the user ID relationship network in the prior art, realize effective processing of ID expiration, ID reuse and complex ID relationships, and improve the reliability, accuracy and stability of the user ID relationship network.

[0007] The present invention provides a method for implementing ID Mapping based on a graph database, comprising:

[0008] Obtain the ID node that appears on the Tth day and the relationship between the ID node that appears on the Tth day from the source ID data record;

[0009] Connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day to obtain the first ID relationship network corresponding to the T-th day;

[0010] The first ID relationship network is cleaned up according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day.

[0011] Optionally, before cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, the method further includes:

[0012] Update the attributes of the ID node and the attributes of the ID node relationship respectively;

[0013] Perform feature extraction on the updated attributes of the ID node and the updated attributes of the ID node relationship respectively, and obtain the feature value of the ID node and the feature value of the ID node relationship;

[0014] Obtaining the activity of the ID node according to the feature value of the ID node and the weight corresponding to the feature value of the ID node;

[0015] The activity of the ID node relationship is obtained according to the feature value of the ID node relationship and the weight corresponding to the feature value of the ID node relationship.

[0016] Optionally, the first ID relationship network is cleaned up according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day, including:

[0017] When the activity of the ID node in the first ID relationship network is less than the node activity threshold, the ID node is cleared out of the first ID relationship network;

[0018] When the activity of the ID node relationship in the first ID relationship network is less than the relationship activity threshold, the ID node relationship is cleared out of the first ID relationship network;

[0019] According to the cleaned first ID relationship network, the second ID relationship network corresponding to the T-th day is obtained.

[0020] Optionally, acquiring the second ID relationship network corresponding to the Tth day according to the cleaned first ID relationship network includes:

[0021] In the case where the cleaning of the ID node or the ID node relationship does not result in the splitting of the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network;

[0022] In the case where the cleaning of the ID nodes or the ID node relationships causes the relationship subnet in the first ID relationship network to be split into multiple relationship subnets, the unified identity identifier of one relationship subnet among the multiple relationship subnets in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network, and the unified identity identifiers of other relationship subnets in the multiple relationship subnets are newly generated unified identity identifiers.

[0023] Optionally, after cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day, the method further includes:

[0024] Obtain inactive ID nodes and inactive ID node relationships within a preset time from source ID data records;

[0025] Updating the activity of the inactive ID node and the activity of the inactive ID node relationship;

[0026] The second ID relationship network is cleaned up according to the updated activity of the inactive ID node and the updated activity of the inactive ID node relationship to obtain the third ID relationship network corresponding to the Tth day.

[0027] Optionally, before the step of identifying and connecting the ID node appearing on the T-th day, the ID node relationship appearing on the T-th day, and the ID relationship network corresponding to the T-1st day, and obtaining the first ID relationship network corresponding to the T-th day, further includes:

[0028] According to the ID node appearing on the Tth day and the identification mapping dictionary corresponding to the T-1th day, obtain the unified identity identification existing on the T-1th day;

[0029] According to the unified identity identifier existing on day T-1, the ID relationship network corresponding to day T-1 is obtained.

[0030] Optionally, after the ID node appearing on the T-th day, the ID node relationship appearing on the T-th day, and the ID relationship network corresponding to the T-1st day are connected by identification, and the first ID relationship network corresponding to the T-th day is obtained, the method further includes:

[0031] In the case where a unified identity exists in a relationship subnet in the first ID relationship network, the unified identity of the relationship subnet is the existing unified identity;

[0032] In the case where there is more than one unified identity identifier in the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet is the unified identity identifier with the earliest creation time and the most merger or split times;

[0033] In the case that the relationship subnet in the first ID relationship network does not have a unified identity identifier, the unified identity identifier of the relationship subnet is a newly generated unified identity identifier.

[0034] The present invention also provides a device for implementing ID Mapping based on a graph database, comprising:

[0035] A first acquisition module is used to acquire the ID node appearing on the Tth day and the relationship between the ID nodes appearing on the Tth day from the source ID data record;

[0036] The second acquisition module is used to identify and connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day, and obtain the first ID relationship network corresponding to the T-th day;

[0037] The third acquisition module is used to clean up the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtain the second ID relationship network corresponding to the Tth day.

[0038] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method for implementing ID Mapping based on a graph database as described in any one of the above items is implemented.

[0039] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for implementing ID Mapping based on a graph database as described in any one of the above items.

[0040] The present invention also provides a computer program product, including a computer program, which, when executed by a processor, implements the method for implementing ID Mapping based on a graph database as described in any one of the above items.

[0041] The method and device for implementing ID Mapping based on a graph database provided by the present invention clean up expired IDs by cleaning up ID nodes whose activity is lower than a threshold, thereby solving the problem of ID expiration. By disconnecting the relationship between ID nodes whose activity is lower than a threshold, it cleans up the weak association relationship between ID nodes, solves the problems of ID reuse and ID complex relationships, and thus improves the reliability, accuracy and stability of the user ID relationship network. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0043] Figure 1 This is one of the flow charts of the method for implementing ID Mapping based on a graph database provided by the present invention;

[0044] Figure 2 This is the second flow chart of the method for implementing ID Mapping based on a graph database provided by the present invention;

[0045] Figure 3 It is a structural schematic diagram of a device for implementing ID Mapping based on a graph database provided by the present invention;

[0046] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0047] The dictionary method of ID Mapping is the simplest of the three methods. In the dictionary method of ID Mapping, the key is used to represent the ID in the source data, and the value is used to represent the generated unified one-ID. The main process is to determine whether the extracted ID is in the key. If the extracted ID exists in the key, the existing one-ID is used; if the extracted ID does not exist in the key, a new one-ID is created. ID connections may be generated as the number of IDs increases, so it is also necessary to merge dictionaries, that is, merge IDs that already have ID relationships but have not established ID connections.

[0048] The advantages of the dictionary method of ID Mapping are simple principles, easy implementation, and high processing efficiency; the disadvantages are that it cannot solve the problems of ID expiration and reuse and the problem of complex ID relationships. For example, when there are multiple users on the same device, multiple users will be merged into one user.

[0049] The most common way to organize IDs is in the form of table records. A record contains multiple IDs that appear at the same time and also contains ID relationships. Therefore, the table method is the most proposed method among the three methods. Its brief process is: taking records as units, merge records with the same ID to form a unified one-ID, and the key point is to reduce the error rate of merging records.

[0050] The advantage of the ID Mapping table method is that the principle and implementation are relatively simple, and the error rate can be reduced when merging; its disadvantage is that the processing speed is slow when the data volume is large, and it is difficult to independently process a single ID and ID relationship. It still does not solve the problems of ID expiration and reuse and complex ID relationships, such as the problems caused by mobile phone number transfer.

[0051] The essence of ID relationship is network structure, so the graph method is the most direct of the three methods, and with the maturity of graph databases, graph solutions are more widely used. It mainly constructs the ID in the record into a graph, and usually sets edge thresholds to filter out weak ID associations during the graph construction process; then obtains all connected subgraphs in the graph through the maximum connected subgraph algorithm, and generates a unique one-ID for each subgraph, one of which represents a user ID relationship network; this method handles the problem of complex ID relationships by setting user behavior rules (for example, setting a threshold number of IDs that a user can have within a preset time) and ID priority (for example, setting the ID number to have the highest priority).

[0052] The advantage of the graph method of ID Mapping is that the graph structure represents the ID relationship intuitively and easily understood, and it is easy to handle single IDs and ID relationships; its disadvantage is that it lacks effective methods to handle the problems of ID expiration and reuse, and although processing rules for complex ID relationship problems are proposed, they are too simple.

[0053] In order to effectively deal with the problems of ID expiration and reuse, as well as the problem of complex ID relationships, and to improve the reliability, accuracy and stability of user IDs and ID relationship networks, the present invention cleans up expired IDs by cleaning up ID nodes whose activity is lower than a threshold, thereby solving the problem of ID expiration. By disconnecting the relationship between ID nodes whose activity is lower than a threshold, it cleans up the weak association between ID nodes, thereby solving the problems of ID reuse and complex ID relationships, thereby improving the reliability, accuracy and stability of user IDs and ID relationship networks.

[0054] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0055] Figure 1 This is one of the flow charts of the method for implementing ID Mapping based on a graph database provided by the present invention, such as Figure 1 As shown, the present invention provides a method for implementing ID Mapping based on a graph database, the method comprising:

[0056] Step 101, obtaining the ID node appearing on the Tth day and the relationship between the ID node appearing on the Tth day from the source ID data record.

[0057] Specifically, Figure 2This is the second flow chart of the method for implementing ID Mapping based on a graph database provided by the present invention. The source data includes various ID data records. The ID in each ID data record and the relationship between the IDs are written into the graph database, and the attributes of the ID node and the attributes of the ID node relationship are initialized. Table 1 is the attribute table of the ID node, and Table 2 is the attribute table of the ID node relationship.

[0058] Table 1 Attribute table of ID node

[0059]

[0060]

[0061] As can be seen from Table 1, the attributes of ID nodes include node value, node type, node first record date, node most recently active date, node active days, a list of the number of days from each node appearance to the first record, node degree value, and node activity. Among them, node priority and node activity threshold are closely related to node type. Two ID nodes with the same node type have the same node priority, and two ID nodes with the same node type have the same node activity threshold.

[0062] Table 2 Attribute table of ID node relationship

[0063]

[0064] As can be seen from Table 2, the attributes of the ID node relationship include relationship description, relationship type, the date of the first record of the relationship node, the date of the most recent active relationship, the number of days the relationship is active, a list of the number of days from each appearance of the relationship to the first record, relationship activity, relationship priority and relationship activity threshold. Among them, the relationship priority and relationship activity threshold are closely related to the relationship type. Two ID node relationships with the same relationship type have the same relationship priority, and two ID node relationships with the same relationship type have the same relationship activity threshold.

[0065] During initialization, except for node priority, relationship priority, and node degree, all other attributes of ID nodes and ID node relationships are set to 1.

[0066] After the IDs and the relationships between the IDs contained in the source data are written into the graph database, the ID nodes appearing on the Tth day and the relationships between the ID nodes appearing on the Tth day are obtained from the graph database.

[0067] For example, the ID nodes that appear on the Tth day include device number dev_001, mobile number 150***, ID number 430***, account number ccc, and ID number 560***. The ID node relationships that appear on the Tth day include the relationship between device number dev_001 and mobile number 150***, and the relationship between ID number 430*** and account number ccc.

[0068] Step 102, identify and connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day to obtain the first ID relationship network corresponding to the T-th day.

[0069] Specifically, before performing identity connection to obtain the first ID relationship network corresponding to the T-th day, it is also necessary to first obtain the ID relationship network corresponding to the T-1th day.

[0070] Optionally, before the ID node appearing on the Tth day, the ID node relationship appearing on the Tth day, and the ID relationship network corresponding to the T-1st day are connected by identification, and obtaining the first ID relationship network corresponding to the Tth day, the method further includes:

[0071] According to the ID node appearing on the Tth day and the identifier mapping dictionary corresponding to the T-1th day, obtain the unified identity identifier existing on the T-1th day;

[0072] According to the unified identity identification existing on day T-1, the ID relationship network corresponding to day T-1 is obtained.

[0073] Specifically, the unified identity is one-ID, which is the Chinese translation of one-ID. The identity mapping dictionary contains one-ID, the ID node corresponding to each one-ID, and the ID node relationship.

[0074] The ID node that appears on the Tth day is compared with the ID node contained in the identification mapping dictionary corresponding to the T-1th day, and the ID node that appears on the Tth day and is also contained in the identification mapping dictionary corresponding to the T-1th day is found. According to the corresponding relationship of the found ID node in the identification mapping dictionary corresponding to the T-1th day, the one-ID corresponding to the found ID node is obtained, that is, the one-ID existing on the T-1th day. After obtaining the one-ID existing on the T-1th day, the ID node and ID node relationship corresponding to the one-ID existing on the T-1th day are searched from the graph database, thereby obtaining the ID relationship network corresponding to the T-1th day.

[0075] For example, the node mobile phone number 150*** that appears on the Tth day also exists in the identifier mapping dictionary corresponding to the T-1th day. In the identifier mapping dictionary corresponding to the T-1th day, the one-ID corresponding to the mobile phone number 150*** is one-ID01. Then, based on one-ID01, the corresponding ID nodes and ID node relationships are searched in the graph database to find the ID number 320***, account number aaa, mobile phone number 150*** associated with one-ID01, as well as the relationship between the ID number 320*** and the mobile phone number 150***, and the relationship between the ID number 320*** and the account number aaa.

[0076] By first using the ID node that appears on the T-th day and the identifier mapping dictionary corresponding to the T-1th day, the one-ID that exists on the T-1th day is obtained, and then the ID node and ID node relationship corresponding to the one-ID that exists on the T-1th day are searched in the graph database, thereby obtaining the ID relationship network corresponding to the T-1th day, which lays the foundation for the subsequent use of the ID relationship network corresponding to the T-1th day for identifier connectivity and obtaining the first ID relationship network corresponding to the T-th day.

[0077] After obtaining the first ID relationship network corresponding to the Tth day, the maximum connected subgraph algorithm is used to identify and connect the ID nodes that appeared on the Tth day, the ID node relationships that appeared on the Tth day, and the ID relationship network corresponding to the T-1th day. That is, the ID nodes and ID node relationships that appeared on the Tth day are connected to the ID relationship network corresponding to the T-1th day, so as to obtain the first ID relationship network corresponding to the Tth day.

[0078] After obtaining the first ID relationship network, it is necessary to determine the one-ID of the relationship subnetwork in the first ID relationship network.

[0079] Optionally, after the ID node appearing on the Tth day, the ID node relationship appearing on the Tth day, and the ID relationship network corresponding to the T-1st day are connected by identification, and the first ID relationship network corresponding to the Tth day is obtained, the method further includes:

[0080] In the case where a unified identity exists in a relationship subnet in the first ID relationship network, the unified identity of the relationship subnet is the existing unified identity;

[0081] When there is more than one unified identity identifier in the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet is the unified identity identifier with the earliest creation time and the most mergers or splits;

[0082] When there is no unified identity identifier in the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet is a newly generated unified identity identifier.

[0083] Specifically, Table 3 is the attribute table of one-ID. The attributes of one-ID include node value, node generation time, merge or split time, and merge or split times. The relationship attribute between ID node and one-ID includes relationship establishment time, which refers to the time when the relationship between ID node and one-ID is established.

[0084] Table 3 one-ID attribute table

[0085] serial number property describe 1 Node Value The unique identification value of the relationship subnet 2 Node generation time The time when the one-ID node was created 3 Merge or split time Time fields updated when merging or splitting relationship subnetworks 4 Number of merges or splits Number of merges and splits

[0086] When a one-ID exists in a relationship subnet in the first ID relationship network, the one-ID of the relationship subnet is the existing one-ID.

[0087] When there are multiple one-IDs in the relationship subnet in the first ID relationship network, a one-ID with the earliest creation time and the most merged or split times is selected from the multiple one-IDs as the one-ID of the relationship subnet.

[0088] If the creation time and the number of merges or splits of multiple one-IDs are the same, one of the multiple one-IDs is randomly selected as the one-ID of the relationship subnet.

[0089] In the case that the relationship subnet in the first ID relationship network does not have a one-ID, a new one-ID is generated according to the ID nodes and ID node relationships in the relationship subnet, and the newly generated one-ID is used as the one-ID of the relationship subnet.

[0090] The determination of the one-ID of the relationship subnet in the first ID relationship network is clarified. The one-ID opens up the association between IDs. The determination of the one-ID is conducive to obtaining all ID nodes and all ID node relationships related to it based on the one-ID.

[0091] Step 103, clean up the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtain the second ID relationship network corresponding to the Tth day.

[0092] Specifically, the ID nodes whose node activity in the first ID relationship network is lower than the node activity threshold are cleared out from the first ID relationship network; the ID node relationships whose relationship activity in the first ID relationship network is lower than the relationship activity threshold are cleared out from the first ID relationship network. Based on the cleared first ID relationship network, the second ID relationship network corresponding to the Tth day is obtained.

[0093] Optionally, before cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, the method further includes:

[0094] Update the attributes of the ID node and the attributes of the ID node relationship respectively;

[0095] Perform feature extraction on the updated attributes of the ID node and the updated attributes of the ID node relationship respectively to obtain the feature value of the ID node and the feature value of the ID node relationship;

[0096] Obtain the activity of the ID node according to the feature value of the ID node and the weight corresponding to the feature value of the ID node;

[0097] The activity of the ID node relationship is obtained according to the feature value of the ID node relationship and the weight corresponding to the feature value of the ID node relationship.

[0098] Specifically, there are two types of ID nodes and ID node relationships in the first ID relationship network. One type is the ID node and ID node relationship that did not appear on the T-1 day but appeared on the T day; the other type is the ID node and ID node relationship that appeared on the T-1 day and did not appear on the T day.

[0099] For the ID nodes and ID node relationships that did not appear on the T-1th day but appeared on the Tth day, the attributes of all ID nodes in Table 1 are updated, and the attributes of all ID node relationships in Table 2 are updated.

[0100] For the ID nodes and ID node relationships that appear on the T-1th day and do not appear on the Tth day, only the node activity attribute of the ID node is updated, and only the relationship activity attribute of the ID node relationship is updated, and other attributes are not updated.

[0101] Features for evaluating the node activity of the ID node and the relationship activity of the ID node relationship are extracted from the updated attributes of the ID node and the updated attributes of the ID node relationship. Table 4 is a feature extraction processing table of the ID node and the ID node relationship, where s in Table 4 represents the feature value before normalized feature processing.

[0102] Table 4 Feature extraction processing table of ID nodes and ID node relationships

[0103]

[0104]

[0105] As can be seen from Table 4, the features used to evaluate the node activity of ID nodes include node priority, the ratio of active days to the number of days from the first record to the current processing date, the average active interval days, the number of days from the most recent active date to the current processing date, the standard deviation of the active interval days, the regularity of the interval days, and the node degree value.

[0106] The features used to evaluate the relationship activity of ID node relationships include the ratio of active days to the number of days from the first record to the current processing date, the average active interval days, the number of days from the most recent active date to the current processing date, the difference in days between the most recent active dates of the two nodes of the relationship, the standard deviation of the active interval days, the regularity of the interval days, and the relationship priority.

[0107] The extracted features are normalized to obtain the feature values ​​of the ID nodes and the feature values ​​of the ID node relationships.

[0108] The activity of the ID node is obtained according to the feature value of the ID node and the weight corresponding to the feature value of the ID node.

[0109] The expression of the activity of the ID node is as follows:

[0110] When the node priority is not 0

[0111] Where X represents the activity of the ID node, x represents the normalized eigenvalue, the subscript of x corresponds to the number in Table 4, α represents the weight corresponding to the eigenvalue of each node, α1 is the weight corresponding to x2, α2 is the weight corresponding to x3, α3 is the weight corresponding to x4, α4 is the weight corresponding to x5, α5 is the weight corresponding to x7, and α6 is the weight corresponding to x8. The weights are obtained by expert scoring through the hierarchical analysis method.

[0112] The activity of the ID node relationship is obtained according to the feature value of the ID node relationship and the weight corresponding to the feature value of the ID node relationship.

[0113] The expression of the activity of the ID node relationship is as follows:

[0114]

[0115] Where Y represents the activity of the ID node relationship, x represents the normalized eigenvalue, the subscript of x corresponds to the number in Table 4, β represents the weight corresponding to each relationship eigenvalue, β1 is the weight corresponding to x2, β2 is the weight corresponding to x3, β3 is the weight corresponding to the combination of x4 and x5, β4 is the weight corresponding to x6, and β5 is the weight corresponding to x7. The weights are obtained by expert scoring through the hierarchical analysis method.

[0116] By updating the attributes of ID nodes and ID node relationships, extracting features based on the updated attributes, normalizing the features, and finally obtaining the activity level based on the feature values ​​and the weights corresponding to the feature values, the activity level calculation method is clarified, and the activity level is further used to clean up ID nodes and ID node relationships.

[0117] Optionally, the first ID relationship network is cleaned up according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day, including:

[0118] When the activity of the ID node in the first ID relationship network is less than the node activity threshold, the ID node is cleared out of the first ID relationship network;

[0119] When the activity of the ID node relationship in the first ID relationship network is less than the relationship activity threshold, the ID node relationship is cleared out of the first ID relationship network;

[0120] According to the cleaned first ID relationship network, the second ID relationship network corresponding to the T-th day is obtained.

[0121] Specifically, after obtaining the activity of the ID node, the activity of the ID node is compared with the node activity threshold, and the ID nodes whose activity is less than the node activity threshold are cleaned up.

[0122] After obtaining the activity of the ID node relationship, the activity of the ID node relationship is compared with the relationship activity threshold, and the ID node relationship whose activity is less than the relationship activity threshold is cleaned up.

[0123] According to the cleaned first ID relationship network, the second ID relationship network corresponding to the T-th day is obtained.

[0124] By cleaning up ID nodes whose activity is lower than the threshold, expired IDs can be cleaned up. By disconnecting the relationship between ID nodes whose activity is lower than the threshold, weak associations between ID nodes can be cleaned up, thereby improving the reliability, accuracy and stability of user IDs and ID relationship networks.

[0125] Optionally, obtaining the second ID relationship network corresponding to the Tth day according to the cleaned first ID relationship network includes:

[0126] In the case where the cleaning of ID nodes or ID node relationships does not result in the splitting of the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network;

[0127] In the case where the cleaning of ID nodes or ID node relationships causes the relationship subnet in the first ID relationship network to be split into multiple relationship subnets, the unified identity identifier of one relationship subnet among the multiple relationship subnets in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network, and the unified identity identifiers of other relationship subnets in the multiple relationship subnets are newly generated unified identity identifiers.

[0128] Specifically, when cleaning up ID nodes and ID node relationships, it is necessary to consider whether a new relationship subnet will be generated, that is, it is necessary to consider whether the relationship subnet will split during the cleaning, and it is also necessary to consider the determination of the one-ID of the relationship subnet after the split.

[0129] When the cleaning of ID nodes or ID node relationships does not lead to the splitting of the relationship subnet in the first ID relationship network, the one-ID of the relationship subnet remains unchanged, and the one-ID of the relationship subnet in the second ID relationship network is the one-ID of the relationship subnet in the first ID relationship network.

[0130] For example, in the first ID relationship network, the one-ID of relationship subnetwork 1 is one-ID1. Some ID nodes and some ID node relationships are cleaned up from relationship subnetwork 1. After the cleanup, relationship subnetwork 1 is not split. After the cleanup, relationship subnetwork 1 is relationship subnetwork 2 in the second ID relationship network, and the one-ID of relationship subnetwork 2 is still one-ID1.

[0131] When the cleaning of ID nodes or ID node relationships causes the relationship subnet in the first ID relationship network to be split into multiple relationship subnets, a relationship subnet that meets the preset rules is selected from the multiple relationship subnets according to the preset rules to inherit the one-ID of the relationship subnet in the first ID relationship network, and the one-IDs of other relationship subnets are new one-IDs generated based on their own ID nodes and ID node relationships.

[0132] The preset rule may be to select a relationship subnet from multiple relationship subnets in the order of "maximum ID node activity, maximum ID node active days, maximum ID node quantity, and most recent ID node active date".

[0133] When the "maximum ID node activity, the most ID node active days, the largest number of ID nodes, and the most recent ID node active date" corresponding to multiple relationship subnetworks are all the same, a relationship subnetwork is randomly selected from the multiple relationship subnetworks.

[0134] For example, in the first ID relationship network, the one-ID of relationship subnet A is one-IDA. Some ID nodes and some ID node relationships are cleaned up from relationship subnet A. After the cleaning, relationship subnet A is split. After the cleaning, relationship subnet A becomes relationship subnet B, relationship subnet C, and relationship subnet D in the second ID relationship network.

[0135] Compare the ID nodes corresponding to relationship subnetwork B, relationship subnetwork C, and relationship subnetwork D, which have the largest activity. If the ID node corresponding to relationship subnetwork B has the largest activity among the three relationship subnetworks, then the one-ID of relationship subnetwork B is one-IDA of relationship subnetwork A, and relationship subnetwork C and relationship subnetwork D generate new one-IDs based on their own ID nodes and ID node relationships.

[0136] If the maximum active degrees of the ID nodes corresponding to relationship subnet B, relationship subnet C and relationship subnet D are the same, and then compare the ID nodes corresponding to relationship subnet B, relationship subnet C and relationship subnet D respectively, the ID nodes corresponding to relationship subnet B have the most active days, the ID nodes corresponding to relationship subnet C have the most active days, and the ID nodes corresponding to relationship subnet D have the most active days. The maximum number of days is 15 days, the maximum number of days is 25 days, and the maximum number of days is 12 days. Then the one-ID of relationship subnet C is one-IDA of relationship subnet A, and relationship subnet B and relationship subnet D generate new one-IDs based on their own ID nodes and ID node relationships.

[0137] If the "maximum ID node activity, maximum ID node active days, maximum ID node quantity, and most recent ID node active date" corresponding to relationship subnet B, relationship subnet C, and relationship subnet D are the same, a relationship subnet is randomly selected from relationship subnet B, relationship subnet C, and relationship subnet D to inherit the one-IDA of relationship subnet A, and the other two relationship subnets generate new one-IDs based on their own ID nodes and ID node relationships.

[0138] The acquired second ID relationship network is updated to the graph database. For the relationship subnetwork that already has one-ID, the relationship subnetwork with updated attributes and activity is updated to the graph database.

[0139] Depending on whether the cleaning of ID nodes and ID node relationships causes the splitting of the ID relationship subnet, the one-ID of the ID relationship subnet is re-determined, thereby improving the reliability, accuracy and stability of the ID relationship network.

[0140] Optionally, after cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network and obtaining the second ID relationship network corresponding to the Tth day, the method further includes:

[0141] Obtain inactive ID nodes and inactive ID node relationships within a preset time from source ID data records;

[0142] Update the activity of inactive ID nodes and the activity of inactive ID node relationships;

[0143] The second ID relationship network is cleaned up according to the updated activity of the inactive ID nodes and the updated activity of the inactive ID node relationships to obtain the third ID relationship network corresponding to the Tth day.

[0144] Specifically, only the ID nodes on the Tth day, the ID node relationships on the Tth day, and the ID relationship network on the T-1th day were screened, while the ID nodes and inactive ID node relationships that were inactive within the preset time were not considered.

[0145] From the graph database constructed by the source ID data records, the ID nodes and the ID node relationships that are inactive within the preset time are obtained. The preset time can be reasonably set according to the type of the ID node and the type of the ID node relationship.

[0146] The activity of the inactive ID node is updated using the attributes of the inactive ID node. The method for calculating the activity of the ID node is the same as above and will not be repeated here.

[0147] The activity of the inactive ID node relationship is updated using the attributes of the inactive ID node relationship. The calculation method of the activity of the ID node relationship is the same as above and will not be repeated here.

[0148] The updated activity of the inactive ID nodes is compared with the node activity threshold, and the inactive ID nodes whose activity is less than the node activity threshold are cleaned up.

[0149] The updated activity of the inactive ID node relationship is compared with the relationship activity threshold, and the inactive ID node relationship whose activity is less than the relationship activity threshold is cleaned up.

[0150] According to the second ID relationship network in which inactive ID nodes and inactive ID node relationships are cleared, the third ID relationship network corresponding to the Tth day is obtained.

[0151] After cleaning up inactive ID nodes and inactive ID node relationships, it is still necessary to consider whether a new relationship subnet will be generated and the determination of the one-ID of the new relationship subnet.

[0152] When the cleaning of inactive ID nodes or inactive ID node relationships does not lead to the splitting of the relationship subnet in the second ID relationship network, the one-ID of the relationship subnet remains unchanged, and the one-ID of the relationship subnet in the third ID relationship network is the one-ID of the relationship subnet in the second ID relationship network.

[0153] In the case where the cleaning of inactive ID nodes or inactive ID node relationships causes the relationship subnet in the second ID relationship network to be split into multiple relationship subnets, a relationship subnet that meets the preset rules is selected from multiple relationship subnets according to the preset rules to inherit the one-ID of the relationship subnet in the second ID relationship network, and the one-IDs of other relationship subnets are new one-IDs generated according to their own ID nodes and ID node relationships. The third ID relationship network is updated to the graph database, and the ID relationship subnet with all ID nodes deleted is deleted from the graph database.

[0154] Generate the identification mapping dictionary corresponding to the Tth day based on the updated graph database.

[0155] By updating the activity of ID nodes and ID node relationships that have been inactive within a preset time, and then cleaning up the ID relationship network based on the updated activity, the reliability, accuracy and stability of the ID relationship network are improved.

[0156] The method for implementing ID Mapping based on a graph database provided by the present invention realizes the cleaning of expired IDs by cleaning up ID nodes whose activity is lower than a threshold, thereby solving the problem of ID expiration. By disconnecting the relationship between ID nodes whose activity is lower than a threshold, the cleaning of weak associations between ID nodes is realized, thereby solving the problems of ID reuse and ID complex relationships, thereby improving the reliability, accuracy and stability of the user ID relationship network.

[0157] The following is a description of the device for implementing ID Mapping based on a graph database provided by the present invention. The device for implementing ID Mapping based on a graph database described below and the method for implementing ID Mapping based on a graph database described above can refer to each other.

[0158] Figure 3 is a schematic diagram of the structure of the device for implementing ID Mapping based on the graph database provided by the present invention, such as Figure 3 As shown, the present invention also provides a device for implementing ID Mapping based on a graph database, comprising: a first acquisition module 301, a second acquisition module 302 and a third acquisition module 303, wherein:

[0159] The first acquisition module 301 is used to acquire the ID node appearing on the Tth day and the relationship between the ID nodes appearing on the Tth day from the source ID data record;

[0160] The second acquisition module 302 is used to identify and connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day, and obtain the first ID relationship network corresponding to the T-th day;

[0161] The third acquisition module 303 is used to clean up the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtain the second ID relationship network corresponding to the Tth day.

[0162] Specifically, the device for implementing ID Mapping based on a graph database provided in the embodiment of the present application can implement all the method steps implemented in the above-mentioned method embodiment, and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as those in the method embodiment will not be described in detail here.

[0163] Figure 4 is a schematic diagram of the structure of the electronic device provided by the present invention, such as Figure 4 As shown, the electronic device may include: a processor 410, a communication interface 420, a memory 430 and a communication bus 440, wherein the processor 410, the communication interface 420 and the memory 430 communicate with each other through the communication bus 440. The processor 410 may call the logic instructions in the memory 430 to execute a method for implementing ID Mapping based on a graph database, the method comprising: obtaining the ID node appearing on the Tth day and the ID node relationship appearing on the Tth day from the source ID data record; marking and connecting the ID node appearing on the Tth day, the ID node relationship appearing on the Tth day and the ID relationship network corresponding to the T-1st day, and obtaining the first ID relationship network corresponding to the Tth day; cleaning the first ID relationship network according to the activity of the ID node and the activity of the ID node relationship in the first ID relationship network, and obtaining the second ID relationship network corresponding to the Tth day.

[0164] In addition, the logic instructions in the above-mentioned memory 430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0165] On the other hand, the present invention also provides a computer program product, which includes a computer program, and the computer program can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the method for implementing ID Mapping based on a graph database provided by the above methods, and the method includes: obtaining the ID node that appears on the Tth day and the ID node relationship that appears on the Tth day from the source ID data record; identifying and connecting the ID node that appears on the Tth day, the ID node relationship that appears on the Tth day, and the ID relationship network corresponding to the T-1th day to obtain the first ID relationship network corresponding to the Tth day; cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day.

[0166] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the method for implementing IDMapping based on a graph database provided by the above-mentioned methods, the method comprising: obtaining the ID node appearing on the Tth day and the ID node relationship appearing on the Tth day from the source ID data record; identifying and connecting the ID node appearing on the Tth day, the ID node relationship appearing on the Tth day, and the ID relationship network corresponding to the T-1st day, and obtaining the first ID relationship network corresponding to the Tth day; cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtaining the second ID relationship network corresponding to the Tth day.

[0167] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0168] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0169] In the embodiments of the present application, the terms "first", "second", etc. are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the terms used in this way can be interchangeable under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than those illustrated or described here, and the objects distinguished by "first" and "second" are generally of the same type, and the number of objects is not limited. For example, the first object can be one or more.

[0170] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for implementing ID Mapping based on a graph database, characterized in that: include: Obtain the ID node that appears on the Tth day and the relationship between the ID node that appears on the Tth day from the source ID data record; Connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day to obtain the first ID relationship network corresponding to the T-th day; Cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day; Cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day includes: When the activity of an ID node in the first ID relationship network is less than a node activity threshold, clearing the ID node out of the first ID relationship network; When the activity of the ID node relationship in the first ID relationship network is less than the relationship activity threshold, the ID node relationship is cleared out of the first ID relationship network; According to the cleaned first ID relationship network, obtain the second ID relationship network corresponding to the Tth day; After the first ID relationship network is cleaned up according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day, the method further includes: Obtain inactive ID nodes and inactive ID node relationships within a preset time from source ID data records; Updating the activity of the inactive ID node and the activity of the inactive ID node relationship; The second ID relationship network is cleaned up according to the updated activity of the inactive ID node and the updated activity of the inactive ID node relationship to obtain the third ID relationship network corresponding to the Tth day.

2. The method for implementing ID Mapping based on a graph database according to claim 1, characterized in that: Before cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, the method further includes: Update the attributes of the ID node and the attributes of the ID node relationship respectively; Perform feature extraction on the updated attributes of the ID node and the updated attributes of the ID node relationship respectively, and obtain the feature value of the ID node and the feature value of the ID node relationship; Obtaining the activity of the ID node according to the feature value of the ID node and the weight corresponding to the feature value of the ID node; The activity of the ID node relationship is obtained according to the feature value of the ID node relationship and the weight corresponding to the feature value of the ID node relationship.

3. The method for implementing ID Mapping based on a graph database according to claim 1, characterized in that: The acquiring the second ID relationship network corresponding to the T-th day according to the cleaned first ID relationship network includes: In the case where the cleaning of the ID node or the ID node relationship does not result in the splitting of the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network; In the case where the cleaning of the ID nodes or the ID node relationships causes the relationship subnet in the first ID relationship network to be split into multiple relationship subnets, the unified identity identifier of one relationship subnet among the multiple relationship subnets in the second ID relationship network is the unified identity identifier of the relationship subnet in the first ID relationship network, and the unified identity identifiers of other relationship subnets in the multiple relationship subnets are newly generated unified identity identifiers.

4. The method for implementing ID Mapping based on a graph database according to claim 1, characterized in that: Before the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day are connected by identification, and the first ID relationship network corresponding to the T-th day is obtained, the method further includes: According to the ID node appearing on the Tth day and the identification mapping dictionary corresponding to the T-1th day, obtain the unified identity identification existing on the T-1th day; According to the unified identity identifier existing on day T-1, the ID relationship network corresponding to day T-1 is obtained.

5. The method for implementing ID Mapping based on a graph database according to claim 1, characterized in that: After the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day are connected by identification, and the first ID relationship network corresponding to the T-th day is obtained, the method further includes: In the case where a unified identity exists in a relationship subnet in the first ID relationship network, the unified identity of the relationship subnet is the existing unified identity; In the case where there is more than one unified identity identifier in the relationship subnet in the first ID relationship network, the unified identity identifier of the relationship subnet is the unified identity identifier with the earliest creation time and the most merger or split times; In the case that the relationship subnet in the first ID relationship network does not have a unified identity identifier, the unified identity identifier of the relationship subnet is a newly generated unified identity identifier.

6. A device for implementing ID Mapping based on a graph database, characterized in that: include: A first acquisition module is used to acquire the ID node appearing on the Tth day and the relationship between the ID nodes appearing on the Tth day from the source ID data record; The second acquisition module is used to identify and connect the ID nodes appearing on the T-th day, the ID node relationships appearing on the T-th day, and the ID relationship network corresponding to the T-1st day, and obtain the first ID relationship network corresponding to the T-th day; A third acquisition module is used to clean up the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network, and obtain the second ID relationship network corresponding to the Tth day; Cleaning the first ID relationship network according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day includes: When the activity of an ID node in the first ID relationship network is less than a node activity threshold, clearing the ID node out of the first ID relationship network; When the activity of the ID node relationship in the first ID relationship network is less than the relationship activity threshold, the ID node relationship is cleared out of the first ID relationship network; According to the cleaned first ID relationship network, obtain the second ID relationship network corresponding to the Tth day; After the first ID relationship network is cleaned up according to the activity of the ID nodes and the activity of the ID node relationships in the first ID relationship network to obtain the second ID relationship network corresponding to the Tth day, the method further includes: Obtain inactive ID nodes and inactive ID node relationships within a preset time from source ID data records; Updating the activity of the inactive ID node and the activity of the inactive ID node relationship; The second ID relationship network is cleaned up according to the updated activity of the inactive ID node and the updated activity of the inactive ID node relationship to obtain the third ID relationship network corresponding to the Tth day.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method for implementing ID Mapping based on a graph database as described in any one of claims 1 to 5 is implemented.

8. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for implementing ID Mapping based on a graph database as described in any one of claims 1 to 5 is implemented.

Citation Information

Patent Citations

  • Method and device for managing applications and computer readable storage medium

    CN107436779A

  • Identity recognition method and system integrating multiple mobile devices

    CN110648172A

  • Software test management system and method based on big data interconnection

    CN113946501A

  • Data cleansing system and method

    US20210026821A1

  • Community detection method and apparatus, and computer device and storage medium

    WO2021043064A1