CN108985805B

CN108985805B - Method and device for selectively executing push task

Info

Publication number: CN108985805B
Application number: CN201710399360.7A
Authority: CN
Inventors: 陈杰; 张锋
Original assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Jingdong Shangke Information Technology Co Ltd
Current assignee: Beijing Jingdong Century Trading Co Ltd; Beijing Jingdong Shangke Information Technology Co Ltd
Priority date: 2017-05-31
Filing date: 2017-05-31
Publication date: 2021-04-30
Anticipated expiration: 2037-05-31
Also published as: CN108985805A

Abstract

The invention discloses a method and a device for selectively executing a push task, and relates to the technical field of computers. One embodiment of the method comprises: determining a target set; merging the rest push tasks in the push list and the additionally newly added push tasks to form a push task set to be executed; according to a set sequence, determining whether a push target of a push task belongs to a target set or not for each push task in a set of push tasks to be executed, and placing the push task in a push list when the push target of the push task does not belong to the target set; the implementation mode reduces the pushing error rate and improves the pushing accuracy rate.

Description

Method and device for selectively executing push task

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for selectively executing a push task, an electronic device terminal, and a computer-readable medium.

Background

In the process of information push, especially in the marketing process of short messages, mails and the like, the push frequency needs to be controlled to avoid excessive disturbance to users, namely, the same user (push target) only receives push information once in a certain time. When pushing information, filtering needs to be performed on users who have received the pushed information within a period of time. For example, if a user who has recently received a marketing message is among a group of people for which the operator wants to market, the system needs to identify them and no longer push the corresponding marketing message.

Current schemes for filtering users typically employ Bloom filters (a long binary vector and a series of random mapping functions to retrieve whether an element is in a set). Firstly, a Hashtable (hash table is created, any non-empty object is mapped to a corresponding value), then all users who have been marketed in a period of time use 8 different hash algorithms for each user to generate 8 hash values, then the 8 hash values are mapped to 8 coordinates in the Hashtable, and the values of the 8 coordinates are all set to be 1. When a new user needs marketing, 8 different hash algorithms are also used for the user to generate 8 hash values, the 8 hash values are mapped to 8 coordinates in a Hashtable, when the value of each coordinate is 1, the user is indicated to be marketed and needs to be abandoned, if the coordinate with the value not being 1 is indicated, namely the user is indicated to be not marketed, the 8 coordinate values are set to be 1, and the user is added into a marketing list.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

the bloom filter has a misjudgment risk, when 8 different hash algorithms are used for a certain user to generate 8 hash values, and the 8 hash values are mapped to 8 coordinates in the hash table, the 8 coordinates corresponding to the user are just 1 at a certain probability, and the user is also judged to exist and abandoned.

The bloom filter cannot schedule, and the operator cannot create subsequent tasks. The bloom filter can only judge whether pushing is performed in the past or not, and cannot judge which day pushing is performed, so that when an operator creates a subsequent task, the subsequent task can be filtered by a previously sent task.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method, an apparatus, an electronic device terminal, and a computer-readable medium for selectively executing a push task, which can accurately identify a push target, determine whether the push target of the push task is pushed, rank target users according to a relevance, preferentially push content to a target with a high relevance, and improve marketing efficiency.

To achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a method for selectively executing push tasks, wherein each push task includes push information and a push target, the method including periodically performing the following steps:

determining a target set, wherein the target set is a set of targets corresponding to push tasks executed within a time period of a set time length;

merging the rest push tasks in the push list and the additionally newly added push tasks to form a push task set to be executed;

determining whether a pushing target of the pushing task belongs to the target set or not for each pushing task in the pushing task set to be executed according to a set sequence, and placing the pushing task in the pushing list when the pushing target of the pushing task does not belong to the target set;

wherein each push task in the push list is executed before the push task is deleted from the push list.

Optionally, each push task in the set of push tasks to be executed is associated with a degree of association, where the degree of association is a numerical value representing a push priority, and the setting order is set in a descending order of the degree of association.

Optionally, after a push task in the push list is executed, adding a push target corresponding to the task to the target set as a timestamp in combination with the current time.

Optionally, the step of determining the target set is based on the current time and a timestamp of each push target in the original target set.

Optionally, the push information is commodity marketing information; the push is targeted to the terminal device of a potential customer purchasing goods.

Optionally, the periodic execution is daily execution, and the set duration is N days, where N is greater than 1.

Optionally, the association degree is determined according to a push log and a set learning algorithm.

To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an apparatus for selectively performing push tasks, each of which includes push information and a push target, the apparatus including:

the execution module is used for controlling the periodic operation of the following modules;

the device comprises an initialization module, a push module and a push module, wherein the initialization module is used for determining a target set, merging the rest push tasks in a push list and other newly-added push tasks to form a push task set to be executed, and the target set is a set of targets corresponding to the push tasks executed within a time period with set duration;

the screening module is used for determining whether a pushing target of each pushing task in the pushing task set to be executed belongs to the target set or not according to a set sequence, and placing the pushing task in the pushing list when the pushing target of the pushing task does not belong to the target set;

and the pushing module is used for executing each pushing task in the pushing list and deleting the pushing task from the pushing list after the pushing task is executed.

Optionally, the apparatus further comprises:

and the sequencing module is used for setting the setting sequence according to the descending order of the association degree, wherein the association degree is combined with each pushing task in the pushing task set to be executed, and the association degree is a numerical value representing the pushing priority.

Optionally, the pushing module is further configured to:

and when one pushing task in the pushing list is executed, adding a pushing target corresponding to the task into the target set by taking the current time as a timestamp.

Optionally, the screening module further determines the target set based on the current time and a timestamp of each push target in the original target set.

Optionally, the periodic operation is daily operation, and the set duration is N days, where N is greater than 1.

Optionally, the association degree in the sorting module is determined according to a push log and a set learning algorithm.

To achieve the above object, according to yet another aspect of the embodiments of the present invention, there is provided an electronic device terminal for selectively executing a push task, including:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement a method as any one of methods for selectively executing push tasks.

To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable medium for selectively executing a push task, having a computer program stored thereon, wherein the computer program, when executed by a processor, implements any one of methods for selectively executing a push task.

One embodiment of the above invention has the following advantages or benefits: due to the adoption of the technical means of sequencing and filtering the pushed targets according to the association degree, the technical problem that the pushed targets are easily misjudged is solved, the pushed targets are accurately identified, the contents can be preferentially pushed to the targets with high association degree, and the technical effect of marketing efficiency is improved.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram of the main steps of a method of selectively executing a push task according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of the main parts of an apparatus for selectively performing push tasks according to an embodiment of the present invention;

FIG. 3 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 4 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a schematic diagram of main steps of a method for selectively executing push tasks according to an embodiment of the present invention, and fig. 1 provides a method for selectively executing push tasks, where each push task includes push information and a push target, and is characterized by periodically executing the following steps:

step S101 is to determine a target set, wherein the target set is a set of targets corresponding to push tasks executed within a time period of a set duration;

step S102, combining the rest push tasks in the push list and the additionally newly added push tasks to form a push task set to be executed;

step S103, according to a set sequence, for each push task in the set of push tasks to be executed, determining whether a push target of the push task belongs to the target set, and when the push target of the push task does not belong to the target set, placing the push task in the push list; determining whether a push target of the push task belongs to the target set by using a Hashmap tool (a key-value one-to-one data structure for realizing quick positioning and query by using a hash algorithm), importing all push targets in the target set into the Hashmap as key values (key values), sequentially searching in the Hashmap by using the push target of each task to be pushed as the key value, and if the same key value is searched, indicating that the push target exists in the target set, namely that the user has been pushed related content recently, giving up the push target; if the same key value is not searched, the pushing target does not exist in the target set, that is, the user has not pushed related content recently, and the user is taken as a pushing object of the pushing task of this time and sent to the pushing list.

After each push task in the push list is executed, that is, after the push information of the push task is sent to the corresponding push target, the push task is deleted from the push list.

Each push task in the push task set to be executed is combined with a relevance, the relevance is a numerical value representing the push priority, and the set sequence is set according to the descending order of the relevance, so that a user with high relevance is enabled to be preferentially pushed information. The relevancy is obtained from an external interface, and a user recommendation algorithm and a learning algorithm, such as a collaborative filtering method and a regression prediction method, are generally adopted in the method for calculating the relevancy according to the push log.

And when one pushing task in the pushing list is executed, adding a pushing target corresponding to the task into the target set by taking the current time as a timestamp, and updating the target set. Since the method is executed periodically, if a certain push task fails to execute, its corresponding push target will continue to be pushed in the next cycle.

The push information is commodity marketing information; the push is targeted to the terminal devices of potential customers who purchase goods, such as cell phones, portable computers, and the like.

In the embodiment of the present invention, the periodic execution may be performed every day, the set time length is N days, where N is greater than 1, the push list is a tool for temporarily storing the push task, and after the execution of one period is completed, the push list is emptied to store the push task of the next period.

Fig. 2 is a schematic diagram of the main parts of an apparatus 200 for selectively executing a push task according to an embodiment of the present invention, which includes:

an execution module 201 for controlling the periodic operation of the following modules.

The initialization module 202 is configured to determine a target set, and merge the remaining push tasks in the push list and another newly added push task to form a push task set to be executed, where the target set is a set of targets corresponding to the push tasks executed within a time period of a set duration.

The screening module 203 is configured to determine, according to a set sequence, whether a push target of each push task in the set of push tasks to be executed belongs to the target set, and place the push task in the push list when the push target of the push task does not belong to the target set; the screening module 203 is further configured to determine a target set based on the current time and the timestamp of each push target in the original target set.

A pushing module 204, configured to execute each pushing task in the pushing list, and delete the pushing task from the pushing list after the pushing task is executed. And when one push task in the push list is executed, adding a push target corresponding to the task into the target set by taking the current time as a timestamp.

The sorting module 205 is configured to set the setting order according to a descending order of the association degree, where each push task in the set of push tasks to be executed has an association degree, and the association degree is a numerical value representing a push priority.

The push information is commodity marketing information; the push is targeted to the terminal devices of potential customers who purchase goods, such as cell phones and portable computers.

The periodic execution module is executed every day, and the set time duration is N days, wherein N is greater than 1.

Furthermore, the association degree in the sorting module is determined according to the push log and a set learning algorithm.

Fig. 3 illustrates an exemplary system architecture 300 of a method for selectively executing push tasks or a device for selectively executing push tasks to which embodiments of the present invention may be applied.

As shown in fig. 3, the system architecture 300 may include

terminal devices

301, 302, 303, a network 304, and a server 305. The network 304 serves as a medium for providing communication links between the

terminal devices

301, 302, 303 and the server 305. Network 304 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal device

301, 302, 303 to interact with the server 305 via the network 304 to receive or send messages or the like. The

terminal devices

301, 302, 303 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

The

terminal devices

301, 302, 303 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 305 may be a server providing various services, such as a background management server (for example only) providing support for shopping-like websites browsed by users using the

terminal devices

301, 302, 303. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.

It should be noted that, the method for selectively executing a push task provided by the embodiment of the present invention is generally executed by the server 305, and accordingly, a device for selectively executing a push task is generally disposed in the server 305.

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

FIG. 4 is a block diagram of a computer system 400 suitable for implementing a terminal device of an embodiment of the present invention. The terminal device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 4, the computer system 400 includes a Central Processing Unit (CPU)401 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.

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

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer 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 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 401.

It should be noted that the computer readable media shown in the present invention include computer readable signal media or computer readable storage media, or any combination of the two. A computer readable storage medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, semiconductor system, apparatus, or device, or any combination of the foregoing. Computer-readable storage media specifically include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any combination of the foregoing. In the present invention, a computer readable storage medium includes any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device; a computer readable signal medium includes a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave, which may take many forms, including, but not limited to, electromagnetic signals, optical signals, or any combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any combination of the above.

The flowcharts or block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention, and each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises an execution module, an initialization module, a screening module and a pushing module. The names of these modules do not form a limitation on the unit itself in some cases, for example, a push module may also be described as "a module for executing each push task in the push list to send the push information of the push task to a corresponding push target, and deleting the push task from the push list after the execution of the push task is completed".

On the other hand, the embodiment of the present invention also provides a computer-readable medium, which may be included in the apparatus described in the above embodiment; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

wherein each push task in the push list is executed to send push information of the push task to a corresponding push target, and when the execution of the push task is completed, the push task is deleted from the push list.

According to the technical scheme of the embodiment of the invention, one embodiment of the invention has the following advantages or beneficial effects: due to the adoption of the technical means of sequencing and filtering the pushed targets according to the association degree, the technical problem that the pushed targets are easily misjudged is solved, the pushed targets are accurately identified, the contents can be preferentially pushed to the targets with high association degree, and the technical effect of marketing efficiency is improved.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method of selectively executing push tasks, wherein each push task comprises push information and a push target, comprising periodically performing the steps of:

after each push task in the push list is executed, deleting the push task from the push list;

each push task in the push task set to be executed is associated with a degree of association, the degree of association is a numerical value representing push priority, and the setting sequence is set according to the descending order of the degree of association.

2. The method according to claim 1, wherein when a push task in the push list is completed, a push target corresponding to the task is added to the target set as a timestamp in combination with a current time.

3. The method of claim 2, wherein the step of determining the set of targets is based on a current time and a timestamp of each push target in the original set of targets.

4. The method of claim 1, wherein the push message is a merchandise marketing message; the push is targeted to the terminal device of a potential customer purchasing goods.

5. The method of claim 1, wherein the periodic execution is daily and the set duration is N days, where N is greater than 1.

6. The method of claim 1, wherein the degree of association is determined according to a push log and a set learning algorithm.

7. An apparatus for selectively performing push tasks, wherein each push task includes push information and a push target, comprising:

the pushing module is used for executing each pushing task in the pushing list and deleting the pushing task from the pushing list after the pushing task is executed;

the device further comprises a sorting module, configured to set the setting order according to a descending order of the association degree, where each push task in the set of push tasks to be executed has an association degree, and the association degree is a numerical value representing a push priority.

8. The apparatus of claim 7, wherein the pushing module is further configured to:

9. The apparatus of claim 8, wherein the filtering module determines the target set further based on a current time and a timestamp of each push target in the original target set.

10. The apparatus of claim 7, wherein the push message is a merchandise marketing message; the push is targeted to the terminal device of a potential customer purchasing goods.

11. The apparatus of claim 7, wherein the periodic operation is daily operation and the set duration is N days, where N is greater than 1.

12. The apparatus of claim 7, wherein the degree of association in the ranking module is determined according to a push log and a set learning algorithm.

13. An electronic device terminal for selectively executing a push task, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.

14. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.