CN116366586A - Message pushing method, electronic device, storage medium and computer program product - Google Patents

Abstract

The present disclosure provides a method for pushing a message, including: acquiring the message value of each message by using a message value calculation formula according to the total number of the user terminals corresponding to each message and the user weight of each user terminal; determining a push cost for each message based on the historical push data, wherein the push cost comprises push time consumed by pushing the message; and determining a target push sequence for each message within the range of the push total resource by utilizing a dynamic programming algorithm in combination with the message value of each message and the push cost thereof, wherein the target push sequence represents a message sequence with the maximum sum of the message values of a plurality of messages pushed within the range of the push total resource. The present disclosure also provides an electronic device, a storage medium, and a computer program product.

Description

Message pushing method, electronic device, storage medium and computer program product

technical field

The present disclosure relates to the Internet field, and in particular to a method for pushing messages, electronic equipment, storage media and computer program products.

Background technique

Message push is a process in which the administrator Master extracts messages to be pushed from the database and pushes them to multiple client workers. Fig. 1 is a schematic diagram of the architecture of the message push system in the related art. With reference to Fig. 1, the message push system in the related art usually consists of a Master and a plurality of Workers, and the Master obtains the message to be pushed from the database (i.e. step 1); then, Put the message to be pushed into the message queue to be pushed (ie, step ②); then, multiple workers obtain messages from the message queue in parallel, and complete the process of pushing (ie, step ③); finally, each worker pushes the message according to the message The result updates the message state and stores it in the database (that is, step ④). The result of the message push is mainly used to determine the success rate of the message push, and the success rate of the message push is used to measure the pros and cons of the message push system. Wherein, the success rate of message push is a ratio of the number of successfully pushed messages to the total number of pushed messages. In order to improve the success rate of message push, the Master usually adds a push strategy (that is, step ⑤), adding the message that failed to be sent and the message to be pushed to the message queue to be pushed, and re-push it to the Worker to improve the success rate of message push.

Although the push strategy in related technologies can improve the success rate of message push to a certain extent, the success rate of message push can only evaluate the system’s completion of tasks in the final state, while ignoring the importance and importance of each message itself. Delivery costs and other factors. Then, the resources consumed by pushing different messages and the experience brought to users are different. If there is no difference in pushing messages, there will be a situation where large resource costs are consumed to push messages that have little impact on users. That is, system resources are wasted, and user experience cannot be effectively improved.

Contents of the invention

The disclosure provides a method for pushing messages, electronic equipment, storage media and computer program products.

According to one aspect of the present disclosure, such a method for pushing messages is provided, which may include: according to the total number of clients corresponding to each of the messages and the user weight of each client, using a message value calculation formula to obtain the message value of each of the messages ; Based on the historical push data, determine the push cost of each of the messages, wherein the push cost includes the push time generated by pushing the message; and combine the message value of each of the messages and the push cost, using dynamic A planning algorithm determines a target push sequence for each of the messages within the scope of the total push resources, wherein the target push sequence represents the sum of the message values of a plurality of the messages pushed within the scope of the total push resources Maximum message sequence.

In some embodiments, the message value calculation formula is:

表示第i个消息的消息价值，/>

表示第i个消息所对应的用户端总数，w_j表示第j个用户端的用户权重，i表示消息的序号，j表示用户端的序号，j的取值为/>

in,

Indicates the message value of the i-th message, />

Represents the total number of clients corresponding to the i-th message, w _j represents the user weight of the j-th client, i represents the sequence number of the message, j represents the sequence number of the client, and the value of j is />

In some embodiments, before obtaining the message value of each of the messages according to the total number of clients corresponding to each of the messages and the user weight of each client, using the message value calculation formula, including: responding to the historical push There are messages that fail to be pushed to the user end in the data, determine the total number of subscription messages of each of the user ends and the total number of failed messages that fail to be pushed to the user end; and substitute the total number of subscription messages and the total number of failed messages into the user A weight formula, using the user weight formula to calculate the user weight of each of the user terminals, wherein the user weight is used to represent the degree of demand of the user terminal for each of the messages.

In some implementation manners, the user weight formula is:

其中，T_L表示失败消息总数，T_S表示订阅消息总数。

Among them, T _L represents the total number of failed messages, and T _S represents the total number of subscribed messages.

In some embodiments, before obtaining the message value of each of the messages according to the total number of clients corresponding to each of the messages and the user weight of each client, using the message value calculation formula, including: responding to the historical push There is no message of failure to push to the client in the data, determine the total number of subscription messages of each client; and use the reciprocal of the total number of subscription messages of the client as the user weight of the client, wherein the user weight It is used to characterize the degree of demand of the client for each of the messages.

In some embodiments, the determining the push cost of each of the messages based on the historical push data includes: extracting multiple push durations of each of the messages from the historical push data; Extract the push duration with the largest numerical value as the push cost of the message.

In some implementations, after using the dynamic programming algorithm to determine the target push sequence for each of the messages within the scope of the total push resources, it includes: controlling the message push system to send messages to each of the user terminals sequentially according to the target push sequence Pushing each of the messages, wherein the target push sequence includes data to be pushed and/or messages that fail to be pushed to the client.

According to another aspect of the present disclosure, there is provided such an electronic device, including a memory, a processor, and a computer program stored on the memory and operable on the processor. When the processor executes the program, the above-mentioned The method for pushing messages described in any one of the implementation manners.

According to another aspect of the present disclosure, there is provided such a readable storage medium, the computer program is stored in the readable storage medium, and the computer program is suitable for being loaded by a processor, so as to execute the method described in any one of the above-mentioned implementation modes. The push method of the message.

According to yet another aspect of the present disclosure, there is provided such a computer program product, including computer programs/instructions, when the computer programs/instructions are executed by a processor, the method for pushing messages described in any of the foregoing implementation manners is implemented.

Description of drawings

The accompanying drawings illustrate exemplary embodiments of the present disclosure and, together with the description, serve to explain the principles of the disclosure, are included to provide a further understanding of the disclosure, and are incorporated in and constitute this specification. part of the manual.

FIG. 1 is a schematic diagram of a message push system architecture in the related art.

Fig. 2 is a flowchart of a method for pushing messages according to an exemplary embodiment of the present disclosure.

Fig. 3 is an architecture diagram of a method for pushing messages according to an exemplary embodiment of the present disclosure. as well as

Fig. 4 is a block diagram of an apparatus for pushing messages according to an exemplary embodiment of the present disclosure.

Detailed ways

The present disclosure will be further described in detail below with reference to the drawings and embodiments. It can be understood that the specific implementation manners described here are only used to explain relevant content, rather than to limit the present disclosure. It should also be noted that, for ease of description, only parts related to the present disclosure are shown in the drawings.

It should be noted that, in the case of no conflict, the implementation modes and the features in the implementation modes in the present disclosure can be combined with each other. The technical solutions of the present disclosure will be described in detail below with reference to the accompanying drawings and in combination with implementation manners.

Unless otherwise specified, the illustrated exemplary embodiments/embodiments are to be understood as exemplary features providing various details of some manner in which the technical idea of the present disclosure can be implemented in practice. Therefore, unless otherwise stated, the features of various embodiments/embodiments may be additionally combined, separated, interchanged, and/or rearranged without departing from the technical concept of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments and is not of limitation. As used herein, the singular forms "a" and "the" are intended to include the plural forms as well, unless the context clearly dictates otherwise. In addition, when the terms "comprising" and/or "comprising" and their variants are used in this specification, it means that the stated features, integers, steps, operations, parts, components and/or their groups exist, but do not exclude One or more other features, integers, steps, operations, parts, components and/or groups thereof are present or in addition. Note also that, as used herein, the terms "substantially," "about," and other similar terms are used as terms of approximation and not as terms of degree, and as such, they are used to explain what one of ordinary skill in the art would recognize. Inherent deviations from measured, calculated and/or supplied values.

FIG. 2 is a flow chart of a method for pushing a message in an exemplary embodiment of the present disclosure; FIG. 3 is an architecture diagram of a method for pushing a message in an exemplary embodiment of the present disclosure. The message pushing method S100 will be described below with reference to FIG. 2 and FIG. 3 .

Step S102, according to the total number of user terminals corresponding to each message and the user weight of each user terminal, use the message value calculation formula to obtain the message value of each message.

The message refers to the data containing the target content that the administrator Master pushes to the client Worker. The same message can be pushed to multiple clients according to the subscription instruction of the client; of course, the same client can also subscribe to multiple messages according to its own needs. . Based on the foregoing, the total number of clients refers to the number of clients subscribing to each message.

The client is the receiver of the message, and is used to receive the message placed in the message queue by the administrator. The client will subscribe to the message it wants to read in the message queue according to its own needs, but limited by the push performance of the message push system, there may be cases where the message push subscribed by the client fails, resulting in the client not being able to read part of the message in time information.

The user weight is used to represent the degree of demand of a certain client for a single message, that is, the degree of influence of a single message on a certain client. The user weight is proportional to the degree of demand of the user end for a single message. For example, if a client subscribes to ten messages, a single message push failure will have relatively little impact on the client, and the user weight of the client will be small; on the contrary, if a client subscribes to 2 messages, then If a single message fails to be pushed, the impact on the client is relatively large, so the user weight of the client is relatively large.

Message value calculation formula The formula for calculating the message value of a message based on the total number of clients subscribing to a message and the user weight of each client subscribing to the message. The message value model uses the message value calculation formula to determine the message value of each message. The message value is used to represent the degree of user experience improved by message push. The message value is proportional to the total demand of all users who subscribe to the message. Each message can calculate its message value through the message value calculation formula.

The formula for calculating message value is:

表示第i个消息的消息价值，/>

表示第i个消息所对应的用户端总数，w_j表示第j个用户端的用户权重，i表示消息的序号，j表示用户端的序号，j的取值为/>

in,

Indicates the message value of the i-th message, />

Represents the total number of clients corresponding to the i-th message, w _j represents the user weight of the j-th client, i represents the sequence number of the message, j represents the sequence number of the client, and the value of j is />

Step S104, based on the historical push data, determine the push cost of each message.

The historical push data records the push time of each message in the historical push process, and the maximum time spent extracting and pushing a message from the historical push data is used as the push cost of pushing the message. The message cost model determines the push cost of each message in the historical push data. Since the push time of each message is different, in order to push the message to maximize the value of the message within the scope of the total push resources (that is, the limited push time) , you need to get the push cost of each message.

Step S106, combining the message value of each message and its push cost, using a dynamic programming algorithm to determine the target push sequence for each message within the scope of the total push resources.

The dynamic programming algorithm is to arrange and combine the message value and push cost of various messages, select the message with the optimal value and combine it to determine the target push sequence. The target push sequence can maximize the sum of the message values of multiple pushed messages within the scope of the total push resources, thereby maximizing the user experience. The total push resource is the time period that the message push system provides for the administrator to perform message push. If this time is exceeded, the message push system is used to perform other tasks and no longer provides services for message push.

In some implementations, before step S102, the following steps may be included: in response to messages that failed to be pushed to the client in the historical push data, determine the total number of subscription messages of each client and the total number of failed messages that failed to be pushed to the client; and Substitute the total number of subscribed messages and the total number of failed messages into the user weight formula, and use the user weight formula to calculate the user weight of each client.

The historical push data also stores the push status of each message to the user end, and it can be determined through the historical push data whether there is a message that failed to push to a certain user end during the historical message push process. Messages that fail to be pushed mainly refer to messages that have been subscribed by the client, but failed to be pushed to the client due to the limitations of the message push system. If there are messages that failed to be pushed to a certain client in the historical data, determine the total number of failed messages that failed to be pushed to the client. The total number of subscribed messages refers to the number of messages subscribed by each client in the message queue.

The user weight formula is a formula for calculating the user weight of each client according to the total number of subscribed messages and the total number of failed messages of each client, and the user weight is used to represent the degree of demand of the client for each message. Each client has different user weights according to the number of subscribed messages and the number of message push failures; that is, each client has different requirements for messages. The user weight formula can be used to personally determine the degree of demand for messages by each user terminal, and then pave the way for determining the message value of each message, so that during the message push process, the message with the highest message value can be preferentially pushed to the user terminal with strong demand , to avoid resource consumption and user experience degradation caused by indiscriminate message push.

More specifically, the user weight formula can be:

其中，T_L表示失败消息总数，T_S表示订阅消息总数。

Among them, T _L represents the total number of failed messages, and T _S represents the total number of subscribed messages.

In some implementations, before step S102, the following steps may also be included: in response to the fact that there is no message of failure to push to the user terminal in the historical push data, determine the total number of subscription messages of each user terminal; and use the reciprocal of the total number of subscription messages of the user terminal User weight as user end.

Use historical push data to determine whether there is a message that fails to be pushed to a certain client during the historical message push process. If there is no push failure message, it proves that the messages subscribed by the client are successfully pushed, and then the number of messages subscribed by the client can be used as an influencing parameter for determining its user weight.

At this point, the user weight formula can be:

In some implementations, the execution of step S104 includes: extracting multiple push durations of each message from the historical push data; and extracting the push duration with the largest numerical value among the multiple push durations as the push cost of the message.

In some implementations, after step S106, it also includes: controlling the message push system to sequentially push each message to each client according to the target push sequence, wherein the target push sequence includes data to be pushed and/or messages that fail to be pushed to the client .

In order to improve the push success rate of the message push system, messages that fail to be pushed to the client can be returned to the message queue by resending, so that they can be subscribed and read by the client. However, in order to maximize the value of push messages and maximize user experience, these resent messages are fused with messages to be pushed. After determining the message value through the preceding steps, comprehensively consider user weight and push total resources , can only be sequentially written into the message queue through the indication of the target push sequence.

The process of determining the formula for calculating the message value will be described in detail below by way of example.

Table 1

Table 1 is a two-dimensional table of association between client and message push in a subscription scenario. As shown in Table 1, its horizontal direction represents message dimension data, including the first message R ₁ , the second message R ₂ , the third message R ₃ , the fourth message R ₄ , the fifth message R ₅ , the The six messages R ₆ and the seventh message R ₇ ; the longitudinal direction represents the user terminal dimension data, including the first user terminal U ₁ , the second user terminal U ₂ , the third user terminal U ₃ , and the fourth user terminal U ₄ , the fifth user terminal U ₅ , the sixth user terminal U ₆ , and the seventh user terminal U ₇ ; the symbol "√" is a mark of a user terminal for subscribing to messages. Obviously, there are two user terminals such as the third user terminal U ₃ and the fifth user terminal U ₅ subscribed to the first message R ₁ ; there are the fourth user terminal U ₄ , the fifth user terminal U ₅ and The sixth client U ₆ and other three clients subscribed to the second message R ₂ ; there are the first client U ₁ , the second client U ₂ , the third client U ₃ and the fourth client End U ₄ subscribes to the third message R ₃ ; there are second user end U ₂ , third user end U ₃ , fourth user end U ₄ and fifth user end U ₅ subscribed to the fourth message R ₄ ; the first user terminal U ₁ and the second user terminal U ₂ have subscribed to the fifth message R ₅ ; the second user terminal U ₂ and the third user terminal U ₃ have subscribed to the sixth message R ₆ ; there is a seventh user terminal U ₇ subscribed to the seventh message R ₇ .

If only the total number of clients affected by the message is used as the message value of the message, then the message values corresponding to the first message to the seventh message are: 2, 3, 4, 4, 2, 2, 1; obviously, To determine the value of messages in this way, it is impossible to determine the value ranking among the messages with the same total number of affected clients. For example, the message values of the first message R ₁ , the fifth message R ₅ and the sixth message R ₆ are all 2; For another example, the message values of the third message R ₃ and the fourth message R ₄ are both 4.

Apparently, the foregoing method cannot generate value distinctions for messages that affect the same total number of client terminals. Taking the first message R ₁ , the fifth message R ₅ and the sixth message R ₆ as an example, since the first message R ₁ is the only one subscribed by the third user terminal U ₃ and the fifth user terminal U ₅ message, if the first message R ₁ is not pushed, the influence on the two client ends is 100%. The first user terminal U ₁ that subscribes to the fifth message R ₅ also subscribes to the third message R ₃ , so when the fifth message R ₅ is not pushed, the impact on the first user terminal U ₁ is 50%; Similarly, the second user terminal U ₂ subscribed to the fifth message R ₅ is also subscribed to the third message R ₃ , the fourth message R ₄ and the sixth message R ₆ , so the fifth message R is not pushed ₅ , the impact on the second user terminal _U2 is 25%. The second user terminal U ₂ that subscribes to the sixth message R ₆ also subscribes to the third message R ₃ , the fourth message R ₄ and the fifth message R ₅ , so when the fifth message R ₅ is not pushed, The impact on the second user terminal U ₂ is 25%; similarly, the third user terminal U ₃ subscribed to the sixth message R ₆ also subscribes to the first user terminal U ₁ , the third user terminal U ₃ and the fourth user terminal U ₄ , so the impact of not pushing the sixth message R ₆ on the third user terminal U ₃ is 25%. It can be seen that the first message R ₁ has a greater impact on the subscribed client than other messages, so its message value is greater. To sum up, when considering the message value of a message, it is necessary to take the user weight representing the needs of the user terminal as one of the measurement criteria of the message value.

On the basis of taking the total number of user terminals as the value of the message, the weight of the user is increased.

Right now

Among them, the user weight is processed separately according to whether there is a push failure message, and firstly, the user weight is determined for the case that there is no push failure message

利用此方式，对第二个消息R₂、第三个消息R₃、第四个消息R₄、第五个消息R₅、第六个消息R₆和第七个消息R₇分别进行计算，即可获得第二个消息R₂、第三个消息R₃、第四个消息R₄、第五个消息R₅、第六个消息R₆和第七个消息R₇的消息价值分别为：5.00、5.33、4.67、1.50、1.00、1.00。此时，具有用户端总数相同的消息的消息价值就区分开了。对前述七个消息的消息价值进行倒序排列，即可获得价值序列：R₃、R₂、R₄、R₅、R₁、R₆、R₇。以R₂和R₄为例对价值序列的结果进行验证，显然，R₂的价值大于R₄是合理的，因此推送R₂时受影响的第四个用户端U₄、第五个用户端U₅、第六个用户端U₆的体验感分别增加33％、33％和100％，体验感总和为166％；而推送R₄时，其受影响的第二个用户端U₂、第三个用户端U₃、第四个用户端U₄和第五个用户端U₅的体验感分别增加25％、25％、33％和33％，体验感总和为116％。可见推送R₂比推送R₄更能增加用户端的整体体验感。基于前述，增加了用户权重的消息价值比仅考虑用户端总数的消息价值更具有实用性和可信度。Taking the first message R ₁ in Table 1 as an example,

In this way, the second message R ₂ , the third message R ₃ , the fourth message R ₄ , the fifth message R ₅ , the sixth message R ₆ and the seventh message R ₇ are calculated respectively, That is to say, the message values of the second message R ₂ , the third message R ₃ , the fourth message R ₄ , the fifth message R ₅ , the sixth message R ₆ and the seventh message R ₇ are respectively: 5.00, 5.33, 4.67, 1.50, 1.00, 1.00. At this point, the message values of messages with the same total number of clients are differentiated. Arrange the message values of the aforementioned seven messages in reverse order to obtain the value sequence: R ₃ , R ₂ , R ₄ , R ₅ , R ₁ , R ₆ , R ₇ . Take R ₂ and R ₄ as an example to verify the result of the value sequence. Obviously, it is reasonable for the value of R ₂ to be greater than R _4. Therefore, when R ₂ is pushed, the fourth user terminal U ₄ and the fifth user terminal affected The experience of U ₅ and the sixth user terminal U ₆ increased by 33%, 33% and 100% respectively, and the total experience was 166%. When R ₄ was pushed, the affected second user terminal U ₂ , the sixth The sense of experience of the three user terminals U ₃ , the fourth user terminal U ₄ and the fifth user terminal U ₅ increases by 25%, 25%, 33% and 33% respectively, and the sum of the experience sense is 116%. It can be seen that pushing _R2 can increase the overall experience of the user terminal more than pushing _R4 . Based on the foregoing, the message value with added user weight is more practical and credible than the message value that only considers the total number of user terminals.

Furthermore, considering the limitations of the message push system, there may be cases of message push failures, so the total number of failed messages corresponding to each client should be considered when determining the user weight.

User weight after taking into account the total number of failed messages

若发送给某个用户端的失败消息总数为0，那么该用户端的用户权重/>

若发送给某个用户端的失败消息总数为0，那么该用户端的用户权重/>

因此，发送给用户端的失败消息总数越大，该用户端的用户权重越大，与此同时该用户端所对应的消息价值随之增大。Then, the message value

If the total number of failure messages sent to a client is 0, then the user weight of the client/>

If the total number of failure messages sent to a client is 0, then the user weight of the client/>

Therefore, the greater the total number of failed messages sent to the client, the greater the user weight of the client, and at the same time the value of the message corresponding to the client increases accordingly.

Taking Table 1 as an example, if the first message R ₁ , the second message R ₂ , the third message R ₃ , the fourth message R ₄ , the fifth message R ₅ , The push times of the sixth message R ₆ and the seventh message R ₇ are: 3min (minutes), 2min, 4min, 5min, 2min, 3min, 1min, and assuming that there is no push failure message, then when pushing the total resources When the time is 10 minutes, combined with the message value of each message, the target push sequence can be determined as R ₂ , R ₃ , R ₅ , and R ₇ through a dynamic programming algorithm.

The message push method provided in this disclosure comprehensively considers the value of the message itself, the weight of the user, the time-consuming history of pushing each message, and the total push resources of the system, and provides a high-experience push for the user within a limited resource range. The sequence ensures the balance between user experience and cost.

Fig. 4 is a block diagram of an apparatus for pushing messages according to an exemplary embodiment of the present disclosure. As shown in FIG. 4 , the present disclosure provides a message push device 1000, which may include: a message value calculation module 1002, which is used to use the message value calculation formula according to the total number of clients corresponding to each message and the user weight of each client. Obtain the message value of each message; push cost determination module 1004, for determining the push cost of each message based on historical push data, wherein the push cost includes the push time generated by pushing the message; and the target push sequence determination module 1006, for Combining the message value of each message and its push cost, the dynamic programming algorithm is used to determine the target push sequence for each message within the scope of the total push resources, where the target push sequence represents the message of multiple messages pushed within the scope of the total push resources The sequence of messages with the largest sum of values.

Each module of the message pushing device 1000 is set up to implement each step of the message pushing method, and the principles and implementation steps can be referred to above, and will not be repeated here.

The apparatus 1000 may include corresponding modules for executing each or several steps in the above flowchart. Therefore, each step or several steps in the above flowcharts may be performed by corresponding modules, and the apparatus may include one or more of these modules. A module may be one or more hardware modules specifically configured to perform the corresponding steps, or be implemented by a processor configured to perform the corresponding steps, or be stored in a computer-readable medium for implementation by the processor, or be implemented by a some combination to achieve.

The hardware structure can be implemented using a bus architecture. The bus architecture can include any number of interconnecting buses and bridges, depending on the specific application of the hardware and the overall design constraints. The bus 1100 connects together various circuits including one or more processors 1200, memory 1300 and/or hardware modules. The bus 1100 may also connect various other circuits 1400 such as peripherals, voltage regulators, power management circuits, external antennas, and the like.

The bus 1100 may be an Industry Standard Architecture (ISA, Industry Standard Architecture) bus, a Peripheral Component Interconnect (PCI, Peripheral Component) bus, or an Extended Industry Standard Architecture (EISA, Extended Industry Standard Component) bus, etc. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one connection line is used in this figure, but it does not mean that there is only one bus or one type of bus.

The message push device provided by this disclosure comprehensively considers the value of the message itself, the weight of the user, the time-consuming history of pushing each message, and the total push resources of the system, and provides a high-experience push for the user within a limited resource range. The sequence ensures the balance between user experience and cost.

Any process or method descriptions in flowcharts or otherwise described herein may be understood to represent modules, segments or portions of code comprising one or more executable instructions for implementing specific logical functions or steps of the process , and the scope of preferred embodiments of the present disclosure includes additional implementations in which functions may be performed out of the order shown or discussed, including in substantially simultaneous fashion or in reverse order depending on the functions involved, which shall It is understood by those skilled in the art to which the embodiments of the present disclosure belong. The processor executes the various methods and processes described above. For example, method embodiments in the present disclosure may be implemented as a software program tangibly embodied on a machine-readable medium, such as memory. In some implementations, part or all of the software program may be loaded and/or installed via memory and/or a communication interface. One or more steps in the methods described above may be performed when a software program is loaded into memory and executed by a processor. Alternatively, in other implementation manners, the processor may be configured to perform one of the above-mentioned methods in any other suitable manner (for example, by means of firmware).

The logic and/or steps shown in the flowcharts or otherwise described herein can be embodied in any readable storage medium for instruction execution systems, devices or devices (such as computer-based systems, processor-included system or other systems that may fetch and execute instructions from an instruction execution system, device, or device), or be used in conjunction with such an instruction execution system, device, or device.

As far as this specification is concerned, a "readable storage medium" may be any device that can contain, store, communicate, spread or transmit programs for instruction execution systems, devices or devices or use in conjunction with these instruction execution systems, devices or devices. More specific examples (non-exhaustive list) of readable storage media include the following: electrical connection with one or more wires (electronic device), portable computer disk case (magnetic device), random access memory (RAM), Read Only Memory (ROM), Erasable and Editable Read Only Memory (EPROM or Flash Memory), Fiber Optic Devices, and Portable Read Only Memory (CDROM). In addition, the readable storage medium may even be paper or other suitable medium on which the program can be printed, since the program can be scanned, for example, by optical scanning of the paper or other medium, followed by editing, interpretation or other suitable means if necessary. processing to obtain programs electronically and store them in memory.

It should be understood that various parts of the present disclosure may be realized by hardware, software or a combination thereof. In the embodiments described above, various steps or methods may be implemented by software stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented by any one or combination of the following techniques known in the art: Discrete logic circuits, ASICs with suitable combinational logic gates, programmable gate arrays (PGAs), field programmable gate arrays (FPGAs), etc.

Those of ordinary skill in the art can understand that all or part of the steps to realize the above-mentioned implementation method can be completed by instructing related hardware through a program, and the program can be stored in a readable storage medium. When the program is executed, it includes One or a combination of steps of a method embodiment.

In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing module, each unit may exist separately physically, or two or more units may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software function modules. If the integrated modules are realized in the form of software function modules and sold or used as independent products, they can also be stored in a readable storage medium. The storage medium may be a read-only memory, a magnetic disk or an optical disk, and the like.

It should be understood by those skilled in the art that the above-mentioned embodiments are only for clearly illustrating the present disclosure, rather than limiting the scope of the present disclosure. For those skilled in the art, other changes or modifications can be made on the basis of the above disclosure, and these changes or modifications are still within the scope of the present disclosure.

Claims (10)

1. A method for pushing a message, comprising:

obtaining the message value of each message by using a message value calculation formula according to the total number of the user terminals corresponding to each message and the user weight of each user terminal;

determining a push cost for each of the messages based on historical push data, wherein the push cost comprises push time consumption generated by pushing the messages; and

and determining a target push sequence for each message in the range of a push total resource by utilizing a dynamic programming algorithm in combination with the message value of each message and the push cost thereof, wherein the target push sequence represents a message sequence with the maximum sum of the message values of a plurality of messages pushed in the range of the push total resource.

2. The method for pushing a message according to claim 1, wherein the message value calculation formula is:

wherein,,

message value representing the i-th message, +.>

Representing the total number of clients corresponding to the ith message, w _j The user weight of the jth user terminal is represented, i represents the sequence number of the message, j represents the sequence number of the user terminal, and the value of j is +.>

3. The method for pushing messages according to claim 1 or 2, wherein before the message value of each message is obtained by using a message value calculation formula according to the total number of clients corresponding to each message and the user weight of each client, the method comprises:

responding to the information that the historical push data has push failure to the user side, and determining the total number of subscription information of each user side and the total number of failure information that the push failure to the user side; and

substituting the total number of subscription messages and the total number of failure messages into a user weight formula, and calculating the user weight of each user side by the user weight formula, wherein the user weight is used for representing the requirement degree of each user side for each message.

4. A method of pushing a message according to claim 3, wherein the user weight formula is:

wherein T is _L Representing the total number of failure messages, T _S Representing the total number of subscription messages.

5. The method for pushing messages according to claim 1 or 2, wherein before the message value of each message is obtained by using a message value calculation formula according to the total number of clients corresponding to each message and the user weight of each client, the method comprises:

determining the total number of subscription messages of each user side in response to the fact that the message of the push failure to the user side does not exist in the historical push data; and

and taking the reciprocal of the total number of the subscription messages of the user side as the user weight of the user side, wherein the user weight is used for representing the requirement degree of the user side on each message.

6. The method for pushing messages according to claim 1, wherein said determining a pushing cost of each of said messages based on historical pushing data comprises:

extracting a plurality of pushing duration of each message from the historical pushing data; and

and extracting the push duration with the largest value from the push durations as the push cost of the message.

7. The method for pushing messages according to claim 1, wherein after determining a target pushing sequence for each of said messages within a range of pushing total resources using a dynamic programming algorithm, comprising:

and the control message pushing system sequentially pushes each message to each user side according to the target pushing sequence, wherein the target pushing sequence comprises data to be pushed and/or messages which are failed to be pushed to the user side.

8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, when executing the program, to implement the method of pushing a message as claimed in any one of claims 1 to 7.

9. A readable storage medium, characterized in that it stores a computer program adapted to be loaded by a processor for performing the pushing method of a message according to any of claims 1 to 7.

10. A computer program product comprising computer program/instructions which, when executed by a processor, implement the method of pushing a message according to any of claims 1 to 7.

Images