WO2020199659A1 - Method and apparatus for determining push priority information - Google Patents

Abstract

A method for generating push priority information. The method comprises: acquiring candidate push information regarding a first user, and acquiring a keyword set of the first user (201); acquiring a keyword set corresponding to the candidate push information (202), wherein a keyword in the keyword set corresponding to the candidate push information is requested by at least one second user to establish a correlation with the candidate push information; determining, as a target keyword set, an intersection between the keyword set corresponding to the candidate push information and the keyword set of the first user (203); and generating, according to the target keyword set, push priority information of the candidate push information (204). The present invention realizes a method for determining a push priority of candidate push information by means of generating, according to keywords set by other users for the candidate push information and each keyword corresponding to a target user, push priority information of the candidate push information.

Description

Method and device for determining push priority information

Cross references to related applications

This application is filed based on a Chinese patent application with an application number of 201910261567.7 and an application date of April 2, 2019, and claims the priority of the Chinese patent application. The entire content of the Chinese patent application is hereby incorporated into this application by reference.

Technical field

The embodiments of the present disclosure relate to the field of computer technology, and in particular to methods and devices for determining push priority information.

Background technique

Requesting and browsing push information is a way for users to obtain information. For various information push applications, how to choose the information to push to users is a problem that is constantly being studied. Since the preferences of different users may be quite different, personalized information push is a direction that information push applications strive to achieve.

A common approach is to analyze the types of information users prefer through user behavior data, and at the same time analyze the information in the information database to classify the information. When pushing information to the target user, a higher push priority can be given to the target user’s preferred type of information, so that information can be pushed to the target user according to the priority information to push the target user’s preferred type of information, thereby Realize personalized information push.

Summary of the invention

The embodiments of the present disclosure propose a method and device for generating push priority information.

In the first aspect, the embodiments of the present disclosure provide a method for generating push priority information, the method including: obtaining candidate push information for a first user, and obtaining a keyword set of the first user; obtaining candidate push The keyword set corresponding to the information, wherein the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish a corresponding relationship with the candidate push information; determine the keyword set corresponding to the candidate push information and the first user The intersection of the keyword sets is used as the target keyword set; according to the target keyword set, the push priority information of the candidate push information is generated.

In some embodiments, generating the push priority information of the candidate push information according to the target keyword set includes: determining the number of keywords included in the target keyword set as the target number corresponding to the candidate push information; generating the push according to the target number Priority information, where the number of targets is proportional to the push priority represented by the push priority information.

In some embodiments, generating push priority information of candidate push information according to the target keyword set includes: for keywords in the target keyword set, obtaining the number of associated users corresponding to the keyword, where the number of associated users is used for Indicates the number of users who have requested the establishment of the corresponding relationship between the keyword and the candidate push information; determine the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information; according to the associated users Total number, generating push priority information, where the total number of associated users is proportional to the push priority represented by the push priority information.

In some embodiments, generating the push priority information of the candidate push information according to the target keyword set includes: for keywords in the target keyword set, obtaining the number of target associated users corresponding to the keyword, where the number of target associated users Used to indicate the number of users who have requested the establishment of the corresponding relationship between the keyword and the candidate push information, and have a preset corresponding relationship with the first user; determine the total number of target associated users corresponding to each keyword in the target keyword set The total number of target associated users corresponding to the candidate push information; push priority information is generated according to the total number of target associated users, where the total number of target associated users is proportional to the push priority represented by the push priority information.

In some embodiments, obtaining the candidate push information for the first user includes: selecting push information from the push information set for the first user as the candidate push information; and the above method further includes: responding to determining that the target keyword set meets the predetermined Set conditions, delete candidate push information from the push information set, where the preset conditions include conditions for indicating that the target keyword set is an empty set.

In a second aspect, an embodiment of the present disclosure provides an apparatus for generating push priority information. The apparatus includes: a first obtaining unit configured to obtain candidate push information for a first user, and obtain first The keyword set of the user; the first obtaining unit is further configured to obtain the keyword set corresponding to the candidate push information, wherein the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish and establish the candidate push information The determination unit is configured to determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as the target keyword set; the first generating unit is configured to generate according to the target keyword set The push priority information of the candidate push information.

In some embodiments, the above-mentioned first generating unit is further configured to: determine the number of keywords included in the target keyword set as the target number corresponding to the candidate push information; generate push priority information according to the target number, wherein the target number It is proportional to the push priority represented by the push priority information.

In some embodiments, the above-mentioned first generating unit is further configured to: for keywords in the target keyword set, obtain the number of associated users corresponding to the keyword, where the number of associated users is used to indicate that the establishment of the keyword and The number of users corresponding to the candidate push information; determine the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information; generate push priority information based on the total number of associated users , Where the total number of associated users is proportional to the push priority represented by the push priority information.

In some embodiments, the above-mentioned first generating unit is further configured to: for keywords in the target keyword set, obtain the number of target associated users corresponding to the keyword, where the number of target associated users is used to indicate that the establishment of the key is requested. The corresponding relationship between words and candidate push information, and the number of users who have a preset corresponding relationship with the first user; determine the sum of the number of target associated users corresponding to each keyword in the target keyword set as the target association corresponding to the candidate push information Total number of users; generating push priority information according to the total number of target associated users, where the total number of target associated users is proportional to the push priority represented by the push priority information.

In some embodiments, the above-mentioned first acquiring unit is further configured to: select push information from the push information set for the first user as candidate push information; and the above-mentioned apparatus further includes: a deleting unit configured to respond to determining the target key If the word set meets the preset condition, the candidate push information is deleted from the push information set, where the preset condition includes a condition for indicating that the target keyword set is an empty set.

In the third aspect, the embodiments of the present disclosure provide a method for pushing information. The method includes: obtaining a candidate push information set of a target user; for the candidate push information in the candidate push information set, using any of the information as in the first aspect The method described in the implementation mode generates the push priority information of the candidate push information; selects candidate push information from the candidate push information set in the order of the push priority represented by the corresponding push priority information; corresponds to the target user The terminal device pushes the selected candidate push information.

In a fourth aspect, an embodiment of the present disclosure provides an apparatus for pushing information. The apparatus includes: a second acquiring unit configured to acquire a candidate push information set of a target user; and a second generating unit configured to For the candidate push information in the candidate push information set, the push priority information of the candidate push information is generated using the method described in any one of the implementation modes in the first aspect; the selection unit is configured to be the push priority represented by the corresponding push priority information In order from high to low, candidate push information is selected from the candidate push information set; the push unit is configured to push the selected candidate push information to the terminal device corresponding to the target user.

In a fifth aspect, the embodiments of the present disclosure provide a server, which includes: one or more processors; a storage device for storing one or more programs; when one or more programs are processed by one or more The processor executes, so that one or more processors implement the method described in any one of the first aspect and the third aspect.

In a sixth aspect, the embodiments of the present disclosure provide a computer-readable medium on which a computer program is stored, and when the computer program is executed by a processor, the method described in any one of the first aspect and the third aspect is implemented .

The method and device for determining push priority information provided by the embodiments of the present disclosure are obtained by acquiring candidate push information for a first user, and acquiring a keyword set of the first user; acquiring a keyword set corresponding to the candidate push information, Among them, the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish a corresponding relationship with the candidate push information; determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as Target keyword set; according to the target keyword set, the push priority information of the candidate push information is generated, thereby realizing a way to generate candidate push information according to the keywords set by other users on the candidate push information and the keywords corresponding to the target user The method for determining the push priority of candidate push information.

This method eliminates the need to analyze and classify the candidate push information, but uses keywords set by other users on the candidate push information as the characteristics of the information, and push candidates to target users corresponding to the keywords set for the candidate push information Push information, which expands the way of pushing information and also increases the diversity of push information received by users.

Description of the drawings

By reading the detailed description of the non-limiting embodiments with reference to the following drawings, other features, purposes and advantages of the present disclosure will become more apparent:

FIG. 1 is an exemplary system architecture diagram in which an embodiment of the present disclosure can be applied;

Fig. 2 is a flowchart of an embodiment of a method for generating push priority information according to the present disclosure;

FIG. 3 is a flowchart of another embodiment of a method for generating push priority information according to the present disclosure;

4 is a schematic diagram of an application scenario of the method for generating push priority information according to an embodiment of the present disclosure;

Fig. 5 is a flowchart of an embodiment of a method for pushing information according to the present disclosure;

Fig. 6 is a schematic structural diagram of an embodiment of an apparatus for generating push priority information according to the present disclosure;

Fig. 7 is a schematic structural diagram of an embodiment of an apparatus for pushing information according to the present disclosure;

Fig. 8 is a schematic structural diagram of an electronic device suitable for implementing the embodiments of the present disclosure.

detailed description

The present disclosure will be further described in detail below in conjunction with the drawings and embodiments. It can be understood that the specific embodiments described here are only used to explain the related invention, but not to limit the invention. In addition, it should be noted that, for ease of description, only the parts related to the relevant invention are shown in the drawings.

It should be noted that the embodiments in the present disclosure and the features in the embodiments can be combined with each other if there is no conflict. Hereinafter, the present disclosure will be described in detail with reference to the drawings and in conjunction with embodiments.

FIG. 1 shows an exemplary architecture 100 of an embodiment of the method for generating push priority information or the apparatus for generating push priority information of the present disclosure can be applied.

As shown in FIG. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables.

The terminal devices 101, 102, 103 interact with the server 105 through the network 104 to receive or send messages and so on. Various client applications may be installed on the terminal devices 101, 102, 103. For example, information push applications, search applications, browser applications, etc.

The terminal devices 101, 102, and 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they can be various electronic devices that support receiving push information, including but not limited to smart phones, tablet computers, e-book readers, laptop computers, desktop computers, and so on. When the terminal devices 101, 102, and 103 are software, they can be installed in the electronic devices listed above. It can be implemented as multiple software or software modules (for example, multiple software or software modules for providing distributed services), or as a single software or software module. There is no specific limitation here.

The server 105 may be a server that provides various services, for example, a back-end server that provides support for information push applications on the terminal devices 101, 102, and 103. The server 105 may generate push priority information of the candidate push information based on the intersection of the keyword set corresponding to the candidate push information of the first user acquired from the terminal devices 101, 102, 103 and the keyword set of the first user.

It should be noted that the keyword set corresponding to the above-mentioned candidate push information of the first user and the keyword set of the first user can also be directly stored locally on the server 105, and the server 105 can directly extract the locally stored candidates of the first user. The keyword set corresponding to the push information and the keyword set of the first user are processed and processed. At this time, the terminal devices 101, 102, 103 and the network 104 may not exist.

It should be noted that the method for generating push priority information provided by the embodiments of the present disclosure is generally executed by the server 105. Accordingly, the device for generating push priority information is generally set in the server 105.

It should be noted that the server 105 may be hardware or software. When the server 105 is hardware, it can be implemented as a distributed server cluster composed of multiple servers, or as a single server. When the server 105 is software, it can be implemented as multiple software or software modules (for example, multiple software or software modules for providing distributed services), or as a single software or software module. There is no specific limitation here.

It should be understood that the numbers of terminal devices, networks, and servers in FIG. 1 are merely illustrative. According to implementation needs, there can be any number of terminal devices, networks and servers.

Continuing to refer to FIG. 2, it shows a process 200 of an embodiment of the method for generating push priority information according to the present disclosure. The method for generating push priority information includes the following steps:

Step 201: Obtain candidate push information for the first user, and obtain a keyword set of the first user.

In this embodiment, the first user may be a pre-designated user. The first user may also be a user selected according to preset conditions. For example, the first user may be a user who currently sends an information acquisition request to the execution subject (the server 105 shown in FIG. 1) of the method for generating push priority information.

In this embodiment, the candidate push information may be any information. The candidate push information for the first user may be preset push information corresponding to the first user. Wherein, the establishment conditions of the correspondence between the first user and the candidate push information can be specifically set according to different application scenarios.

For example, all pushable information can be regarded as candidate push information of the first user. For another example, it is also possible to select similar information from all the pushable information as candidate push information of the first user based on the information browsed by the first user in a specified historical time period.

In this embodiment, the keyword set of the first user may be a set of several keywords corresponding to the first user in advance. Among them, the conditions for establishing the correspondence between the first user and the keyword can be specifically set according to different application scenarios. For example, based on the historical behavior data of the first user, the keywords of the user's preferred information may be analyzed, and the analyzed keywords may be used as keywords corresponding to the first user.

For another example, in some application scenarios, when the user browses the push information, the corresponding relationship between the currently browsed push information and a keyword can be established. In other words, users can add keyword tags to push messages. The keywords set for the push information can be freely set by the user, or the user can be provided with multiple optional keywords, and the user can select keywords among them. For example, users can freely set corresponding keywords according to the content of the pushed information. At this time, the keywords used by the first user may be used as the keywords corresponding to the first user.

As an example, when a user browses a music-related article, he can set the label "jazz" for the article. At this time, "jazz" can be used as a keyword corresponding to the first user.

It should be understood that, for the same push information, the user can also establish a correspondence between the push information and two or more keywords.

In this embodiment, the candidate push information of the first user and the keyword set of the first user may be pre-stored in the local or connected database of the execution subject. At this time, the above-mentioned execution subject may obtain the candidate push information of the first user and the keyword set of the first user from a local or connected database. Of course, the above-mentioned execution subject may also obtain the candidate push information of the first user and the keyword set of the first user from some data platforms that store the candidate push information of the first user and the keyword set of the first user.

Step 202: Obtain a keyword set corresponding to the candidate push information.

In this embodiment, the keywords in the keyword set corresponding to the candidate push information may include keywords that have been requested by at least one second user to establish a corresponding relationship with the candidate push information. The second user may be a user who can receive candidate push information through a terminal device or the like.

The candidate push information can be pushed to at least one second user. When browsing the candidate push information, the second user may request to establish a correspondence between the candidate push information and a keyword. In other words, the second user can add keyword tags to candidate push messages. The corresponding keywords set by the second user for the candidate push information may be arbitrarily set by the second user, or may be selected by the second user from the provided at least one optional keyword.

All keywords set by each user of the candidate push information can be used as keywords corresponding to the candidate push information, thereby combining the keyword set corresponding to the candidate push information.

It should be understood that, for the same push message, the second user can also establish a correspondence between the push message and two or more keywords.

In this embodiment, the keyword set corresponding to the candidate push information may be pre-stored in the local or connected database of the execution subject. At this time, the above-mentioned execution subject may obtain the keyword set corresponding to the candidate push information from the local or connected database. Of course, the above-mentioned execution subject may also obtain the keyword set corresponding to the candidate push information from some data platforms that store the keyword set corresponding to the candidate push information.

It should be noted that, in order to facilitate the description of different users, the users are respectively named the first user and the second user. Those skilled in the art should understand that the first and second do not constitute a special limitation on the user.

Step 203: Determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as the target keyword set.

In this embodiment, the keyword set of the first user may be a corresponding keyword set by the first user for the push information browsed by the first user. Generally, users may set keywords for the push information that they follow or are more interested in. Therefore, it can be considered that the first user is more concerned about or more interested in the push information related to the keywords in the corresponding keyword set.

The keyword set corresponding to the candidate push information may be corresponding keywords set for the candidate push by each user who has browsed the candidate push information. Therefore, it can be considered that other users believe that the candidate push information is related to the keywords in the keyword set.

Therefore, if the intersection of the keyword set of the first user and the keyword set corresponding to the candidate push information is empty, it may indicate that the candidate push information may not be push information that the first user pays attention to or is interested in. Correspondingly, if the intersection of the keyword set of the first user and the keyword set corresponding to the candidate push information is not empty, it may indicate that the candidate push information may be push information that the first user pays attention to or is interested in.

Step 204: Generate push priority information of the candidate push information according to the target keyword set.

In this embodiment, the push priority information of the candidate push information may be used to characterize the push priority of the candidate push information. The higher the push priority, the higher the probability that the candidate push information will be pushed to the first user. Among them, the specific representation form of the push priority information can be flexibly set according to different application scenarios.

In this embodiment, the correspondence between various attributes of the target keyword set and the push priority information can be preset, so that after the target keyword set is obtained, the push priority of candidate push information can be obtained according to the preset correspondence. Level information.

For example, the push priority information corresponding to when the target keyword is an empty set can be set, and at the same time, the push priority information corresponding to when the target keyword set is a non-empty set can be set. Of course, when the target keyword set is a non-empty set, it can be further subdivided into multiple types according to the attributes of the target keyword set (such as the number of keywords included), and different push priority information can be set for different types .

From the foregoing analysis, it can be known that whether the target keyword set is an empty set can correspond to whether the candidate push information is the push information that the first user pays attention to or is interested in. Generally, the push information that the first user may be concerned or interested in may be given a higher priority than the push information that the first user may be less concerned or interested in. In this way, the probability that push information that the first user may follow or is interested in is pushed to the first user.

In some optional implementation manners of this embodiment, the number of keywords included in the target keyword set may be determined as the target number corresponding to the candidate push information. Then, the push priority information of the candidate push information can be generated according to the number of targets.

Among them, the more the number of keywords included in the target keyword set, the more likely it is that the candidate push information is the push information that the first user pays attention or is interested in. Therefore, the push priority information can be generated for the candidate push information according to the relationship between the number of targets and the push priority represented by the push priority information.

Generally, as in the aforementioned analysis, some methods for determining the priority of the candidate push information are generally: Step 1, using various information analysis techniques to analyze the candidate push information to determine the keywords of the candidate push information. Step 2: Analyze user historical behavior data to determine keywords that can be used to characterize user preferences. Step 3: Evaluate the priority of the candidate push information according to the similarity between the keywords of the candidate push information and the keywords corresponding to the user.

First of all, for the above step 1, the method described in the above embodiment of the present disclosure does not require the body of the push information to analyze the candidate push information to determine the keywords of the candidate push information, but directly use the keywords set by other users on the candidate push information. As keywords for candidate push messages. Because under normal circumstances, some methods of analyzing candidate push information to determine the corresponding keywords need to continue to occupy a certain amount of CPU (Central Processing Unit), memory, I/O (input/output, input/output) resources Wait. The method of directly obtaining the corresponding keywords stored in advance provided by the above-mentioned embodiments mainly consumes I/O resources, thereby effectively reducing the CPU and memory consumption in the whole process, and also simplifying the determination of keywords for candidate push information. This process helps to increase the speed of determining the keywords for candidate push messages.

Secondly, for the above step two, the method described in the above embodiment of the present disclosure does not need to analyze a large amount of user behavior data to determine the keyword corresponding to the user, but directly uses the pre-stored push information set by the user to browse. Keywords are used as keywords corresponding to users. Similar to the analysis in step one above, it reduces CPU and memory consumption and simplifies the process of determining the keyword corresponding to the user, thereby helping to improve the speed of determining the keyword corresponding to the user.

Thirdly, for the above step 3, the method described in the above embodiment of the present disclosure avoids the more complicated calculation process of calculating the similarity between keywords, but transforms it into a simple calculation of finding the intersection of two keyword sets, and at the same time Determine the priority of the candidate push information according to the obtained intersection. Based on the aforementioned quicker determination of the keywords of the candidate push information and the determination of the keywords corresponding to the user, the speed of determining the priority of the candidate push information is further improved.

Based on the above analysis, the method described in the above embodiment of the present disclosure can effectively improve the speed of determining the priority of candidate push information, and at the same time reduce the CPU and memory consumption in the entire process.

In some optional implementation manners of this embodiment, push information may be selected from the push information set for the first user as the candidate push information for the first user. Wherein, the push information in the push information set may be information that is determined in advance through various methods and is to be pushed to the first user.

At this time, in response to determining that the obtained target keyword set meets the preset condition, the push information candidate for the first user may be deleted from the push information set. Among them, the preset conditions can be specifically set according to different application scenarios. For example, the preset condition may include a condition for indicating that the target keyword set is an empty set. For another example, the preset condition may also include a condition used to indicate that the target keyword set is an empty set, and the number of keywords contained in the target keyword set is greater than a preset threshold.

If the target keyword set is an empty set, that is, when there are keywords in the target keyword set, it can indicate that the candidate push information is the information related to the push information that the first user has historically followed. Therefore, it can be considered that the candidate push information is also likely to be the first Push messages that users are more concerned about.

Correspondingly, if the target keyword set is an empty set, it can indicate that the candidate push information has nothing to do with the push information historically followed by the first user. Therefore, it can be considered that the candidate push information is probably not the push information that the first user will follow.

Based on this, the candidate push information can be deleted from the push information set corresponding to the first user, thereby effectively filtering the push information set corresponding to the first user, so as to delete information that the first user may not care about at all. Since the number of push messages in the push message set corresponding to the first user is reduced, storage space can be effectively saved.

Based on the above method, in some application scenarios, after obtaining the push information set corresponding to the first user, the method described above can be used to determine whether the target keyword set corresponding to each push information in the push information set is an empty set. After that, you can delete the push messages whose corresponding target keyword set is empty from the push message set to obtain the updated push message set. Furthermore, the push information in the updated push information set can be pushed to the terminal device corresponding to the first user.

Thus, on the one hand, by reducing the number of push messages received by the terminal device corresponding to the first user, the data consumption of the terminal device is reduced. On the other hand, by reducing the number of push information in the push information set corresponding to the first user, storage resources are saved and storage costs are reduced.

Continuing to refer to FIG. 3, it shows a process 300 of another embodiment of the method for generating push priority information according to the present disclosure. The method for generating push priority information includes the following steps:

Step 301: Obtain candidate push information for the first user, and obtain a keyword set of the first user.

Step 302: Obtain a keyword set corresponding to the candidate push information.

Step 303: Determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as the target keyword set.

For the specific execution process of the foregoing steps 301, 302, and 303, reference may be made to the related descriptions of steps 201, 202, and 203 in the embodiment corresponding to FIG. 2, which will not be repeated here.

Step 304: For keywords in the target keyword set, obtain the number of associated users corresponding to the keywords.

In this embodiment, the number of associated users may be used to indicate the number of users who have requested to establish the correspondence between the keyword and the candidate push information. That is, the number of associated users can be expressed as the number of users who have set the keyword for the candidate push information.

Step 305: Determine the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information.

Step 306: Generate push priority information according to the total number of associated users.

In this embodiment, based on the foregoing analysis, candidate push information that may be of interest or concern to the first user may be given a higher priority than candidate push information that the first user may be less concerned or interested in. On this basis, according to the total number of associated users corresponding to each keyword in the target keywords, different priorities can be further set for the candidate push information corresponding to the total number of different associated users.

Generally, the larger the total number of corresponding associated users, the more users are interested in the candidate push information, and it is considered that the candidate push information is more related to the set keywords. Therefore, it can be considered that the total number of associated users is proportional to the push priority represented by the push priority information. That is, the greater the total number of associated users, the higher the priority can be set.

In some optional implementation manners of this embodiment, for keywords in the target keyword set, the number of target associated users corresponding to the keywords may also be obtained. The number of target associated users may be used to indicate the number of users who have requested the establishment of the corresponding relationship between the keyword and the candidate push information and have a preset corresponding relationship with the first user.

Wherein, the preset correspondence relationship with the first user may be a pre-designated correspondence relationship. In different application scenarios, different preset correspondences can be set. For example, the user followed by the first user may be regarded as a user with a preset corresponding relationship. For another example, the author of the information browsed by the first user may be regarded as the user with the preset corresponding relationship.

After that, the total number of target associated users corresponding to each keyword in the target keyword set can be determined as the total number of target associated users corresponding to the candidate push information. Furthermore, push priority information can be generated according to the total number of target associated users.

Generally, it can be considered that the push information that is of interest to the user who has a preset corresponding relationship with the first user is more likely to be the push information that is of interest to the first user. Therefore, it can be considered that the total number of target associated users is proportional to the push priority represented by the push priority information. That is, the larger the total number of corresponding target associated users, the higher the priority can be set.

Continuing to refer to FIG. 4, FIG. 4 is a schematic diagram 400 of an application scenario of the method for generating push priority information according to this embodiment. In the application scenario of FIG. 4, the above-mentioned execution subject may first obtain candidate push information 401 for the target user from the connected database. At the same time, the keyword set 402 corresponding to the target user can be obtained.

As shown in the figure, the keyword set 402 corresponding to the target user includes three keywords, namely technology, music, and e-sports. It means that target users are more concerned about information related to technology, music and e-sports.

After that, the above-mentioned execution subject may obtain the keyword set 403 corresponding to the candidate push information 401. As shown in the figure, the keyword set 403 includes one keyword: technology. That can indicate that the candidate push information is information related to technology.

After that, the intersection 404 of the keyword set 402 corresponding to the target user and the keyword set 403 corresponding to the candidate push information 401 may be taken. As shown in the figure, the obtained intersection 404 includes a keyword of "science and technology".

Then, the number of associated users corresponding to the keyword "Technology" in the keyword set 403 corresponding to the candidate push information 401 can be obtained from the database as 30,000. That is to say, 30,000 users have set the keyword "technology" for the candidate push message 401. This can also reflect that 30,000 users believe that the candidate push information 401 is related to "technology". Therefore, it can be considered that users who are concerned about "technology" should also be interested in this candidate push information 401.

After that, the priority information corresponding to the preset number of associated users of 30,000 may be used as the priority information of the candidate push information 401.

It should be understood that the above application scenario is only a process of determining the priority of a candidate push information for the target user. When there are two or more candidate push information for the target user, the priority information of each candidate push information can be obtained according to the above process. Therefore, when pushing information to the target user, the push information with the corresponding higher priority can be pushed to the target user first.

It can be seen from FIG. 4 that, compared with the embodiment corresponding to FIG. 2, the process 400 of the method for generating push priority information in this embodiment highlights that keywords in the target keyword set can be set for candidate push information. Candidate push messages with a larger total number of users set a higher priority. Therefore, on the basis of effectively improving the speed of determining the priority of the candidate push information and reducing the CPU and memory consumption in the whole process, the correctness of the priority information of the candidate push information is ensured.

Continuing to refer to FIG. 5, it shows a process 500 of an embodiment of the method for pushing information according to the present disclosure. The method for pushing information includes the following steps:

Step 501: Obtain a candidate push information set of the target user.

In this embodiment, the target user may be a pre-designated user or a user who meets preset conditions. The execution body (the server shown in FIG. 1) of the method for pushing information can obtain the candidate push information set of the target user from the connected database or a third-party data platform. That is, the corresponding relationship between the target user and the candidate push information set corresponding to the target user can be pre-stored in the database or the third-party data platform connected to the execution subject.

Step 502: For the candidate push information in the candidate push information set, generating push priority information of the candidate push information.

In this embodiment, the method described in the embodiment corresponding to FIG. 2 or FIG. 3 may be used to obtain the priority information of each candidate push information in the candidate push information set.

Step 503: Select candidate push information from the candidate push information set in the order of push priority represented by the corresponding push priority information from high to low.

In this embodiment, the target number of candidate push information can be selected from the candidate push information set in the order of corresponding priority from high to low. Among them, the target number can be a predetermined number. The target number may also be a number determined according to a preset condition (for example, two percent of the number of candidate push information included in the candidate push information set).

Step 504: Push the selected candidate push information to the terminal device corresponding to the target user.

According to the method described in the embodiment corresponding to FIG. 2 or FIG. 3, the method provided by the foregoing embodiment of the present disclosure can preferentially push information related to a certain keyword that has more user attention to users who are concerned about information related to the keyword. Therefore, it is possible to increase the probability that this type of candidate push information that is followed by more users will be pushed to the user terminal corresponding to the user who pays attention to the candidate push information.

Therefore, for candidate push information, it is avoided that this type of candidate push information that is paid attention to by more users is determined as a lower priority without being pushed. Correspondingly, it also reduces the situation that the subject of pushing information pushes more push information that is not of interest to the user, thereby reducing the traffic that the subject of pushing information spends to push the information that is not of interest to the user terminal.

For the user terminal, the probability of receiving this type of candidate push information that is followed by more users is increased, that is, the probability that the user browses to the information that they want to follow is increased, thereby reducing the user terminal’s less interest in receiving it It also helps to reduce the amount of traffic that users need to browse to push information.

With further reference to FIG. 6, as an implementation of the methods shown in the above figures, the present disclosure provides an embodiment of a device for generating push priority information. The device embodiment corresponds to the method embodiment shown in FIG. 2. The device can be applied to various electronic devices.

As shown in FIG. 6, the apparatus 600 for generating push priority information provided in this embodiment includes a first acquiring unit 601, a determining unit 602, and a first generating unit 603. Wherein, the first obtaining unit 601 is configured to obtain the candidate push information for the first user and obtain the keyword set of the first user; the first obtaining unit is further configured to obtain the keyword set corresponding to the candidate push information, wherein , The keywords in the keyword set have been requested by at least one second user to establish a corresponding relationship with the candidate push information; the determining unit 602 is configured to determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as Target keyword set; the first generating unit 603 is configured to generate push priority information of candidate push information according to the target keyword set.

In this embodiment, in the apparatus 600 for generating push priority information: the specific processing of the first acquiring unit 601, the determining unit 602, and the first generating unit 603 and the technical effects brought about by them can be referred to the corresponding FIG. 2 respectively. The related descriptions of step 201, step 202, step 203, and step 204 in the embodiment will not be repeated here.

In some optional implementations of this embodiment, the above-mentioned first generating unit 603 is further configured to: determine the number of keywords included in the target keyword set as the target number corresponding to the candidate push information; and generate push messages according to the target number Priority information, where the number of targets is proportional to the push priority represented by the push priority information.

In some optional implementations of this embodiment, the above-mentioned first generating unit 603 is further configured to: for a keyword in the target keyword set, obtain the number of associated users corresponding to the keyword, where the number of associated users is used for Indicates the number of users who have requested the establishment of the corresponding relationship between the keyword and the candidate push information; determine the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information; according to the associated users Total number, generating push priority information, where the total number of associated users is proportional to the push priority represented by the push priority information.

In some optional implementations of this embodiment, the above-mentioned first generating unit 603 is further configured to: for keywords in the target keyword set, obtain the number of target associated users corresponding to the keyword, where the number of target associated users Used to indicate the number of users who have requested the establishment of the corresponding relationship between the keyword and the candidate push information, and have a preset corresponding relationship with the first user; determine the total number of target associated users corresponding to each keyword in the target keyword set The total number of target associated users corresponding to the candidate push information; push priority information is generated according to the total number of target associated users, where the total number of target associated users is proportional to the push priority represented by the push priority information.

In some optional implementation manners of this embodiment, the above-mentioned first obtaining unit 601 is further configured to: select push information from the push information set for the first user as candidate push information; and the above-mentioned apparatus 600 further includes: a deletion unit (Not shown in the figure) is configured to delete candidate push information from the push information set in response to determining that the target keyword set meets a preset condition, where the preset condition includes a condition for indicating that the target keyword set is an empty set.

The device provided by the above-mentioned embodiment of the present disclosure obtains the candidate push information for the first user through the first obtaining unit, and obtains the keyword set of the first user; obtains the keyword set corresponding to the candidate push information, where the keyword set The keyword of is requested by at least one second user to establish a corresponding relationship with the candidate push information; the determining unit determines the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as the target keyword set; first generation The unit generates the push priority information of the candidate push information according to the target keyword set, thereby realizing a push priority of the candidate push information according to the keywords set by other users on the candidate push information and the keywords corresponding to the target user. Information to determine the push priority of candidate push messages. This method eliminates the need to analyze and classify the candidate push information, but uses keywords set by other users on the candidate push information as the characteristics of the information, and push candidates to target users corresponding to the keywords set for the candidate push information Push information, which expands the way of pushing information and also increases the diversity of push information received by users.

With further reference to FIG. 7, as an implementation of the method shown in FIG. 5, the present disclosure provides an embodiment of a device for pushing information. The device embodiment corresponds to the method embodiment shown in FIG. It can be used in various electronic devices.

As shown in FIG. 7, the apparatus 700 for pushing information provided in this embodiment includes a second acquiring unit 701, a second generating unit 702, a selecting unit 703, and a pushing unit 704. Wherein, the second acquiring unit 701 is configured to acquire the candidate push information set of the target user; the second generating unit 702 is configured to generate the candidate push information in the candidate push information set using the method described in the corresponding embodiment in FIG. 5 Push priority information of the push information; the selection unit 703 is configured to select candidate push information from the set of candidate push information according to the push priority represented by the corresponding push priority information from high to low; the push unit 704 is configured to The terminal device corresponding to the target user pushes the selected candidate push information.

In this embodiment, in the apparatus 700 for pushing information: the specific processing of the second acquiring unit 701, the second generating unit 702, the selecting unit 703, and the pushing unit 704 and the technical effects brought by them can be referred to FIG. 5 respectively. The related descriptions of step 501, step 502, step 503, and step 504 in the corresponding embodiment will not be repeated here.

The device provided by the above-mentioned embodiment of the present disclosure acquires the candidate push information set of the target user through the second acquisition unit, and the second generation unit generates push priority information of the candidate push information for the candidate push information in the candidate push information set, and selects The unit selects candidate push information from the set of candidate push information according to the push priority represented by the corresponding push priority information in descending order, and the push unit pushes the selected candidate push information to the terminal device corresponding to the target user, thereby Information related to a certain keyword that has more users' attention is first pushed to users who follow information related to that keyword, so that this type of candidate push information that is followed by more users can be pushed to those who follow the candidate push information The probability of the user terminal corresponding to the user.

Therefore, for candidate push information, it is avoided that this type of candidate push information that is paid attention to by more users is determined as a lower priority without being pushed. Correspondingly, it also reduces the situation that the subject of pushing information pushes more push information that is not of interest to the user, thereby reducing the traffic that the subject of pushing information spends to push the information that is not of interest to the user terminal.

For the user terminal, the probability of receiving this type of candidate push information that is followed by more users is increased, that is, the probability that the user browses to the information that they want to follow is increased, thereby reducing the user terminal’s less interest in receiving it It also helps to reduce the amount of traffic that users need to browse to push information.

Referring now to FIG. 8, it shows a schematic structural diagram of an electronic device (for example, the server in FIG. 1) 800 suitable for implementing embodiments of the present disclosure. The server shown in FIG. 8 is only an example, and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.

As shown in FIG. 8, the electronic device 800 may include a processing device (such as a central processing unit, a graphics processor, etc.) 801, which may be loaded into a random access device according to a program stored in a read-only memory (ROM) 802 or from a storage device 808 The program in the memory (RAM) 803 executes various appropriate actions and processing. The RAM 803 also stores various programs and data required for the operation of the electronic device 800. The processing device 801, the ROM 802, and the RAM 803 are connected to each other through a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.

Generally, the following devices can be connected to the I/O interface 805: including input devices 806 such as touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; including, for example, liquid crystal display (LCD), speakers, vibration An output device 807 such as a device; a storage device 808 such as a magnetic tape and a hard disk; and a communication device 809. The communication device 809 may allow the electronic device 800 to perform wireless or wired communication with other devices to exchange data. Although FIG. 8 shows an electronic device 800 having various devices, it should be understood that it is not required to implement or have all the illustrated devices. It may alternatively be implemented or provided with more or fewer devices. Each block shown in Figure 8 can represent one device, or can represent multiple devices as needed.

In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network through the communication device 809, or installed from the storage device 808, or installed from the ROM 802. When the computer program is executed by the processing device 801, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

It should be noted that the computer-readable medium described in the embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electric, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above. In the embodiments of the present disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device. In the embodiments of the present disclosure, the computer-readable signal medium may include a data signal propagated in a baseband or as a part of a carrier wave, and a computer-readable program code is carried therein. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. The computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium. The computer-readable signal medium may send, propagate, or transmit the program for use by or in combination with the instruction execution system, apparatus, or device . The program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wire, optical cable, RF (Radio Frequency), etc., or any suitable combination of the above.

The above-mentioned computer-readable medium may be included in the above-mentioned server; or it may exist separately without being installed in the server. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the server, the server is caused to: obtain candidate push information for the first user, and obtain the keyword set of the first user; Obtain the keyword set corresponding to the candidate push information, wherein the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish a corresponding relationship with the candidate push information; determine the keyword set corresponding to the candidate push information and The intersection of the keyword sets of the first user is used as the target keyword set; according to the target keyword set, push priority information of the candidate push information is generated.

The computer program code for performing the operations of the embodiments of the present disclosure may be written in one or more programming languages or a combination thereof. The above-mentioned programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and Including conventional procedural programming languages-such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partly on the user's computer, executed as an independent software package, partly on the user's computer and partly executed on a remote computer, or entirely executed on the remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (for example, using an Internet service provider to Connect via the Internet).

The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions, and operations of the system, method, and computer program product according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram can represent a module, program segment, or part of code, and the module, program segment, or part of code contains one or more for realizing the specified logical function Executable instructions. It should also be noted that, in some alternative implementations, the functions marked in the block may also occur in a different order from the order marked in the drawings. For example, two blocks shown in succession can actually be executed substantially in parallel, or they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and/or flowchart, and the combination of the blocks in the block diagram and/or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or operations Or it can be realized by a combination of dedicated hardware and computer instructions.

The units involved in the embodiments described in the present disclosure can be implemented in software or hardware. The described unit can also be provided in a processor, for example, it can be described as: a processor includes a first acquiring unit, a determining unit, and a first generating unit. Among them, the names of these units do not constitute a limitation on the unit itself under certain circumstances. For example, the first generating unit can also be described as "a unit that generates push priority information of candidate push information according to the target keyword set. ".

The above description is only a preferred embodiment of the present disclosure and an explanation of the applied technical principles. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solution formed by the specific combination of the above technical features, and should also cover the above-mentioned inventive concept without departing from the above-mentioned inventive concept. Other technical solutions formed by any combination of technical features or equivalent features. For example, the above-mentioned features and the technical features disclosed in the embodiments of the present disclosure (but not limited to) having similar functions are replaced with each other to form a technical solution.

Claims (14)

1. A method for generating push priority information, including:

   Acquiring candidate push information for the first user, and acquiring the keyword set of the first user;

   Acquiring a keyword set corresponding to the candidate push information, wherein the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish a corresponding relationship with the candidate push information;

   Determining the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as a target keyword set;

   According to the target keyword set, the push priority information of the candidate push information is generated.
2. The method according to claim 1, wherein said generating push priority information of said candidate push information according to said target keyword set comprises:

   Determining the number of keywords included in the target keyword set as the target number corresponding to the candidate push information;

   According to the number of targets, the push priority information is generated, where the number of targets is proportional to the push priority represented by the push priority information.
3. The method according to claim 1, wherein said generating push priority information of said candidate push information according to said target keyword set comprises:

   For the keywords in the target keyword set, the number of associated users corresponding to the keyword is obtained, where the number of associated users is used to indicate the number of users who have requested to establish the correspondence between the keyword and the candidate push information ；

   Determining the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information;

   The push priority information is generated according to the total number of associated users, where the total number of associated users is proportional to the push priority represented by the push priority information.
4. The method according to claim 1, wherein said generating push priority information of said candidate push information according to said target keyword set comprises:

   For the keywords in the target keyword set, the number of target associated users corresponding to the keyword is obtained, where the number of target associated users is used to indicate that a correspondence relationship between the keyword and the candidate push information has been requested, and The number of users having a preset corresponding relationship with the first user;

   Determining the total number of target associated users corresponding to each keyword in the target keyword set as the total number of target associated users corresponding to the candidate push information;

   The push priority information is generated according to the total number of target associated users, wherein the total number of target associated users is proportional to the push priority represented by the push priority information.
5. The method according to any one of claims 1 to 4, wherein said obtaining candidate push information for the first user comprises:

   Selecting push information from the push information set for the first user as the candidate push information; and the method further includes:

   In response to determining that the target keyword set meets a preset condition, delete the candidate push information from the push information set, where the preset condition includes a condition for indicating that the target keyword set is an empty set.
6. A device for generating push priority information, including:

   The first obtaining unit is configured to obtain candidate push information for the first user and obtain the keyword set of the first user;

   The first obtaining unit is further configured to obtain a keyword set corresponding to the candidate push information, wherein the keywords in the keyword set corresponding to the candidate push information have been requested by at least one second user to establish a connection with the Correspondence of candidate push information;

   The determining unit is configured to determine the intersection of the keyword set corresponding to the candidate push information and the keyword set of the first user as a target keyword set;

   The first generating unit is configured to generate push priority information of the candidate push information according to the target keyword set.
7. The apparatus according to claim 6, wherein the first generating unit is further configured to:

   Determining the number of keywords included in the target keyword set as the target number corresponding to the candidate push information;

   According to the number of targets, the push priority information is generated, where the number of targets is proportional to the push priority represented by the push priority information.
8. The apparatus according to claim 6, wherein the first generating unit is further configured to:

   For the keywords in the target keyword set, the number of associated users corresponding to the keyword is obtained, where the number of associated users is used to indicate the number of users who have requested to establish the correspondence between the keyword and the candidate push information ；

   Determining the total number of associated users corresponding to each keyword in the target keyword set as the total number of associated users corresponding to the candidate push information;

   The push priority information is generated according to the total number of associated users, where the total number of associated users is proportional to the push priority represented by the push priority information.
9. The apparatus according to claim 6, wherein the first generating unit is further configured to:

   For the keywords in the target keyword set, the number of target associated users corresponding to the keyword is obtained, where the number of target associated users is used to indicate that a correspondence relationship between the keyword and the candidate push information has been requested, and The number of users having a preset corresponding relationship with the first user;

   Determining the total number of target associated users corresponding to each keyword in the target keyword set as the total number of target associated users corresponding to the candidate push information;

   The push priority information is generated according to the total number of target associated users, wherein the total number of target associated users is proportional to the push priority represented by the push priority information.
10. The device according to any one of claims 6-9, wherein the first obtaining unit is further configured to:

    Select push information from the push information set for the first user as the candidate push information; and the device further includes:

    The deleting unit is configured to delete the candidate push information from the push information set in response to determining that the target keyword set meets a preset condition, wherein the preset condition includes a set for indicating the target keyword set Conditions for the empty set.
11. A method for pushing information, including:

    Obtain the candidate push information set of the target user;

    For the candidate push information in the candidate push information set, the method according to any one of claims 1 to 5 is used to generate push priority information of the candidate push information;

    Selecting the candidate push information from the candidate push information set in the order of push priority represented by the corresponding push priority information from high to low;

    Push the selected candidate push information to the terminal device corresponding to the target user.
12. A device for pushing information, including:

    The second obtaining unit is configured to obtain the candidate push information set of the target user;

    The second generating unit is configured to generate the push priority information of the candidate push information by using the method according to any one of claims 1 to 5 for the candidate push information in the candidate push information set;

    The selecting unit is configured to select candidate push information from the set of candidate push information in descending order of push priority represented by corresponding push priority information;

    The pushing unit is configured to push the selected candidate pushing information to the terminal device corresponding to the target user.
13. A server that includes:

    One or more processors;

    A storage device on which one or more programs are stored;

    When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-5 and 11.
14. A computer-readable medium with a computer program stored thereon, wherein the program is executed by a processor to implement the method according to any one of claims 1-5 and 11.

Images