WO2021189434A1

WO2021189434A1 - User selection method and device, and server and storage medium

Info

Publication number: WO2021189434A1
Application number: PCT/CN2020/081729
Authority: WO
Inventors: 程际
Original assignee: 深圳市欢太科技有限公司; Oppo广东移动通信有限公司
Priority date: 2020-03-27
Filing date: 2020-03-27
Publication date: 2021-09-30
Also published as: CN115004169A

Abstract

The present application relates to the technical field of information screening, and disclosed are a user selection method and device, and a server and a storage medium. The method comprises: parsing conditional statements of received user description information and an existential relationship of the conditional statements; constructing a query description module having a logical tree structure according to the conditional statements and the existential relationship, the query description module indicating the existential relationship of the conditional statements; and selecting, from a target database, users satisfying the conditions of the query description module. According to the technical solution, users satisfying the conditions of the query description module can be directly selected, so that the efficiency of selection is improved.

Description

User selection method, device, server and storage medium

Technical field

This application relates to the technical field of information screening, and more specifically, to a user selection method, device, server, and storage medium.

Background technique

When the user interacts with the server through the electronic device, a large amount of data is generated, and these data can characterize the characteristics of the user, so that users with specified characteristics can be selected based on the data. In the related art, when users are selected based on multiple conditions, users corresponding to each condition are selected separately, and then filtered according to the users selected respectively, the amount of data processing is relatively large, and the processing efficiency is low.

Summary of the invention

In view of the above-mentioned problems, this application proposes a user selection method, device, server and storage medium to improve the above-mentioned problems.

In the first aspect, an embodiment of the present application provides a user selection method, the method includes: parsing conditional sentences in the received user description information and the existence relationship between the conditional sentences; according to the conditional sentences and the existence relationship, Construct a query description module of a logical tree structure, where the query description module represents the existence relationship between conditional sentences; select users who meet the conditions of the query description module from the target database.

In a second aspect, an embodiment of the present application provides a user selection device. The device includes a parsing unit for parsing the conditional sentences in the received user description information and the existence relationship between the conditional sentences; the building unit is used for According to the conditional sentences and the existence relationship, a query description module of a logical tree structure is constructed. The query description module represents the existence relationship between the conditional sentences; user.

In a third aspect, an embodiment of the present application provides a server, including: one or more processors; a memory; one or more programs, wherein the one or more programs are stored in the memory and configured to Executed by the one or more processors, and the one or more programs are executed by the processor to execute the above-mentioned method.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium in which program code is stored, and the program code can be invoked by a processor to execute the above-mentioned method.

The user selection method, device, server, and storage medium provided in the embodiments of the present application construct a query description module based on the conditional sentences in the user description information and the existence relationship between the conditional sentences, so that users who meet the conditions of the query description module can be directly selected , Improve the efficiency of selection.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings that need to be used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

Fig. 1 shows a flowchart of a user selection method provided by an embodiment of the present application.

Fig. 2 shows a flowchart of a user selection method provided by another embodiment of the present application.

FIG. 3 shows a schematic diagram of a binary tree structure of a query description module provided by an embodiment of the present application.

FIG. 4 shows a schematic diagram of a binary tree structure of a query description module provided by another embodiment of the present application.

Fig. 5 shows a flow structure diagram of a user selection method provided by another embodiment of the present application.

Fig. 6 shows a flow structure diagram of some steps of a user selection method provided by another embodiment of the present application.

Fig. 7 shows a flowchart of a user selection method provided by still another embodiment of the present application.

Fig. 8 shows a functional module diagram of a user selection device provided by an embodiment of the present application.

Fig. 9 shows a structural block diagram of a server provided by an embodiment of the present application.

FIG. 10 is a storage unit for storing or carrying program code for implementing the user selection method according to the embodiment of the present application according to an embodiment of the present application.

Detailed ways

In order to enable those skilled in the art to better understand the solutions of the present application, the technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present application.

In the process of interaction between the user and the server through the electronic device, a large amount of data will be generated. From these data, the characteristics of the user can be analyzed. The characteristics of the user can indicate the user's preferences, personality, financial status, family status, travel mode, One or more types of user information, such as a circle of friends. For example, the feature can be the user’s age, gender, occupation, constellation, birthday, and other user attribute information determined from the information registered by the user or other means, which can be represented by portrait tags; User behavior characteristics generated by the operation, such as the number of times a user opens a certain software, the number of times a certain product is viewed, the number of certain types of goods viewed, the time to download a certain program, the amount of purchases in a week, the number of purchases made using a certain software in a week, etc. Among them, the attribute information of each user can be information with small changes. For example, it is usually possible to change at least at a preset time interval. For example, for the same user, gender, constellation, birthday, etc. are basically unchanged, while changes in age and occupation are relatively constant. Slow, it usually takes a long time to change. The user behavior characteristics are generated by the user operating the electronic device, and the user continues to operate the electronic device, the user behavior characteristics change quickly, such as usually within a time period, such as a day, will change.

The same user may have one or more characteristics, and the conditions are limited according to the characteristics, and the users that need to be selected can be selected. To select users that need to meet multiple conditions, each user needs to be judged according to different conditions, each user needs to make multiple judgments, and the selection results of different conditions need to be combined, which is low in efficiency.

Therefore, the embodiments of the present application provide a user selection method, device, server, and storage medium. By constructing different conditional sentences into a query description module of a logical tree structure, user selection is performed. For each user, the query description module can be used The conditions determine whether the user needs to be selected, and the selection efficiency is higher. The user selection method, device, server, and storage medium provided by the embodiments of the present application will be described in detail below through specific embodiments.

Please refer to FIG. 1, which shows a user selection method provided by an embodiment of the present application. Specifically, the method includes:

Step S110: Parse the conditional sentences in the received user description information and the existence relationship between the conditional sentences.

The user description information describes which users are to be searched, in other words, the user description information includes the conditions that the users to be searched for need to meet and the relationship between these conditions. The conditions that the user needs to satisfy in the user description information are parsed as conditional sentences, and the relationship between the conditions is parsed as the existence relationship between the conditional sentences. For example, if the user description information describes that the user should have both feature A and feature B, the conditional sentences obtained by analysis include A and B, and the existence relationship between the conditional sentences is simultaneous.

Step S120: Construct a query description module in a logical tree structure according to the conditional sentences and the existence relationship, where the query description module represents the existence relationship between the conditional sentences.

The existence relationship between the conditional statement and the conditional statement is used to construct a query description module, which can be constructed based on a logical tree and has a logical tree structure. In the query description module, it includes conditional statements and the existence relationship between conditional statements, and the conditional statements are combined and connected through the existence relationship, indicating the existing conditional statements and the existence relationship between different conditional statements.

Step S130: Select users who meet the conditions of the query description module from the target database.

When selecting users, based on the existence relationship between the conditional statements in the query description module, users who satisfy the conditions corresponding to the conditional statements in the query description module and the users who satisfy the existence relationship between the conditional statements can be selected from the target database.

In the embodiment of the present application, the conditional statement and the relationship between the conditional statement in the user description information are constructed as a query description module of a logical tree structure, so that when the user selects, users who meet the conditions of the query description module can be selected, which improves Choose efficiency.

The embodiments provided in the embodiments of the present application include specific construction methods for query descriptions. For details, please refer to Figure 2. The method provided in this embodiment includes:

Step S210: Analyze the conditional sentences in the received user description information and the existence relationship between the conditional sentences.

When a user needs to be selected, the user to be selected can be described through the user description information, and the conditions that the selected user needs to meet and the relationship between the conditions are limited. For example, in the selection terminal that initiates the user selection request, select features as the condition and set the relationship between the features as the existence relationship between the conditions; or the selection terminal that initiates the user selection request describes the conditions that the user needs to meet in natural language , The description is parsed as user description information.

In addition, in the embodiment of the present application, the obtained existence relationship between conditional sentences includes the existence relationship between a single conditional sentence, and also includes the existence relationship between a combined conditional sentence and other conditional sentences. Among them, the conditional statements can be combined according to the existence relationship between the conditional statements, and the combined conditional statement can be obtained. For example, conditional statements include A, B, C, and D. The relationship between conditional statements includes the existence of conditional statements A and B at the same time, conditional statements C and D exist at the same time, and the combined conditional statement A and B and the combined condition The sentence C and D alternatively exists, then the combined conditional sentence A and B and the combined conditional sentence C and D are combined with (A and B) or (C and D). Understandably, alternative existence means that any one exists and meets the conditions.

The user description information can be sent by the demander who selects the user, or it can be produced based on the conditions that the user needs to meet in the actual business. In the embodiments of the present application, the source of the user description information is not limited.

The user description information expressed through different description methods can correspond to different analysis methods to obtain the conditional generation conditional statement therein, and obtain the relationship between the conditions corresponding to the existence relationship between the generational conditional statements.

The specific sentences included in the conditional sentences are not limited in the embodiments of the present application, and may be various user characteristics, such as characteristics representing user attribute information, user behavior characteristics, and the like. Which existing relationships are specifically included is not limited in the embodiments of the present application, for example, they exist at the same time, for example, they exist alternately. For example, the conditional sentence includes gender as male and occupation as finance. If the existence relationship between male and finance is simultaneous, it means that users whose gender is male and occupation as finance are satisfied at the same time to satisfy the limitation of the user description information.

In a specific implementation, the user description information may indicate conditional sentences through condition identifiers, and indicate the relationship between conditions through relationship identifiers. The conditional sentences indicated by different condition identifiers may include the relationship indicated by the relationship identifier, and the relationship indicated by the relationship identifier represents the relationship between the conditional sentences indicated by the different condition identifiers.

In this embodiment, the method of parsing the user description information to obtain the conditional sentences and the existence relationship may be to obtain the words and sentences corresponding to the condition identifiers in the user description information as the conditional sentences; and to obtain the words and sentences corresponding to the relationship identifiers between the conditional sentences as the conditional sentences. There is a relationship.

Optionally, in this embodiment, the condition identifier and the relationship identifier may be represented by specific characters. When the character representing the condition identifier is recognized, the character can be determined as the condition identifier; when the character representing the relationship identifier is recognized, the character can be determined as the relationship identifier.

Optionally, in this implementation manner, the condition identifier and the relationship identifier may be represented by a specific sentence structure. When the sentence structure representing the condition identifier is recognized, the sentence in the sentence structure can be determined to be a conditional sentence; when the sentence structure representing the relationship identifier is recognized, it can be determined that the sentence in the sentence structure is the existence relationship between the conditional sentences .

For example, the character i represents the condition identifier, and the character j represents the relationship identifier. In a specific usage scenario, if the description in the user description information is i:A j:and i:B j:and i:C, it means that the conditional sentences are A, B, and C, and the difference between A and B The existence relationship is and, and the existence relationship between B and C is and. And represents simultaneous existence, which means that conditions A, B, and C are met at the same time.

In another embodiment, the user description information can be described in natural language. When parsing the user description information, the user description information can be semantically recognized. According to the words and sentences of the user description information in the recognition result, the words and sentences that indicate the conditions and the words and sentences that indicate the existence relationship are determined, and the conditional sentences and the existence between the conditional sentences are generated correspondingly relation. Among them, the words and sentences describing the relationship between the conditional sentences may indicate the existence relationship between the conditional sentences.

In this embodiment, the way of parsing the conditional sentences in the received user description information and the existence relationship between the conditional sentences may be to perform semantic recognition on the user description information, and obtain the user description information that exists in the preset condition library The words and sentences of as the conditional sentences; the words and sentences describing the relationship between the conditional sentences are obtained as the existence description information between the conditional sentences; according to the preset correspondence between the existence description information and the existence relationship, it is determined that the acquired existence description information corresponds Relationship.

Among them, the preset condition library includes each condition statement. Obtaining the words and sentences that exist in the preset condition database in the user description information as the conditional sentences may be to compare each word and sentence obtained by semantic recognition word segmentation with the words and sentences in the preset condition database respectively, and if the words and sentences obtained for each word segmentation are obtained A phrase, if the phrase exists in the preset condition library, it means that the phrase is a condition and can be used as a conditional sentence.

In addition, optionally, a preset correspondence relationship between the presence description information and the presence relationship may be preset. Obtain the words and sentences describing the relationship between the conditional sentences as the existence description information between the conditional sentences. According to the preset correspondence between the existence description information and the existence relationship, determine the existence relationship corresponding to the acquired existence description information, which can be: Words and sentences other than the conditional sentence in the word segmentation result are used as the existence description information, and the existence relationship corresponding to each acquired existence description information is determined according to the preset correspondence between the existence description information and the existence relationship. If the acquired existence description information corresponds to an existence relationship, the existence relationship represents the existence relationship between the conditional sentences described in the existence description information; if the acquired existence description information does not correspond to the existence relationship, it means the existence description The information does not describe the existence relationship, and the existence description information is discarded.

Optionally, an existing vocabulary and sentence library may be preset, and the existing vocabulary and sentence library includes words and sentences describing the existence relationship between conditional sentences. Obtain the words and sentences describing the relationship between the conditional sentences as the existence description information between the conditional sentences. According to the preset correspondence between the existence description information and the existence relationship, determine the existence relationship corresponding to the acquired existence description information, which can be determined Whether other words and sentences other than the conditional sentence in the word segmentation result are in the existence word and sentence database; for the words and sentences in the existence sentence database, it can be used as the existence description information; according to the preset correspondence between the existence description information and the existence relationship, it is determined to obtain The existence relationship corresponding to the existence description information, and the existence relationship represents the existence relationship between the conditional sentences described by the existence description information. Among them, it is understandable that the same existence relationship can be described by different words and sentences, and different existence description information may correspond to the same existence relationship, such as words such as "simultaneous", "and" and "and". Used to describe the existence relationship that exists at the same time.

Step S220: Use conditional sentences as leaf nodes, and use the existence relationship between conditional sentences as root nodes corresponding to the leaf nodes to construct the query description module of the logical tree structure.

In the embodiment of the present application, a query description module of a logical tree structure can be constructed according to the conditional sentences and the existence relationship, and the query description module represents the existence relationship between the conditional sentences. The constructed query description module can be a software code module or other modules with specific expressions. When constructing the query description module of the logical tree structure, the root node indicates the existence relationship, and the root node includes all nodes in the logical tree structure that can be used as root nodes. Leaf nodes that do not have child nodes are used as conditional statements. The root node represents the existence relationship between the conditional sentences corresponding to its child nodes.

In the embodiment of the present application, the specific logic tree is not limited, and the embodiment of the present application mainly uses a binary tree as an example for description.

In a specific implementation scenario, if the conditional statement includes A, B, C, and D, and the conditional statement A, B, C, and D exist at the same time, or the conditional statement A and the conditional statement B exist at the same time, the conditional statement A and the conditional statement The conditional statement composed of B and the conditional statement C exist at the same time, and the conditional statement composed of the conditional statements A, B and C and the conditional statement D exist at the same time. and means that it exists at the same time, and the conditional sentence includes A, B, C, and D as leaf nodes. The root node between the conditional statement A and B is and, the combined conditional statement (A and B) is used as a subtree, the conditional statement C is used as another subtree, and the conditional statement (A and B) is between the conditional statement (A and B) and the conditional statement C The root node of is and; the combined conditional sentence ((A and B) and C) is used as a word count conditional sentence D as another subtree, the conditional sentence ((A and B) and C) and the conditional sentence D The root node is and, and the logical binary tree formed is shown in Figure 3. The query description module obtained can be (((A and B) and C) and D).

In other words, in this implementation scenario, conditional statements A, B, C, and D exist at the same time, then conditional statement A and conditional statement B respectively serve as the child nodes of the root node and form a subtree, and conditional statement C is the other child The tree, with and as the root node, forms a new subtree representing (A and B)and C, the new subtree is used as the left subtree of the binary tree, the conditional statement D is the right subtree of the binary tree, and and is the root of the binary tree The nodes form a binary tree structure as shown in Fig. 3, and the obtained description module can be (((A and B) and C) and D).

Or, in another implementation scenario, the conditional statements include A, B, C, and D. The relationship between the conditional statements includes the existence of conditional statements A and B at the same time, and the conditional statements C and D exist at the same time. The combined condition Sentence A and B and the combined conditional sentence C and D alternatively exist. It is expressed by "or" in existence. The binary tree constructed by conditional sentences A, B, C, and D is shown in Fig. 4, and the query description module with the binary tree structure can be (A and B) or (C and D).

In addition, optionally, in the embodiment of the present application, each existence relationship in the query description module can be described by a corresponding code. If the acquired existence relationship is different from the code expression used to describe the existence relationship, you can also The obtained existence relationship is converted into the corresponding code. For example, if the obtained existence relationship is simultaneous existence, and the code indicating simultaneous existence is "and", then the existence relationship "simultaneous existence" is converted to "and".

Step S230: Select users who meet the conditions of the query description module from the target database.

In the embodiment of the present application, the user data used for user selection is data in a database, and the database is defined as the target database.

The target database includes each user and the conditions that each user meets. According to the query description module to select users from the target database, users that meet the conditions defined by the user description information can be selected. It is understandable that a user who satisfies the condition of the query description module means that the user satisfies the condition corresponding to the conditional sentence in the query description module, and the existence relationship between the user who satisfies the condition corresponding to the conditional sentence.

Among them, the specific selection method may be to determine whether each user satisfies the conditions described by the query description module. The specific judgment method is not limited in the embodiment of the present application. For example, the query description module is (((A and B) and C) and D), and the condition described is that conditions A, B, C, and D are met at the same time, and then for each user, it can be determined whether it meets condition A at the same time , B, C and D, if they are satisfied, the user is selected; if not, the user is not selected. For another example, if the query description module is (((A and B) and C) and D), all users meeting condition A can be selected from the target database, and then users meeting condition B can be selected from users meeting condition A, Obtain users who meet conditions A and B; select users who meet condition C from users who meet conditions A and B, and obtain users who meet conditions A, B, and C; further select users who meet conditions A, B, and C The users of condition D are selected to meet the conditions of A, B, C, and D at the same time.

Thus, all users who meet the conditions of the query description module can be selected from the target database. For example, the target database is Hive, and the user data in the target database is user data stored in Hive. User selection is performed from the user data stored in Hive, and the selection results are stored in the Hive table asynchronously, and all users who meet the conditions of the query description module stored in Hive can be obtained, which is convenient for subsequent export. Among them, the user can be represented by user identity information, such as the device identification (imei) of the electronic device.

Optionally, in the embodiment of the present application, the query description module indicates the existence relationship between conditional sentences, and may not be a complete query sentence. Therefore, in the embodiment of the present application, after the query description module is generated, when users who meet the conditions of the query description module are selected according to the query description module, a query statement can be generated according to the query description module, and the query statement is described by a complete query code Query the existence relationship between the conditional statements included in the description module. Select users based on the generated query statement.

Optionally, in the embodiment of the present application, for the query description module of the logical tree structure, a query statement may be generated by subsequent traversal of the query description module.

Optionally, the target database includes real-time updated user data. If user data is newly generated, the newly generated user data is stored in the target database. For example, for a user, if a certain software is started once, the user behavior characteristic of the number of times the software is started increases by one, and among the user behavior characteristics, the number of times the software is started corresponding to the user increases by one.

In addition, user data may include user behavior characteristics of each user. Because user behavior characteristics change rapidly, and user data in the target database is updated in real time, it can ensure that the selected users are more time-sensitive users, and the search results are more accurate.

Optionally, in this embodiment of the present application, the generation of the query description module and the selection of the user may be the same execution subject, or may be different execution subjects. If it is a different execution subject, the execution subject that generates the query description module can send the query description module to the execution subject of the selected user, and the execution subject of the selected user selects the user according to the query description module.

In the embodiment of the present application, the conditional sentence is used as a leaf node, and the relationship between the conditional sentences is used as the root node corresponding to the leaf node to construct the query description module of the logical tree structure, so that when the user selects, he can choose to satisfy the query The user who describes the conditions of the module improves the efficiency of selection.

In addition, in the embodiment of the present application, since the query description module has a logical tree structure, conditions of different forms can be used as conditional sentences to be combined with other conditions. In addition, different query description modules can also be combined with each other according to their existing relationships to build a new query description module with the same logical tree structure for user query and selection under the same query engine, which improves the extension of the solution sex. Therefore, in the user selection method provided by the embodiment of the present application, the user description information may include multiple description information and the relationship between the multiple description information, and the parsing of the conditional sentence in the received user description information and one of the conditional sentences According to the conditional statement and the existence relationship, constructing the query description module of the logical tree structure may include: separately analyzing the conditional statement in each description information and the existence relationship between the conditional statements; according to each description information Corresponding conditional sentences and existence relationships construct a description module of the logical tree structure; according to the existence relationship between each description information, the description modules corresponding to each description information are combined into the query description module of the logical tree structure. Referring to Figure 5, the method may include:

Step S310: Parse the conditional sentences in each description information and the existence relationship in the conditional sentences respectively.

Each description information is essentially a user description information. For ease of description, it is defined as description information. Each description information in the received user description information can originate from different devices, or can originate from the same terminal. For example, using user characteristics as conditional sentences, in the same terminal, due to the complexity and variability of attribute behavior characteristics, in order to reduce the difficulty of feature setting, the characteristics of attribute information and user behavior characteristics are set in different operation units. Then, the description information related to the characteristics of the attribute information and the description information related to the user behavior characteristics can be obtained. In addition, each description information can be described in the same or different ways.

For this step, refer to the same or corresponding steps in the foregoing embodiment, for example, refer to step S110 and step S210. The parsing of each description information can be the same as the parsing method of user description information in the foregoing embodiment. That is, the conditional sentences and the existence relations in the conditional sentences are obtained by parsing each description information. You can refer to the parsing of the conditional sentences in the user description information and the existence relations between the conditional sentences in the foregoing embodiment, which will not be repeated here.

Step S320: Construct a description module of the logical tree structure according to the conditional sentence and the existence relationship corresponding to each description information.

It is understandable that the conditional sentence and the existence relationship corresponding to each description information are the conditional sentence obtained by parsing the description information and the existence relationship between the conditional sentences.

Each description module is essentially the same in structure and representation as the aforementioned query description module. For ease of description, the query description module generated by each description information is defined as a query module. This step can refer to the same or corresponding steps in the foregoing embodiment, for example, refer to step S120 and step S220, each description module is constructed according to the method of constructing the query description module in the foregoing embodiment, that is, according to the conditional statement corresponding to each description information As well as the existence relationship, the description module for constructing the logical tree structure may refer to the description of the query description module for constructing the logical tree structure according to the conditional statement and the existence relationship in the foregoing embodiment; or refer to the conditional statement in the foregoing embodiment as The leaf node uses the existence relationship between the conditional sentences as the root node corresponding to the leaf node to construct the description of the query description module of the logical tree structure.

In this embodiment, each query description module includes the conditional sentences in the corresponding description information and the corresponding relationship between the conditional sentences, indicating the existence relationship between the conditional sentences in the corresponding description information.

Step S330: Combine the description modules corresponding to the respective description information into the query description module of the logical tree structure according to the existing relationship between the respective description information.

Each description module can be combined into a query description module with a logical tree structure, the logical tree structure is consistent with the logical tree structure in each description module, and the query description module includes all the existence relationships between the conditional sentences in the description information.

Optionally, in this step, each description module can be used as a conditional statement to construct a query description module according to the relationship between the description information corresponding to each description module. For details, please refer to the description of step S120 and step S220.

That is, optionally, in this embodiment, in the logical tree structure of the query description module, different description modules can be used as leaf nodes, and the relationship between the description modules is used as the root node corresponding to the leaf node, or in other words, to describe The existence relationship between modules is used as the root node corresponding to the leaf node where the module is described.

In the embodiment of the present application, the user description information includes the first description information, the second description information, and the existence relationship between the first description information and the second description information as an example for description. The parsing of the conditional sentences and the existence relationship between the conditional sentences in the received user description information; according to the conditional sentences and the existence relationship, the query description module of the logical tree structure is constructed, as shown in FIG. 6, which may include:

Step S321: Parse the first conditional sentence in the first description information and the first existence relationship between the first conditional sentence, and analyze the second conditional sentence in the second description information and the second existence relationship between the second conditional sentence .

The first description information and the second description information are different description information in the user description information. The first description information includes conditional sentences and the existence relationship between the conditional sentences, the conditional sentence in the first description information is defined as the first conditional sentence, and the existence relationship between the conditional sentences in the first description information is defined as the first existence relation. The second description information includes conditional sentences and the existence relationship between the conditional sentences, the conditional sentence in the second description information is defined as the second conditional sentence, and the existence relationship between the conditional sentences in the second description information is defined as the second existence relation.

When parsing the conditional statements in each description information and the relationship between the conditional statements, the first conditional statement in the first description information and the first relationship between the first conditional statement can be analyzed, and the second description information can be parsed The second conditional sentence in and the second existence relationship between the second conditional sentence.

In the embodiment of the present application, for parsing the first conditional sentence in the first description information and the first existence relationship between the first conditional sentence, refer to the same or corresponding steps in the foregoing embodiment, such as step S110 and step S210. The parsing of the first description information may be the same as the parsing of the user description information in the foregoing embodiment.

In the embodiment of the present application, for parsing the second conditional sentence in the second description information and the second existence relationship between the second conditional sentence, refer to the same or corresponding steps in the foregoing embodiment, such as step S110 and step S210. The parsing of the second description information can be the same as the parsing of the user description information in the foregoing embodiment.

Step S331: Construct a first description module of the logical tree structure according to the first conditional sentence and the first existence relationship; construct a second description module of the logical tree structure according to the second conditional sentence and the second existence relationship Describe the module.

In the embodiment of the present application, as described above, the first description module is a query description module constructed based on the first conditional sentence and the first existence relationship, and the second description module is constructed based on the second conditional sentence and the second existence relationship. Query description module. For the specific construction methods of the first description module and the second description module, please refer to the same or corresponding steps in the foregoing embodiment. For example, refer to the description of the foregoing step S120 and step S220 for details, according to the manner of constructing the query description module in the foregoing embodiment Construct the first description module and the second description module.

Step S332: Combine the first description module and the second description module into the query description module of the logical tree structure according to the existing relationship between the first description information and the second description information.

Optionally, in this step, the first description module and the second description module can be respectively used as conditional statements, and the query description module is constructed according to the relationship between the description information corresponding to each description module. For details, please refer to the foregoing step S120 and Description of step S220.

Among them, the logical tree structures in the first description module, the second description module, and the query description module in this step are consistent, for example, all have a binary tree structure.

Step S340: Select users who meet the conditions of the query description module from the target database.

This step can refer to the same or corresponding steps in the foregoing embodiments, and details are not described herein again.

In the embodiments of the present application, a specific implementation manner may be used for description.

In the embodiment of the present application, the user description information may include different description information, and the conditions of the users to be selected are respectively restricted. Different description information can be combined with the generated query description module for user selection, which can effectively expand the description method, submission terminal and input unit of the description information, improve the scalability of the user selection operation, and also improve the selection based on different description information. The efficiency of user selection.

In the embodiment of the present application, the generated multiple query description modules can be combined according to the existence relationship, so as to effectively expand the condition limit of the user to be selected in actual use. Referring to FIG. 7, the method provided in the embodiment of the present application combines multiple query description modules in a manner that also includes:

Step S410: Parse the conditional sentences in the received user description information and the existence relationship between the conditional sentences.

Step S420: Construct a query description module of a logical tree structure according to the conditional sentences and the existence relationship, where the query description module represents the existence relationship between the conditional sentences.

For step S410 and step S420, reference may be made to the same or corresponding steps in the foregoing embodiment, which will not be repeated here.

Step S430: Receive one or more query description modules.

In the embodiments of the present application, query description modules produced by other devices such as servers or terminals may also be received. The method for generating the received query description module may be the same as that in the foregoing embodiment of the present application. For details, refer to the corresponding steps of generating the query description module in the foregoing embodiment.

Optionally, the logical tree structure of the received query description module may be the same as the logical tree structure of the currently generated query description module.

In addition, in the embodiment of the present application, the execution of step S430 is not limited with respect to step S410 and step S420.

Step S440: Combine the received query description module and the currently generated query description module into the query description of the logical tree structure according to the existing relationship between the one or more query description modules and the currently generated query description module Module, used to select users.

In the embodiment of the present application, the existence relationship between one or more query description modules and the currently generated query description module can be sent by other devices or terminals; can be received synchronously with the received query description module; or can be based on default conditions Generated, for example, each query description module exists by default, or exists at the same time.

According to the existing relationship between the various query description modules, all query description modules including the received query description module and the currently generated query description module are combined to generate a new query description module. Wherein, the manner in which each query description module generates a query description module having a logical tree structure can refer to the same or corresponding steps in the foregoing embodiment. For example, consider each query description module as a conditional statement, and construct a logical tree structure query description module based on the relationship between each query description module, and the constructed query description module includes all query description modules corresponding to the users The conditional sentences and the existence relationship between the conditional sentences in the description information indicate the existence relationship between each conditional sentence.

In the embodiment of the present application, the received query description module is another query module as an example for description. Specifically, another query description module may be received; the other query description module and the query description module are combined into a new query description module with a logical tree structure, which is used to select users.

Step S450: Select users who meet the conditions of the query description module from the target database.

In the embodiment of this application, the query description modules of the logical tree structure can be seamlessly combined, multiple combined, or crossed. After any form of user description information is converted into the query description module of the logical tree structure, they can freely interact with other users. The combination of description information can be queried under the same query engine, which is very conducive to the subsequent expansion of new user selection modes and new user description information, which effectively improves the scalability of user selection operations and greatly improves the flexibility of trapping people It satisfies the needs of business parties who need to select users for the combination of various description information. Different business parties can also be combined with each other, positioning the crowd more accurately, and the trapping conditions are easier to understand.

In addition, in the user selection method provided in the embodiment of the present application, it can also be used to de-duplicate the user group. Among them, each user group corresponds to a characteristic, which means that all users in the user group have characteristics corresponding to the user group. When multiple user groups are deduplicated, the characteristics corresponding to the multiple user groups are included in the user description information, and the existence relationship between the characteristics corresponding to the multiple user groups is simultaneous. The query description module generated according to the user description information selects the users that are owned by each user group. For the selected users, one of the multiple user groups is reserved, and the other user groups are deleted. Duplicate user groups.

For example, an explanation will be given by taking the multiple user groups as the first user group and the second user group respectively. The first characteristic is a characteristic of users in the first user group, and the second characteristic is a characteristic of users in the second user group. The conditional sentence obtained by parsing the user description information includes a first feature and a second feature, and the existence relationship between the first feature and the second feature is simultaneous. After selecting users meeting the conditions of the query description module, users meeting the conditions of the query description module can be deleted from the first user group, or users meeting the conditions of the query description module can be deleted from the second user group Users, thereby de-duplicating the first user group and the second user group.

An embodiment of the present application also provides a user selection device 500. As shown in FIG. 8, the device includes: a parsing unit 510 for parsing the conditional sentences in the received user description information and the existence relationship between the conditional sentences The construction unit 520 is used to construct a query description module of a logical tree structure according to the conditional sentence and the existence relationship, and the query description module represents the existence relationship between the conditional sentences; the selection unit 530 is used to select satisfying conditions from the target database The query describes the user of the condition of the module.

Optionally, the construction unit 520 may be used to construct the query description module of the logical tree structure by using conditional sentences as leaf nodes and the existence relationship between the conditional sentences as the root nodes corresponding to the leaf nodes.

Optionally, the logical tree structure is a logical binary tree.

Optionally, the existence relationship includes simultaneous existence or alternative existence.

Optionally, the user description information includes multiple description information and an existing relationship between the multiple description information. The parsing unit 510 can be used to separately analyze the conditional sentences in each description information and the existence relationship between the conditional sentences; the construction unit 520 can be used to construct the logical tree structure according to the conditional sentences and the existence relationship corresponding to each description information The description module; according to the relationship between the various description information, the description module corresponding to each description information is combined into the query description module of the logical tree structure.

Optionally, the user description information includes first description information, second description information, and an existing relationship between the first description information and the second description information. The parsing unit 510 may be used to parse the first conditional sentence in the first description information and the first existence relationship between the first conditional sentence, and parse the second conditional sentence in the second description information and the first conditional sentence between the second conditional sentence. Second, there is a relationship. The constructing unit 520 may be configured to construct the first description module of the logical tree structure according to the first conditional sentence and the first existence relationship; construct the logical tree structure according to the second conditional sentence and the second existence relationship The second description module; according to the existence relationship between the first description information and the second description information, the first description module and the second description module are combined into the query description module of the logical tree structure.

Optionally, the device may further include a module receiving unit for receiving one or more query description modules; the construction unit 520 may be used for communication between the one or more query description modules and the currently generated query description module. If there is a relationship, the received query description module and the currently generated query description module are combined into the query description module of the logical tree structure for selecting users.

Optionally, the device may further include a module receiving unit for receiving another query description module; the construction unit 520 may be used for combining the another query description module and the query description module into a new logical tree structure Query description module, used to select users.

Optionally, the parsing unit 510 may include a semantic recognition subunit, which is used to perform semantic recognition on the user description information, and obtain words and sentences in the user description information existing in a preset condition library as the conditional sentence; information acquisition The subunit is used to obtain the words and sentences describing the relationship between the conditional sentences as the existence description information between the conditional sentences; the determining subunit is used to determine the acquired existence according to the preset correspondence between the existence description information and the existence relationship Describe the existence relationship corresponding to the information.

Optionally, the parsing unit 510 may include a conditional sentence obtaining subunit for obtaining words and sentences corresponding to condition identifiers in the user description information as conditional sentences; a relationship obtaining subunit for obtaining words and sentences corresponding to relationship identifiers between conditional sentences As the existence relationship between conditional statements.

Optionally, the selection unit 530 may include a traversal subunit for performing subsequent traversal on the query description module to generate a query sentence; and the selection subunit for selecting a user according to the query sentence.

Optionally, the selecting unit 530 may be configured to select users who meet the conditions of the query description module from a target database, and the target database includes user data updated in real time.

Optionally, the user data includes user behavior characteristics of each user, and the user behavior characteristics are generated by the user's operation of the electronic device.

Optionally, the conditional sentence obtained by parsing the user description information includes a first feature and a second feature, the existence relationship between the first feature and the second feature is simultaneous, and the first feature is the first feature. The characteristics of a user in a user group. The device may further include a deleting unit for deleting users satisfying the condition of the query description module from the first user group; or deleting users satisfying the condition of the query description module from the second user group.

User behavior characteristics, which are rapidly changing and complex characteristics, need to be stored in the Hive server, while portrait tags and other related characteristics used to represent user attribute information are usually stored in the ElasticSearch server. In order to overcome the problem that the two query engines of ElasticSearch and Hive cannot be combined, and to avoid combining the query results after querying in the two servers respectively, the user selection method, device, server, and storage medium provided in the embodiments of this application are based on the user The conditional sentences and existence relationships in the description information can build a query description module with a logical tree structure. You can also use the Presto engine to skip the ElasticSearch server and directly query the data of the user portrait tags in the Hive server, and combine the portrait tags with user behavior characteristics. search result.

Those skilled in the art can clearly understand that for the convenience and concise description, the above-mentioned method embodiments can be referred to each other; for the specific working process of the above-described device and module, please refer to the corresponding process in the aforementioned method embodiment. , I won’t repeat it here.

In the several embodiments provided in this application, the coupling between the modules may be electrical, mechanical or other forms of coupling.

In addition, each functional module in each embodiment of the present application may be integrated into one processing module, or each module may exist alone physically, or two or more modules may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware or software function modules. Each module can be configured in different electronic devices, and can also be configured in the same electronic device, which is not limited in the embodiment of the present application.

Please refer to FIG. 9, which shows a structural block diagram of a server 600 provided by an embodiment of the present application. The electronic device may include one or more processors 610 (only one is shown in the figure), a memory 620, and one or more programs. Wherein, the one or more programs are stored in the memory 620 and configured to be executed by the one or more processors 610. The one or more programs are executed by the processor to execute the methods described in the foregoing embodiments.

The processor 610 may include one or more processing cores. The processor 610 uses various interfaces and lines to connect various parts of the entire server 600, and executes the server by running or executing instructions, programs, code sets, or instruction sets stored in the memory 620, and calling data stored in the memory 620. 600's various functions and processing data. Optionally, the processor 610 may use at least one of digital signal processing (Digital Signal Processing, DSP), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA), and Programmable Logic Array (Programmable Logic Array, PLA). A kind of hardware form to realize. The processor 610 may integrate one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), a modem, and the like. Among them, the CPU mainly processes the operating system, user interface, and application programs; the GPU is used for rendering and drawing the display content; the modem is used for processing wireless communication. It can be understood that the above-mentioned modem may not be integrated into the processor 610, but may be implemented by a communication chip alone.

The memory 620 may include random access memory (RAM) or read-only memory (Read-Only Memory). The memory 620 may be used to store instructions, programs, codes, code sets, or instruction sets. The memory 620 may include a storage program area and a storage data area, where the storage program area may store instructions for implementing an operating system, instructions for implementing at least one function, instructions for implementing each of the foregoing method embodiments, and the like. The data storage area can also be the data created by the electronic device in use.

Please refer to FIG. 10, which shows a structural block diagram of a computer-readable storage medium provided by an embodiment of the present application. The computer-readable storage medium 700 stores program code, and the program code can be invoked by a processor to execute the method described in the foregoing method embodiment.

The computer-readable storage medium 700 may be an electronic memory such as flash memory, EEPROM (Electrically Erasable Programmable Read Only Memory), EPROM, hard disk, or ROM. Optionally, the computer-readable storage medium 700 includes a non-transitory computer-readable storage medium. The computer-readable storage medium 700 has a storage space for the program code 710 for executing any method steps in the above-mentioned methods. These program codes can be read from or written into one or more computer program products. The program code 710 may be compressed in a suitable form, for example.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the application, not to limit them; although the application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The technical solutions recorded in the foregoing embodiments are modified, or some of the technical features thereof are equivalently replaced; these modifications or replacements do not drive the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

A user selection method, characterized in that the method includes:

Analyze the conditional sentences in the received user description information and the existence relationship between the conditional sentences;

According to the conditional sentences and the existence relationship, construct a query description module of a logical tree structure, where the query description module represents the existence relationship between the conditional sentences;

Select users who meet the conditions of the query description module from the target database.
The method according to claim 1, wherein the constructing a query description module of a logical tree structure according to the conditional sentence and the existence relationship comprises:

Taking conditional sentences as leaf nodes, and taking the existence relationship between conditional sentences as root nodes corresponding to the leaf nodes, the query description module of the logical tree structure is constructed.
The method according to claim 1 or 2, wherein the logical tree structure is a logical binary tree.
The method according to any one of claims 1 to 3, wherein the existence relationship includes simultaneous existence or alternative existence.
The method according to any one of claims 1 to 4, wherein the user description information includes multiple description information and the existence relationship between the multiple description information, and the parsing of the received user description information The conditional sentence and the existence relationship between the conditional sentence; according to the conditional sentence and the existence relationship, the query description module of the logical tree structure is constructed, including:

Resolve the conditional sentences in each description information and the relationship between the conditional sentences;

Construct the description module of the logical tree structure according to the conditional sentence and the existence relationship corresponding to each description information;

According to the relationship between the description information, the description modules corresponding to the description information are combined into the query description module of the logical tree structure.
The method according to any one of claims 1 to 5, wherein the user description information includes first description information, second description information, and the existence relationship between the first description information and the second description information. The parsing of the conditional sentences in the received user description information and the existence relationship between the conditional sentences; according to the conditional sentences and the existence relationship, constructing the query description module of the logical tree structure, including:

Parse the first conditional sentence in the first description information and the first existence relationship between the first conditional sentence, and analyze the second conditional sentence in the second description information and the second existence relationship between the second conditional sentence;

Construct a first description module of the logical tree structure according to the first conditional sentence and the first existence relationship; construct a second description module of the logical tree structure according to the second conditional sentence and the second existence relationship;

According to the existing relationship between the first description information and the second description information, the first description module and the second description module are combined into the query description module of the logical tree structure.
The method according to any one of claims 1 to 5, characterized in that before the selecting from the target database users who meet the conditions of the query description module, the method further comprises:

Receive one or more query description modules;

According to the existence relationship between the one or more query description modules and the currently generated query description module, the received query description module and the currently generated query description module are combined into the query description module of the logical tree structure, using To select users from the target database.
The method according to any one of claims 1 to 7, characterized in that, before the selecting a user satisfying the condition of the query description module from the target database, the method further comprises:

Receive another query description module;

The other query description module and the query description module are combined into a new query description module in a logical tree structure, which is used to select users from the target database.
The method according to any one of claims 1 to 8, wherein parsing the conditional sentences in the received user description information and the existence relationship between the conditional sentences comprises:

Acquiring the words and sentences corresponding to the condition identifiers in the user description information as the condition sentences;

The words and sentences corresponding to the relationship identifiers between the conditional sentences are acquired as the existence relationship between the conditional sentences.
The method according to any one of claims 1 to 8, wherein parsing the conditional sentences in the received user description information and the existence relationship between the conditional sentences comprises:

Performing semantic recognition on the user description information, and acquiring words and sentences in the user description information that are in a preset condition library as the conditional sentence;

Obtain the words and sentences describing the relationship between the conditional sentences as the existence description information between the conditional sentences;

According to the preset correspondence between the existence description information and the existence relationship, the existence relationship corresponding to the acquired existence description information is determined.
The method according to any one of claims 1 to 10, wherein the selecting from a target database users who meet the conditions of the query description module comprises:

Perform subsequent traversal on the query description module to generate query statements;

Select users from the target database according to the query sentence.
The method according to any one of claims 1 to 11, wherein the target database includes user data updated in real time.
The method according to claim 12, wherein the user data includes user behavior characteristics of each user, and the user behavior characteristics are generated by the user's operation of the electronic device.
The method according to any one of claims 1 to 13, wherein the conditional sentence obtained by parsing the user description information includes a first feature and a second feature, and the difference between the first feature and the second feature is The existence relationship of is simultaneous existence, the first characteristic is a characteristic of users in a first user group, and the second characteristic is a characteristic of users in a second user group;

The method also includes:

Delete users who meet the conditions of the query description module from the first user group; or

Delete users who meet the conditions of the query description module from the second user group.
A user selection device, characterized in that the device includes:

The parsing unit is used to analyze the conditional sentences in the received user description information and the existence relationship between the conditional sentences;

The construction unit is configured to construct a query description module of a logical tree structure according to the conditional sentences and the existence relationship, and the query description module represents the existence relationship between the conditional sentences;

The selecting unit is used to select users who meet the conditions of the query description module from the target database.
The device according to claim 15, wherein the construction unit is configured to use conditional sentences as leaf nodes, and the existence relationship between conditional sentences as root nodes corresponding to the leaf nodes to construct the query of the logical tree structure Describe the module.
The device according to claim 15 or 16, wherein the logical tree structure is a logical binary tree.
The device according to any one of claims 15 to 17, wherein the existence relationship includes simultaneous existence or alternative existence.
A server, characterized in that it comprises:

One or more processors;

Memory

One or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs are executed by the processor To perform the method according to any one of claims 1-14.
A computer-readable storage medium, wherein a program code is stored in the computer-readable storage medium, and the program code can be invoked by a processor to execute the method according to any one of claims 1-14.