CN107515885B

CN107515885B - Information pushing method and device

Info

Publication number: CN107515885B
Application number: CN201610439986.1A
Authority: CN
Inventors: 戴俊; 杨延超; 张磊; 陈蕾; 郑月明
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2016-06-17
Filing date: 2016-06-17
Publication date: 2021-08-24
Anticipated expiration: 2036-06-17
Also published as: CN107515885A

Abstract

The application discloses a method and a device for pushing information. One embodiment of the method comprises: acquiring information to be pushed and a corresponding pushing strategy sequence; determining at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing strategy sequence; sequentially executing each pushing strategy in the pushing strategy sequence, and pushing the information to be pushed to at least one receiving unit; detecting whether at least one of the following conditions is met: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed; and if so, stopping pushing the information to be pushed. The implementation mode can improve the universality of information pushing.

Description

Information pushing method and device

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for pushing information.

Background

Information push may generally represent a process in which a person or an electronic device actively provides information to a pushed object (e.g., a potential commodity purchaser, an end user, etc.), and the provided information may be referred to as push information. In the existing information push method, information push is often performed through a push strategy for an application scenario. For example, in order taking information pushing, the order taking information is uniformly sent to the order receiving client side in the preset area, so that a driver master can grab orders through the order receiving client side; for another example, in a sales system, for an order of a potential customer, order information of the potential customer is pushed to a salesperson according to the personal ordering rate, and the like. The information pushing method has a single pushing strategy, and the pushing strategy cannot be adjusted according to different application scenes, so that the universality of the information pushing method is not high.

Disclosure of Invention

The present application aims to provide an improved information pushing method and apparatus to solve the technical problems mentioned in the above background section.

In one aspect, the present application provides an information pushing method, where the method includes: acquiring information to be pushed and a corresponding pushing strategy sequence; determining at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing strategy sequence; sequentially executing each pushing strategy in the pushing strategy sequence, and pushing the information to be pushed to at least one receiving unit; detecting whether at least one of the following conditions is met: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed; and if so, stopping pushing the information to be pushed.

In some embodiments, the obtaining information to be pushed and a corresponding pushing policy sequence includes: acquiring a preset push strategy sequence; or acquiring a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

In some embodiments, the obtaining information to be pushed and a corresponding pushing policy sequence includes: receiving a push target item input by a user; and determining the push strategy sequence according to the information to be pushed and the push target item.

In some embodiments, the determining the push policy sequence according to the information to be pushed and the push target item includes: and acquiring a push strategy sequence matched with the information to be pushed and the push target item from a preset push strategy sequence database according to the information to be pushed and the push target item.

In some embodiments, the determining the push policy sequence according to the information to be pushed and the push target item includes: according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: the pushed information, a historical pushing strategy sequence used by the pushed information and historical progress information of the pushing target item; calculating the historical target achievement degree of the push target item under each historical push strategy sequence according to the historical progress information of the push target item; and taking the historical push strategy sequence with the maximum historical achievement degree as the push strategy sequence.

In some embodiments, the determining the push policy sequence according to the information to be pushed and the push target item includes: according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: a historical push policy sequence used by the pushed information; determining a weight coefficient of each pushing strategy in the historical pushing strategy sequence; summing the weighting coefficients of the historical push strategy sequence; and taking the historical push strategy sequence with the maximum summation as the push strategy sequence.

In some embodiments, the push policies in the sequence of push policies comprise at least one of: a concurrent push strategy, a sequencing push strategy and a grouping push strategy.

In some embodiments, the push policies in the sequence of push policies are ordered and executed sequentially.

In some embodiments, the determining at least one receiving unit of information to be pushed according to the information to be pushed and/or the push policy sequence includes: identifying the category of the information to be pushed; and determining at least one receiving unit of the information to be pushed according to the preset corresponding relation between the type of the information to be pushed and the type of the receiving unit.

In some embodiments, the determining at least one receiving unit of information to be pushed according to the information to be pushed and/or the push policy sequence includes: and determining at least one receiving unit of the information to be pushed according to the pushing strategy sequence.

In some embodiments, detecting whether it is satisfied that the information to be pushed is received by at least one of the receiving units includes: when any receiving unit in the at least one receiving unit executes an operation of determining to receive the information to be pushed, judging whether a preset condition is met, wherein the preset condition comprises at least one of the following conditions: after the current time is a preset time point, the information to be pushed is not received by other receiving units, the current time is within a preset time range, and the information to be pushed is not executed by other receiving units to determine the operation of receiving the information to be pushed; and if so, determining that any receiving unit receives the information to be pushed.

In some embodiments, when the stopping of pushing the information to be pushed, the method further includes: and if the information to be pushed is received by at least one receiving unit, distributing the information to be pushed to the receiving unit receiving the information to be pushed.

In some embodiments, when the stopping of pushing the information to be pushed, the method further includes: and if all push strategies in the push strategy sequence are completely executed, distributing the information to be pushed to at least one receiving unit according to a preset distribution rule.

In some embodiments, the push policy sequence includes a preset allocation rule, and the preset allocation rule is used as a last push policy in the push policy sequence.

In a second aspect, the present application provides an information pushing apparatus, including: the acquisition module is configured to acquire information to be pushed and a corresponding pushing strategy sequence; a determining module configured to determine at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing policy sequence; the pushing module is configured to sequentially execute each pushing strategy in the pushing strategy sequence and push the information to be pushed to at least one receiving unit; a detection module configured to detect whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, all pushing strategies in the pushing strategy sequence are executed completely, and if the detection module detects that at least one condition is met, the pushing module stops pushing the information to be pushed.

In some embodiments, the obtaining module comprises: the first acquisition unit is configured to acquire a preset push strategy sequence; or the second acquisition unit is configured to acquire a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

In some embodiments, the obtaining module comprises: a target item receiving unit configured to receive a push target item input by a user; and the pushing strategy sequence determining unit is configured to determine the pushing strategy sequence according to the information to be pushed and the pushing target item.

In some embodiments, the push policy sequence determination unit is further configured to: and acquiring a push strategy sequence matched with the information to be pushed and the push target item from a preset push strategy sequence database according to the information to be pushed and the push target item.

In some embodiments, the push policy sequence determination unit is further configured to: according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: the pushed information, a historical pushing strategy sequence used by the pushed information and historical progress information of the pushing target item; calculating the historical target achievement degree of the push target item under each historical push strategy sequence according to the historical progress information of the push target item; and determining the historical push strategy sequence with the maximum historical achievement degree as the push strategy sequence.

In some embodiments, the push policy sequence determination unit is further configured to: according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: a historical push policy sequence used by the pushed information; determining a weight coefficient of each pushing strategy in the historical pushing strategy sequence; summing the weighting coefficients of the historical push strategy sequence; and taking the historical push strategy sequence with the maximum summation as the push strategy sequence.

In some embodiments, the push policies in the sequence of push policies are ordered and executed sequentially. In some embodiments, the determining module comprises: the identification unit is configured to identify the category of the information to be pushed; the determining unit is configured to determine at least one receiving unit of the information to be pushed according to a preset corresponding relation between the type of the information to be pushed and the type of the receiving unit.

In some embodiments, the determining module comprises: and the push object determining unit is configured to determine at least one receiving unit of the information to be pushed according to the push strategy sequence.

In some embodiments, the detection unit is further configured to: when any receiving unit in the at least one receiving unit executes an operation of determining to receive the information to be pushed, judging whether a preset condition is met, wherein the preset condition comprises at least one of the following conditions: after the current time is a preset time point, the information to be pushed is not received by other receiving units, the current time is within a preset time range, and the information to be pushed is not executed by other receiving units to determine the operation of receiving the information to be pushed; and if so, determining that any receiving unit receives the information to be pushed.

In some embodiments, the apparatus further comprises: the first distribution module is used for distributing the information to be pushed to the receiving unit for receiving the information to be pushed if the information to be pushed is received by at least one receiving unit when the pushing module stops pushing the information to be pushed.

In some embodiments, the apparatus further comprises: and the second distributing module is used for distributing the information to be pushed to at least one receiving unit according to a preset distribution rule if all pushing strategies in the pushing strategy sequence are completely executed when the pushing module stops pushing the information to be pushed.

According to the information pushing method and device, the information to be pushed and the corresponding pushing strategy sequence are obtained, then at least one receiving unit of the information to be pushed is determined according to the information to be pushed and/or the pushing strategy sequence, then all pushing strategies in the pushing strategy sequence are executed in sequence, the information to be pushed is pushed to the at least one receiving unit, and meanwhile whether the following at least one condition is met or not is detected: and the information to be pushed is received by at least one receiving unit, all pushing strategies in the pushing strategy sequence are executed, and when the at least one condition is met, the information to be pushed is stopped to be pushed. Because different push strategies are combined into different push strategy sequences for information push, the information push method and the device are beneficial to being suitable for various application scenes, and the universality of the information push method can be enhanced.

Drawings

Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, with reference to the accompanying drawings in which:

FIG. 1 illustrates an exemplary system architecture to which embodiments of the present application may be applied;

FIG. 2 is a flow diagram of one embodiment of a method of information push according to the present application;

FIG. 2-1 is a schematic diagram of a sequenced push strategy according to an embodiment of a method of information push of the present application;

FIG. 2-2 is a schematic diagram of a concurrent push strategy according to one embodiment of a method of information push of the present application;

2-3 are schematic diagrams of a packet push policy according to one embodiment of a method of information push of the present application;

FIG. 3 is a schematic diagram of an application scenario of an embodiment of a method of information push according to the present application;

FIG. 4 is a flow diagram of yet another embodiment of a method of information push according to the present application;

fig. 5 is a schematic structural diagram of an embodiment of an information pushing apparatus according to the present application;

FIG. 6 is a schematic block diagram of a computer system suitable for use in implementing a server according to embodiments of the present application.

Detailed Description

The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.

It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.

FIG. 1 illustrates an exemplary system architecture 100 to which embodiments of the present application may be applied.

As shown in fig. 1, the system architecture 100 may include

terminal devices

101, 102, a network 103, and a server 104. The network 103 serves as a medium for providing communication links between the

terminal devices

101, 102 and the server 104. Network 103 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The

terminal devices

101, 102 may interact with the server 104 via the network 103 to receive or send messages or the like. The

terminal devices

101 and 102 may have various communication client applications installed thereon, such as an information push application, a shopping application, a browser application, a positioning application, a map application, a financing application, a search application, a social platform application, a mailbox client, an instant messaging tool, and the like.

The

terminal devices

101 and 102 may be various electronic devices supporting information push applications and the like installed thereon, including but not limited to smart phones, smart watches, tablet computers, personal digital assistants, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer III, motion video Experts compression standard Audio Layer 3), MP4 players (Moving Picture Experts Group Audio Layer IV, motion video Experts compression standard Audio Layer 4), laptop portable computers, desktop computers and the like.

The server 104 may be a server that provides various services. For example, the server 104 may be a background server or the like that provides support for information push-type applications or the like of the

terminal apparatuses

101 and 102. The server 104 may perform processing such as storage and generation on the received data, and feed back the processing result to the

terminal apparatuses

101 and 102.

It should be noted that the method for pushing information provided in the embodiment of the present application is generally executed by the server 104, but may also be executed by the

terminal devices

101 and 102 in some cases, and the present application is not limited to this. When the information push method provided by the present application is executed by the

terminal devices

101 and 102, the network 103 and the server 104 may not be needed to provide support. Accordingly, the information pushing apparatus provided in the embodiment of the present application may be generally disposed in the server 104, but may also be disposed in the

terminal devices

101 and 102 in some cases.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring to fig. 2, a flow 200 of one embodiment of a method of information push is shown. The embodiment is mainly exemplified by applying the method to an electronic device with certain computing capability, for example, the electronic device may be the server 104 shown in fig. 1. The information pushing method comprises the following steps:

step 201, obtaining information to be pushed and a corresponding pushing strategy sequence.

In this embodiment, the server applying the information push method may obtain the information to be pushed from the terminal device in a wired connection manner or a wireless connection manner. The wireless connection means includes, but is not limited to, a 3G/4G connection, a WiFi connection, a bluetooth connection, a WiMAX connection, a Zigbee connection, a uwb (ultra wideband) connection, and other wireless connection means now known or developed in the future.

Here, the information to be pushed may be various types of information to be pushed to the information pushing type application running on the terminal device, such as order information, task information, request information, and the like, which may be generated according to related information input by the user. For example, when the information push application is a taxi taking application, the information to be pushed may be taxi taking order information pushed to an order receiving client of a driver master, and the like, where the taxi taking order information may be generated according to geographic location information, time information, and the like input by a taxi taking user. The server can push the information to be pushed to the terminal equipment running the information pushing application, so that a user using the terminal equipment can select whether to receive the information to be pushed. If the driver master receives the order information of taking a car through the order receiving client, the driver master is willing to accept the order of taking a car of the user of taking a car, and the service of taking a car can be provided for the user of taking a car.

The push policy sequence may include at least one push policy. The push policy may be a rule or a manner in which the server pushes information to be pushed to the receiving unit.

In some optional implementations of the present embodiment, the push policy in the push policy sequence may include at least one of: a sequencing pushing strategy, a concurrent pushing strategy and a grouping pushing strategy.

The ordering pushing strategy can be to order the receiving units according to a certain characteristic, and in the pushing of the taxi-taking order information, the receiving units are ordered from near to far according to the distance between the receiving units and the starting place of the taxi-taking user; in the order information pushing of the potential customer, sorting is performed according to the sales success rate of the salesman represented by the order grabbing client from high to low, and the like, and then the information to be pushed is sequentially pushed to the receiving unit at a certain time interval (for example, 15 seconds) according to the sorting result. Referring to the schematic diagram shown in fig. 2-1, the receiving units are sorted first, and the information to be pushed is pushed to the receiving unit arranged at 1 st at 0 second; pushing the information to be pushed to the receiving unit arranged in the 2 nd at the 15 th second; pushing the information to be pushed … … to the receiving unit arranged at the 3 rd position at the 30 th second in fig. 2-1, the pushing time period is set to be 30 seconds, that is, the time window in which each receiving unit can operate on the information to be pushed is 30 seconds.

The concurrent push policy may be to send information to be pushed to all receiving units simultaneously. Referring to the schematic diagram shown in fig. 2-2, all receiving units may be sorted first, or all receiving units may not be sorted, and information to be pushed is pushed to all receiving units at 0 second. In fig. 2-2, the push duration is also set to a value of 60 seconds, that is, the time window in which each receiving unit can operate on the information to be pushed is 60 seconds.

The grouping pushing strategy can be that the receiving units are sorted according to a certain characteristic and then grouped according to a sorting result, if the grouping capacity is 2, two receiving units of 1 st and 2 nd are arranged as a 1 st group, two receiving units of 3 rd and 4 th are arranged as a 2 nd group, and the like; and so on. Specifically, referring to the schematic diagrams shown in fig. 2-3, all receiving units are sorted first, and information to be pushed is pushed to the receiving unit included in the 1 st group at 0 second; pushing … … the information to be pushed to the receiving units included in group 2 at 15 seconds likewise, the time window in which each receiving unit can operate on the above information to be pushed is 60 seconds.

In some implementations, the push policy may further include parameters such as a push duration for the server to push the information to be pushed to each receiving unit or each group of receiving unit sets. For example, if the push policy includes that the push duration is 5 seconds, the server starts to push the information to be pushed to a certain receiving unit from 12 hours, 1 minute and 0 second, finishes pushing the information to be pushed to the receiving unit from 12 hours, 1 minute and 5 seconds, and after the pushing is finished, the receiving unit cannot receive the information to be pushed.

In this embodiment, the push policy sequence may have a certain correspondence with the information to be pushed. It is understood that the corresponding relationship may be user-defined, or may be generated by the server according to an algorithm. The correspondence relationship is pre-stored in the server or a storage device connected to the server after the generation.

In some optional implementations of this embodiment, the push policy sequence pre-stored in the server may be one group or multiple groups. And matching relations exist between the multiple groups of pushing strategy sequences and the information to be pushed. For example, the taxi-taking order information is matched with a push strategy sequence including a distance push strategy; the order information of the potential customers is matched with a push strategy sequence comprising a sales success rate push strategy. It is understood that the plurality of sets of push policy sequences may also be stored in a preset push policy sequence database connected to the server. Therefore, the step 201 may include: acquiring a preset push strategy sequence; or acquiring a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

Step 202, determining at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing strategy sequence.

In this embodiment, the server may determine at least one receiving unit as a push object of the information to be pushed according to the information to be pushed and/or the push policy sequence. Here, the receiving unit may be a terminal device installed with an information push type application that can perform an operation of receiving information to be pushed. For example, the receiving unit may be the order taking client described above. The terminal device as the receiving unit can be distinguished by its own device number, a user name used when connecting to the server, and the like.

In this embodiment, the server may determine, in advance, the information to be pushed and the pushing rules of the receiving units according to the application scenario of the information pushing method, so that after the server acquires the information to be pushed, the server determines, according to the predetermined pushing rules, at least one receiving unit as a pushing object of the acquired information to be pushed. For example, in pushing taxi-taking order information, the pushing rule may be: and pushing the taxi taking order information to a receiving unit of the preset distance range of the departure place contained in the taxi taking order information, wherein the receiving unit of the preset distance range of the departure place contained in the taxi taking order information is determined as a receiving unit of the information to be pushed. The server may also determine a push policy sequence and a push rule of the receiving unit in advance according to an application scenario of the information push method, so that the server determines at least one receiving unit as a push object of the obtained information to be pushed according to the predetermined push rule after obtaining the information to be pushed and the corresponding push policy sequence. For example, in the order information pushing of the potential customer, if the pushing policy in the pushing policy sequence is a salesman with a high sales success rate, the pushing rule may be: and pushing order information of potential customers to the salesperson with the sales success rate ranking 5 in all salespersons. It can be understood that, in this embodiment, at least one receiving unit may also be determined as a push object of the acquired information to be pushed jointly according to the information to be pushed and the push policy sequence.

In some optional implementation manners of this embodiment, the server may further divide the information to be pushed and the receiving unit into categories according to similar rules, and establish a corresponding relationship between the categories. When the server acquires the information to be pushed, the server may first identify a category of the information to be pushed, and determine at least one receiving unit of the category corresponding to the category of the information to be pushed as a receiving unit of the information to be pushed. For example, when the information pushing method of this embodiment is applied to pushing sales order information, the order information of a potential customer may be used as information to be pushed, an order grabbing client operating on a terminal device and allowing a salesperson to perform order grabbing operation is used as a receiving unit, the order information of the potential customer may be classified according to a geographical area where the potential customer is located, such as a chinese area and an american area, and the terminal device operating the order grabbing client may be classified according to a geographical location coordinate (obtained by GPS positioning, for example), and a corresponding relationship between the geographical area and the geographical location coordinate of the terminal device is established, such as an east longitude x-east longitude x, a north latitude-north latitude x, and a chinese area corresponding to an east longitude x-east longitude x when the geographical area where the potential customer is located is a chinese area, and the order grabbing client side of the north latitude x degree-north latitude x degree is determined as a receiving unit of information to be pushed.

Step 203, sequentially executing each push policy in the push policy sequence, and pushing the information to be pushed to at least one receiving unit.

In this embodiment, the server may sequentially execute each push policy in the push policy sequence to push the information to be pushed to at least one receiving unit.

In some optional implementations of the embodiment, when there are a plurality of push policies in the push policy sequence, the push policy sequence may further include an arrangement order of the push policies. The push strategy sequence (including each push strategy and its arrangement sequence) may be determined manually, or may be obtained automatically by a server in combination with a machine learning method, which is not limited in this application. When the server executes the push strategy of the push strategy sequence, the push strategy is also executed in sequence.

In some optional implementations of the embodiment, the push policy sequence has a push lifecycle, and the push policy parameters of the push policy include at least one of: push duration, interval duration, packet amount.

The push lifecycle may be understood as the longest push time for a piece of information to be pushed. For example, the push policy sequence includes 3 push policies, which are a push policy a, a push policy B, and a push policy C. Before each push strategy pushes information to be pushed to the terminal equipment, a period can be set. For example, when the taxi-taking order information is pushed, the period of each pushing strategy is set to be 20 minutes, and then the pushing life cycle of the pushing strategy sequence is the sum of the periods of the 3 pushing strategies, and is 60 minutes.

Each push policy comprises at least one push policy parameter, which may be, for example, a push duration, an interval duration, and a packet amount. The pushing duration can be 10 seconds for pushing to each client; the interval duration may be 5 seconds between the time of starting to push to the 1 st client and the time of starting to push to the 2 nd client; the amount of packets may be such that 2 clients are pushed at a time.

Step 204, detecting whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed.

In this embodiment, during the process of sequentially executing each push policy in the push policy sequence to push the information to be pushed, the server may simultaneously detect whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed.

It can be understood that, if the information to be pushed is received by at least one of the receiving units, it indicates that the information to be pushed is pushed to at least one of the receiving units; if all push policies in the push policy sequence are executed, the information to be pushed may be received by at least one of the receiving units, or may not be received by any of the receiving units.

In some optional implementation manners of this embodiment, when the server pushes the information to be pushed to the receiving unit according to a certain pushing policy, if a certain receiving unit performs an operation of determining to receive the information to be pushed (for example, a request for receiving the information to be pushed is sent to the server), the server may determine whether a preset condition determined according to the pushing policy is satisfied. If yes, the receiving unit is determined to be capable of receiving the information to be pushed, the server can distribute the information to be pushed to the receiving unit, otherwise, the server does not distribute the information to be pushed to the receiving unit.

Wherein, the preset condition may include but is not limited to at least one of the following: the current time is after a preset time point, the information to be pushed is not received by other receiving units, the current time is within a preset time range, the information to be pushed is not executed by other receiving units to determine the operation of receiving the information to be pushed, and the like.

Specifically, in the preset condition "the current time is after the preset time point", the preset time point may be a time point when the server pushes the information to be pushed to the receiving unit, and the condition may ensure that the receiving unit is qualified to receive the information to be pushed.

The preset condition "the information to be pushed is not received by other receiving units" may ensure that the information to be pushed is not allocated to other receiving units.

The preset condition "the current time is within a preset time range", where the preset time range may be a push time range from the server to the receiving unit pushing the information to be pushed in the push time example of the above-mentioned push policy, for example, 12 hours, 1 minute, 0 second to 12 hours, 1 minute, 5 seconds, and the condition may ensure that the time when the receiving unit performs the operation of determining to receive the information to be pushed is within the time range when the server pushes the information to be pushed to the receiving unit.

The preset condition that the information to be pushed is not subjected to the operation of determining to receive the information to be pushed by other receiving units can ensure that the receiving unit repeatedly performs the operation of determining to receive the information to be pushed in a time interval when other receiving units perform the operation of determining to receive the information to be pushed but the server does not distribute the information to be pushed to other receiving units. For example, the server may identify whether the operation of determining reception is performed by any receiving unit by using a locking parameter, the locking parameter may have an initial value (e.g., 0), when the operation of determining reception is performed by any receiving unit, the value of the locking parameter is modified to a preset value (e.g., 1), and the server may determine whether the operation of determining reception is performed by any receiving unit by determining whether the value of the locking parameter is the initial value.

Step 205, if yes, stopping pushing the information to be pushed.

In this embodiment, if at least one of the above conditions is satisfied, the server may stop pushing the information to be pushed to the receiving unit.

Here, if "the information to be pushed is received by at least one of the receiving units" in the above condition is satisfied, the server may allocate the information to be pushed to the receiving unit that receives the information to be pushed, and stop executing the pushing policy in the pushing policy sequence, and no longer push the information to be pushed to other receiving units.

And if the condition that all the push strategies in the push strategy sequence are executed is met, the server stops pushing the information to be pushed to the receiving unit.

In some optional implementations of this embodiment, the information to be pushed must be received by at least one of the receiving units. For example, the information to be pushed is the financial account opening order information of the customer. At this time, the server determines whether the information to be pushed is received by at least one of the receiving units, and if not, the server may further allocate the information to be pushed to at least one of the receiving units according to a preset allocation rule. Whether the information to be pushed needs to be received by at least one receiving unit or not can be determined in advance by the server according to input operation of a user, or can be obtained by the server according to matching of the information to be pushed and a preset information set according to keywords.

Here, the allocation rule may be an allocation method in which the server allocates the information to be pushed to the receiving unit, for example, allocating the taxi-taking order information to the order-receiving client closest to the departure point of the taxi-taking user; distributing the order information of the potential customers to the order grabbing client with the highest selling success rate, and the like. When the server executes the preset distribution rule, the distributed receiving unit can automatically determine to receive the information to be pushed.

In some optional implementations of this embodiment, the allocation rule may be pre-stored in the server. And when the push strategies in the preset push strategy sequence are completely executed and the server judges that the information to be pushed needs to be received by at least one receiving unit, executing a preset distribution rule.

In other optional implementation manners of this embodiment, the distribution rule may also be a last push policy in the push policy sequence, and after each push policy in the push policy sequence is sequentially executed, if the information to be pushed is not received by the at least one receiving unit before the distribution rule is executed, the distribution rule is automatically executed in the last push policy.

It can be understood that the information to be pushed may be one or more pieces of information, and when the information to be pushed is multiple pieces of information, the server may respectively execute the information pushing method of this embodiment on each piece of information to be pushed. The information push method of the plurality of pieces of information to be pushed can be executed in parallel.

Referring to fig. 3, fig. 3 shows an application scenario 300 of the present embodiment. The application scenario 300 may be applicable to a generation process that pushes order information for potential customers to a salesperson. In the application scenario, as shown in fig. 3, the

terminal devices

3001, 3002, and 3003 may run an information push application, and the background server 3004 may provide support for the information push application. The information push application running on the terminal device 3001 may be the same as or different from the information push applications running on the

terminal devices

3002 and 3003. For example, when the number of the terminal device is the same as the number of the terminal device, or the user name of the terminal device when the terminal device is connected to the background server, the background server 3004 may distinguish whether the information push client that sends the request or the information push client that the salesperson snatches the order runs on the terminal device.

As shown in fig. 3, in this application scenario 300, first, through step 301, a user inputs order information of a potential customer through a terminal device 3001, and a backend server 3004 can remotely obtain the order information from the terminal device 3001 as information to be pushed. Next, in step 302, the backend server 3004 may determine a receiving unit according to the order information, for example, the order information includes regional information beijing, and the backend server 3004 may push information of performing a ticket snatching by a salesman in the beijing region to the client as the receiving unit. Then, through step 303, the back-end server 3004 executes a credit priority pushing policy to push the order information to the determined receiving unit, where the credit in the credit priority pushing policy may be determined according to a rule such as that the higher the sales volume is, the higher the credit is, and the back-end server 3004 may preferentially push the order information to the information pushing client with the higher credit for the salesman. When there is no human robbery of the order by the push policy of step 303, the background server 3004 may execute a parallel push policy by step 304, which may be to push the order information to all determined receiving units simultaneously. When the background server 3004 executes the parallel push policy, the salesman a initiates a purchase order request (determines to receive the order information) through the information push client of the purchase order running on the terminal device 3002. The background server 3004 may detect, through step 305, whether the order grabbing information push client running on the terminal device 3002 meets a preset condition, where the preset condition includes: the information push client without the order grabbing running on other terminal equipment sends out an order grabbing request (which can be determined by the fact that the order information is not locked, for example) and the like. If the preset condition is met, in step 306, the background server 3004 may lock the order information, wherein locking the order information may be implemented by modifying a preset parameter value, or the like. At this time, if the salesperson b sends out the order grabbing request through the terminal device 3003, the backend server 3004 may execute step 307 similar to step 305, and detect whether the information push client of the order grabbing running on the terminal device 3003 meets the preset condition. At this time, since the order information is locked, the backend server 3004 may determine that the information push client for the order grabbing running on the terminal device 3003 does not meet the preset condition. Then, the backend server 3004 may determine that the salesman a receives the order information through the order grabbing information push client running on the terminal 3002, so as to distribute the order information to the salesman a performing order grabbing through the order grabbing information push client running on the terminal 3002, and stop continuing to perform information push.

In the information push method of this embodiment, the information to be pushed is pushed to the at least one receiving unit by sequentially executing each push policy in the preset push policy sequence until the information to be pushed is pushed out, or the push policies are executed completely, different push policy sequences can be combined by different push policies to carry out information push, which is beneficial to adapting to various application scenarios and enhancing the universality of the information push method.

With further reference to fig. 4, a flow 400 of yet another embodiment of a method of information push of the present application is shown. The process 400 includes the following steps:

step 401, obtaining information to be pushed.

In this embodiment, the server may acquire the information to be pushed from a terminal device connected to the server remotely. Here, the information to be pushed may be various types of information to be pushed to the information pushing type application running on the terminal device, such as order information, task information, request information, and the like, which may be generated according to related information input by the user.

Step 402, receiving a push target item input by a user.

In this embodiment, the server may acquire a push target item input by the user from a terminal device used by the user. The target item may be a requirement item for information push by a user, for example, the target item may be push efficiency, order-forming rate (for example, sales success rate of an order of a potential customer), and the like, and the target item may have requirement description information, where the requirement description information may describe an effect achieved by the target item, for example, the target item has the highest push efficiency, and the order-forming rate is more than 90%.

And 403, determining a preset pushing strategy sequence according to the information to be pushed and the pushing target item.

In this embodiment, the server may further determine a push policy sequence according to the information to be pushed and the push target item, where the push policy sequence may be used as a server push policy sequence to push information. For example, if the push target item is push efficiency, and the requirement description information of the push target item is the highest push efficiency, the push policy sequence may include only one push policy, for example, where the push policy is to push information to be pushed to all receiving units simultaneously, and the push duration is 5 seconds.

In some optional implementations of this embodiment, the server may determine the push policy sequence by: and acquiring a push strategy sequence matched with the information to be pushed and the push target item from a preset push strategy sequence database according to the information to be pushed and the push target item.

A plurality of pushing strategy sequences can be stored in the preset pushing strategy sequence database in advance, and different pushing strategy sequences can be adapted to different information to be pushed and pushing target items. For example, the push strategy with the highest sales success rate is not suitable for pushing order information, and is not adapted to be closest to the push target item.

In some optional implementations of this embodiment, the server may determine a push policy sequence according to the information to be pushed and the push target item by the following sub-steps:

and a substep 4031 for obtaining a plurality of history information pushing records according to the information to be pushed.

And a substep 4032, calculating the historical achievement degree of the pushing target item under each historical pushing strategy sequence according to the historical progress information of the pushing target item.

And a substep 4033, determining the historical push strategy sequence with the highest historical achievement degree as a push strategy sequence.

In practice, the server may obtain a plurality of historical information push records of the same category of information as the information to be pushed, for example, the order information of taking a car within 5 kilometers, and the like. Each historical information push record may include, but is not limited to, pushed information, historical push policy sequences used by the pushed information, historical progress information of the push target item, and so forth. Here, the historical progress information of the push target item may be a description of a progress situation obtained after information is pushed to the receiving unit, for example, taxi taking order information is pushed to an order taking client of a driver master, taxi taking order information is received by the driver master through the order taking client for a long time, further for example, after order information of a potential customer is pushed to an order grabbing client of a salesperson, which order grabbing client determines that the order information is received, whether the order is finally completed (for example, the salesperson and the potential customer successfully make an order and the like), and the like.

The historical target achievement of the push target item may be a quantitative representation of the historical target achievement of the push target item. The server can calculate the historical achievement degree of the target according to the historical progress information of the pushing target item in each historical information pushing record. For example, assuming that the push target item is an order success rate, under a sequence of push strategies, order information of 100 potential customers is pushed, and 90 pieces of order information are received by the salesperson through the order grabbing client and then successfully contract with the potential customers, the order success rate may be 90/100-90%. Similarly, the server may calculate the order success rate separately for each push strategy sequence. When the user selects the push target item as the order success rate and the requirement description information of the push target item is the highest order success rate, the server can select the push strategy sequence with the highest order success rate as the push strategy sequence.

In some implementations, the historical information push record may also include, but is not limited to, at least one of: the receiving units of the pushed information, the number of the receiving units of the pushed information, the execution time parameter of each pushing policy in the historical pushing policy sequence (for example, the pushing duration, the interval duration for pushing information to two adjacent receiving units, and the like), the number of the receiving units for pushing each pushing policy in the historical pushing policy sequence once, and the like, which are not described herein again.

In some optional implementations of this embodiment, the server may further determine a push policy sequence according to the information to be pushed and the push target item by the following sub-steps:

Sub-step 4032' determines a weight coefficient for each push policy in the historical sequence of push policies.

Sub-step 4033' sums the weighting coefficients of the historical push strategy sequence.

And a substep 4034', which takes the history push strategy sequence with the largest summation as the push strategy sequence.

The server can acquire a plurality of historical information pushing records according to the information to be pushed by a machine learning method. Wherein, history information propelling movement record includes: pushed information, historical push policy sequences used by the pushed information, and so on. The information pushed in the history information pushing record can be the same kind of information as the information to be pushed, for example, all the information is order information for taking a car; the server can determine the weight coefficients of the arrangement sequence of each pushing strategy in the pushing strategy sequence through a machine learning method according to the historical pushing strategy sequence, then sequence each pushing strategy according to the weight coefficients, add the weight coefficients of the pushing strategy sequences in each sequence, and take the obtained pushing strategy sequence with the largest sum as a preset pushing strategy sequence.

Still taking the pushing of the taxi taking order information as an example, the server obtains 10 historical taxi taking order information pushing records, and the 10 pushed taxi taking order information use different historical pushing strategy sequences. Through statistics, 8 pieces of pushed taxi taking order information use a nearest pushing strategy, 5 pieces of pushed taxi taking order information use a pushing strategy with the highest score of a driver master, 3 pieces of pushed taxi taking order information use a pushing strategy with the lowest price, and the use conditions of other pushing strategies are smaller. It can be understood that the weight magnitudes of the above three push strategies are ordered as: the push strategy closest to the driver master is higher than the push strategy with the highest score of the driver master, the push strategy with the lowest price is higher than other push strategies. When a push strategy sequence comprises a nearest push strategy, a push strategy with the highest driver master score and a push strategy with the lowest price, the sum of the weight coefficients of the push strategy sequence is the highest. The server may determine, after the calculation, that the push policy sequence is the selected push policy sequence.

Step 404, determining at least one receiving unit of the information to be pushed according to the pushing strategy sequence.

In this embodiment, the server may further determine at least one receiving unit of the information to be pushed according to the above-mentioned push policy sequence. It can be understood that, the push policy is different, and the push objects (receiving units) in the push process may also be different. For example, the push strategy is to push the information to be pushed in parallel to a preset number (for example, 50) of order grabbing clients with the highest order success rate, and the push strategy is to sequentially push the information to be pushed to a preset number (for example, 50) of order grabbing clients with the highest customer satisfaction score. In some cases, the push policy is the same, and the receiving units may be different. For example, the push policy is to push the taxi taking order information to 100 order taking clients closest to the departure point included in the taxi taking order information, and the departure point included in each taxi taking order information is different, and the 100 order taking clients closest to the departure point are also different. Thus, the server may determine the corresponding receiving unit according to each push policy in the above-described push policy sequence.

Step 405, sequentially executing each push policy in the push policy sequence, and pushing the information to be pushed to at least one receiving unit.

In this embodiment, the server may sequentially execute the respective push policies in the push policy sequence determined through step 403 to push the information to be pushed to at least one receiving unit.

Step 406, detecting whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed.

It can be understood that, if the information to be pushed is received by at least one of the receiving units, it indicates that the information to be pushed is pushed to at least one of the receiving units; if all the push policies in the push policy sequence are executed, the information to be pushed may be received by at least one of the receiving units, or may not be received by any of the receiving units.

Step 407, if yes, stopping pushing the information to be pushed.

Here, if "the information to be pushed is received by at least one of the receiving units" in the above condition is satisfied, the server may allocate the information to be pushed to the receiving unit that receives the information to be pushed, and stop executing the pushing policy in the pushing policy sequence, and no longer push the information to be pushed to other receiving units. And if the condition that all the push strategies in the push strategy sequence are executed is met, the server stops pushing the information to be pushed to the receiving unit. At this time, the server may further determine whether the information to be pushed needs to be received by at least one of the receiving units, if so, the server may determine whether the information to be pushed is received by at least one of the receiving units, and if not, the server may further allocate the information to be pushed to at least one of the receiving units according to a preset allocation rule.

In this embodiment, step 401, step 405, step 406, and step 407 in the above implementation flow are substantially the same as step 201, step 203, step 204, and step 205 in the foregoing embodiment, and are not described again here.

As can be seen from fig. 4, unlike the embodiment corresponding to fig. 2, the flow 400 of the information pushing method in this embodiment replaces step 202 with

steps

402, 403, and 404. Through

steps

402, 403, and 404, the present embodiment determines the push policy sequence according to the push target item to be achieved by receiving the push target item input by the user, and is more specific, and can implement personalization in the general information push method.

With further reference to fig. 5, as an implementation of the method shown in the above-mentioned figures, the present application provides an embodiment of an information pushing apparatus, where the embodiment of the apparatus corresponds to the embodiment of the method shown in fig. 2, and the apparatus may be specifically applied in a server.

As shown in fig. 5, the information pushing apparatus 500 of the present embodiment includes: the device comprises an acquisition module 501, a determination module 502, a push module 503 and a detection module 504. The obtaining module 501 may be configured to obtain information to be pushed and a corresponding pushing policy sequence; the determining module 502 may be configured to determine at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing policy sequence acquired by the acquiring module 501; the pushing module 503 may be configured to sequentially execute each pushing policy in the preset pushing policy sequence acquired by the acquiring module 501, and push the information to be pushed to the at least one receiving unit determined by the determining module 502; the detection module 504 may be configured to detect whether at least one of the following conditions is satisfied: the information to be pushed acquired by the acquiring module 501 is received by the at least one receiving unit determined by the determining module 502, and all pushing policies in the pushing policy sequence acquired by the acquiring module 501 are executed, wherein if the detecting module 504 detects that at least one of the above conditions is satisfied, the pushing module 503 stops pushing the information to be pushed.

In this embodiment, the obtaining module 501 may first obtain the information to be pushed and the corresponding pushing policy sequence remotely. Here, the information to be pushed may be various types of information to be pushed to the information pushing type application running on the terminal device, such as order information, task information, request information, and the like, which may be generated according to related information input by the user. The push policy sequence may include at least one push policy. The push policy may be a rule or a manner in which the server pushes information to be pushed to the receiving unit.

In some optional implementations of the present embodiment, the push policy in the push policy sequence may include at least one of: a concurrent push strategy, a sequencing push strategy and a grouping push strategy.

The concurrent push policy may be to send information to be pushed to all receiving units at the same time. The sorting and pushing strategy may be to sort the receiving units according to a certain characteristic, and in the pushing of the taxi-taking order information, the sorting is performed from near to far according to the distance between the receiving unit and the departure place of the taxi-taking user. The grouping pushing strategy can be that the receiving units are sorted according to a certain characteristic and then grouped according to a sorting result, if the grouping capacity is 2, two receiving units of 1 st and 2 nd are arranged as a 1 st group, two receiving units of 3 rd and 4 th are arranged as a 2 nd group, and the like; and so on.

In some optional implementations of this embodiment, the information pushing apparatus 500 may be pre-stored with a set pushing policy sequence, or a pushing policy sequence database connected to the information pushing apparatus 500 is pre-stored, where the pushing policy sequence is stored in the database. At this time, the acquisition module 501 may include a first acquisition unit (not shown) or a second acquisition unit (not shown). The first obtaining unit is configured to obtain a preset push strategy sequence. And the second acquisition unit is configured to acquire a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

In this embodiment, the determining module 502 may then determine at least one receiving unit as a pushing object of the information to be pushed according to the information to be pushed and/or the pushing policy sequence. Here, the receiving unit may be a client of an information push type application that can perform an operation of receiving information to be pushed, and may be, for example, the order receiving client described above or the like, where the client as the receiving unit may be distinguished by a device number of the terminal device, a user name used when the terminal device is connected to the server, or the like.

In some optional implementations of this embodiment, the information pushing apparatus 500 may further store, in advance, correspondence between the categories after the information to be pushed and the receiving units are classified according to similar rules, respectively. At this time, the determination module 502 may include a recognition unit (not shown) and a determination unit (not shown). Wherein the identifying unit (not shown) may be configured to identify a category of the information to be pushed, and the determining unit (not shown) may determine at least one receiving unit of the category corresponding to the category of the information to be pushed as the receiving unit of the information to be pushed.

In this embodiment, the information pushing apparatus 500 may obtain a pushing policy sequence, where the pushing policy sequence may include at least one pushing policy, and the pushing module 503 may sequentially execute each pushing policy in the pushing policy sequence to push the information to be pushed to at least one receiving unit. The push policy may be a rule or a manner for the information pushing apparatus 500 to push the information to be pushed to the receiving unit. When there are multiple push strategies in the push strategy sequence, the push strategy sequence may further include an arrangement order of the push strategies. In this embodiment, in the process that the pushing module 503 sequentially executes each pushing policy in the pushing policy sequence to push the information to be pushed, the detecting module 504 may simultaneously detect whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed. It can be understood that, if the information to be pushed is received by at least one of the receiving units, it indicates that the information to be pushed is pushed to at least one of the receiving units; if all the push policies in the push policy sequence are executed, the information to be pushed may be received by at least one of the receiving units, or may not be received by any of the receiving units.

The push lifecycle can be understood as the longest push time of a piece of information to be pushed. The pushing duration may be 10 seconds to each client; the interval duration may be 5 seconds between the time of starting to push to the 1 st client and the time of starting to push to the 2 nd client; the amount of packets may be such that 2 clients are pushed at a time.

In some optional implementations of the embodiment, if the detection module 504 detects that a certain receiving unit performs an operation of determining to receive information to be pushed (for example, a request for receiving the information to be pushed is sent to the information pushing apparatus 500), it may be determined whether a preset condition determined according to the pushing policy is satisfied, and if so, it is determined that the receiving unit may receive the information to be pushed.

In some optional implementations of this embodiment, when "the information to be pushed is received by at least one of the receiving units" in the above condition is satisfied, the apparatus may further include a first allocating module (not shown) configured to allocate the information to be pushed to the receiving unit that receives the information to be pushed when the pushing module 503 stops executing the pushing policy in the pushing policy sequence and no longer pushes the information to be pushed to other receiving units.

In some optional implementation manners of this embodiment, when "all the push policies in the push policy sequence are executed" in the above condition is satisfied, the apparatus may further include a second allocating module (not shown) configured to allocate the information to be pushed to at least one receiving unit according to a preset allocation rule when the pushing module 503 stops executing the push policies in the push policy sequence and no longer pushes the information to be pushed to other receiving units.

In some optional implementation manners of this embodiment, the push policy sequence includes the preset allocation rule, and the preset allocation rule is used as a last push policy in the push policy sequence.

In some optional implementations of this embodiment, the obtaining module 501 may include a target item receiving unit (not shown) and a push policy sequence determining unit (not shown). Wherein the receiving unit may be configured to receive a push target item input by a user. The push policy sequence determining unit may be configured to determine the push policy sequence according to the information to be pushed and the push target item.

In some optional implementations of this embodiment, the determining module 502 may include a push object determining unit (not shown) configured to determine the at least one receiving unit of the information to be pushed according to the push policy sequence determined by the push policy sequence determining unit.

In some optional implementation manners of this embodiment, the push policy sequence determining unit may further obtain, according to the information to be pushed and the push target item received by the receiving unit, a push policy sequence matched with the information to be pushed and the push target item from a preset push policy sequence database connected to the information pushing apparatus 500. A plurality of pushing strategy sequences are stored in the preset pushing strategy sequence database, and matching relations exist among different pushing strategy sequences, different information to be pushed and different pushing target items.

In some optional implementation manners of this embodiment, the push policy sequence determining unit may further obtain multiple pieces of history information push records according to the information to be pushed, then calculate a history goal achievement degree of the push target item under each history push policy sequence according to the history progress information of the push target item, and then determine the history push policy sequence with the largest history goal achievement degree as the push policy sequence. The history information push record may include, but is not limited to, pushed information, a history push policy sequence used by the pushed information, and history progress information of the push target item.

In some optional implementation manners of this embodiment, the push policy sequence determining unit may further obtain a plurality of historical information push records according to the information to be pushed, then determine weight coefficients of each push policy in the historical push policy sequence, then sum the weight coefficients of the historical push policy sequence, and finally take the historical push policy sequence with the largest sum as the push policy sequence. Wherein the historical information push record may include, but is not limited to, a historical push policy sequence of pushed information usage.

It should be noted that modules or units described in the information pushing apparatus 500 correspond to the respective steps in the method described with reference to fig. 2. Therefore, the operations and features described above for the method are also applicable to the apparatus 500 for pushing information and the modules or units included therein, and are not described herein again.

Those skilled in the art will appreciate that the information pushing apparatus 500 described above also includes some other well-known structures, such as a processor, a memory, etc., which are not shown in fig. 5 in order to unnecessarily obscure the embodiments of the present disclosure.

Referring now to FIG. 6, shown is a block diagram of a computer system 600 suitable for use in implementing a server according to embodiments of the present application.

As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.

In particular, according to embodiments of the application, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.

The modules and units related in the embodiments of the present application may be implemented by software, or may be implemented by hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises an acquisition module, a determination module, a pushing module, a detection module and a pushing result execution module. The names of these modules do not in some cases form a limitation on the module itself, for example, the obtaining module may also be described as a "module configured to obtain information to be pushed and a corresponding push policy sequence".

As another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus in the above-described embodiments; or it may be a separate computer-readable storage medium not incorporated in the terminal. The computer readable storage medium stores one or more programs that, when executed by one or more processors, cause the apparatus to: acquiring information to be pushed and a corresponding pushing strategy sequence; determining at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing strategy sequence; sequentially executing each pushing strategy in the pushing strategy sequence, and pushing the information to be pushed to at least one receiving unit; detecting whether at least one of the following conditions is met: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed; and if so, stopping pushing the information to be pushed.

The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims

1. A method of information push, the method comprising:

the method comprises the steps of obtaining information to be pushed and a corresponding pushing strategy sequence, wherein the pushing strategy sequence comprises at least one pushing strategy, and the pushing strategy is a rule or a mode that a server pushes the information to be pushed to a receiving unit;

determining at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing strategy sequence;

sequentially executing each pushing strategy in the pushing strategy sequence, and pushing the information to be pushed to at least one receiving unit;

detecting whether at least one of the following conditions is met: the information to be pushed is received by at least one receiving unit, and all pushing strategies in the pushing strategy sequence are completely executed;

and if so, stopping pushing the information to be pushed.

2. The method according to claim 1, wherein the obtaining information to be pushed and a corresponding push policy sequence comprises:

acquiring a preset push strategy sequence; or

And acquiring a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

3. The method according to claim 1, wherein the obtaining information to be pushed and a corresponding push policy sequence comprises:

receiving a push target item input by a user;

and determining the push strategy sequence according to the information to be pushed and the push target item.

4. The method according to claim 3, wherein the determining the push policy sequence according to the information to be pushed and the push target item comprises:

and acquiring a push strategy sequence matched with the information to be pushed and the push target item from a preset push strategy sequence database according to the information to be pushed and the push target item.

5. The method according to claim 3, wherein the determining the push policy sequence according to the information to be pushed and the push target item comprises:

according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: the pushed information, a historical pushing strategy sequence used by the pushed information and historical progress information of the pushing target item;

calculating the historical target achievement degree of the push target item under each historical push strategy sequence according to the historical progress information of the push target item;

and taking the historical push strategy sequence with the maximum historical achievement degree as the push strategy sequence.

6. The method according to claim 3, wherein the determining the push policy sequence according to the information to be pushed and the push target item comprises:

according to the information to be pushed, obtaining a plurality of historical information pushing records, wherein the historical information pushing records comprise: a historical push policy sequence used by the pushed information;

determining a weight coefficient of each pushing strategy in the historical pushing strategy sequence;

summing the weighting coefficients of the historical push strategy sequence;

and taking the historical push strategy sequence with the maximum summation as the push strategy sequence.

7. The method of claim 1, wherein the push policy in the sequence of push policies comprises at least one of:

a concurrent push strategy, a sequencing push strategy and a grouping push strategy.

8. The method of claim 7, wherein the push strategies in the sequence of push strategies are ordered and performed sequentially.

9. The method according to claim 1, wherein the determining at least one receiving unit of information to be pushed according to the information to be pushed and/or the push policy sequence comprises:

identifying the category of the information to be pushed;

and determining at least one receiving unit of the information to be pushed according to the preset corresponding relation between the type of the information to be pushed and the type of the receiving unit.

10. The method according to claim 3, wherein the determining at least one receiving unit of information to be pushed according to the information to be pushed and/or the push policy sequence comprises:

and determining at least one receiving unit of the information to be pushed according to the pushing strategy sequence.

11. The method of claim 1, wherein detecting whether the information to be pushed is received by at least one of the receiving units comprises:

when any receiving unit in the at least one receiving unit executes an operation of determining to receive the information to be pushed, judging whether a preset condition is met, wherein the preset condition comprises at least one of the following conditions: after the current time is a preset time point, the information to be pushed is not received by other receiving units, the current time is within a preset time range, and the information to be pushed is not executed by other receiving units to determine the operation of receiving the information to be pushed;

and if so, determining that any receiving unit receives the information to be pushed.

12. The method according to claim 1, wherein when the pushing of the information to be pushed is stopped, the method further comprises:

and if the information to be pushed is received by at least one receiving unit, distributing the information to be pushed to the receiving unit receiving the information to be pushed.

13. The method according to any of claims 1-12, wherein when stopping pushing the information to be pushed, the method further comprises:

and if all push strategies in the push strategy sequence are completely executed, distributing the information to be pushed to at least one receiving unit according to a preset distribution rule.

14. The method according to any of claims 1-12, wherein the push policy sequence comprises a preset allocation rule, and the preset allocation rule is the last push policy in the push policy sequence.

15. An information pushing apparatus, the apparatus comprising:

the system comprises an acquisition module, a receiving module and a processing module, wherein the acquisition module is configured to acquire information to be pushed and a corresponding pushing strategy sequence, the pushing strategy sequence comprises at least one pushing strategy, and the pushing strategy is a rule or a mode that a server pushes the information to be pushed to a receiving unit;

a determining module configured to determine at least one receiving unit of the information to be pushed according to the information to be pushed and/or the pushing policy sequence;

the pushing module is configured to sequentially execute each pushing strategy in the pushing strategy sequence and push the information to be pushed to at least one receiving unit;

a detection module configured to detect whether at least one of the following conditions is satisfied: the information to be pushed is received by at least one receiving unit, all pushing strategies in the pushing strategy sequence are executed,

if the detection module detects that at least one condition is met, the pushing module stops pushing the information to be pushed.

16. The apparatus of claim 15, wherein the obtaining module comprises:

the first acquisition unit is configured to acquire a preset push strategy sequence; or

And the second acquisition unit is configured to acquire a push strategy sequence matched with the information to be pushed from a preset push strategy sequence database.

17. The apparatus of claim 15, wherein the obtaining module comprises:

a target item receiving unit configured to receive a push target item input by a user;

and the pushing strategy sequence determining unit is configured to determine the pushing strategy sequence according to the information to be pushed and the pushing target item.

18. The apparatus of claim 17, wherein the push policy sequence determination unit is further configured to:

19. The apparatus of claim 17, wherein the push policy sequence determination unit is further configured to:

and determining the historical push strategy sequence with the maximum historical achievement degree as the push strategy sequence.

20. The apparatus of claim 17, wherein the push policy sequence determination unit is further configured to:

summing the weighting coefficients of the historical push strategy sequence;

21. The apparatus of claim 15, wherein the push policy in the sequence of push policies comprises at least one of:

22. The apparatus of claim 21, wherein the push policies in the sequence of push policies are ordered and executed sequentially.

23. The apparatus of claim 15, wherein the determining module comprises:

the identification unit is configured to identify the category of the information to be pushed;

the determining unit is configured to determine at least one receiving unit of the information to be pushed according to a preset corresponding relation between the type of the information to be pushed and the type of the receiving unit.

24. The apparatus of claim 17, wherein the determining module comprises:

and the push object determining unit is configured to determine at least one receiving unit of the information to be pushed according to the push strategy sequence.

25. The apparatus of claim 15, wherein the detection module is further configured to:

26. The apparatus of claim 15, further comprising:

the first distribution module is used for distributing the information to be pushed to the receiving unit for receiving the information to be pushed if the information to be pushed is received by at least one receiving unit when the pushing module stops pushing the information to be pushed.

27. The apparatus of any one of claims 15-26, further comprising:

and the second distributing module is used for distributing the information to be pushed to at least one receiving unit according to a preset distribution rule if all pushing strategies in the pushing strategy sequence are completely executed when the pushing module stops pushing the information to be pushed.

28. The apparatus of any of claims 15-26, wherein the push policy sequence comprises a preset allocation rule, and the preset allocation rule is a last push policy in the push policy sequence.