CN112465557A - Advertisement sending method, device, system and storage medium - Google Patents
Advertisement sending method, device, system and storage medium Download PDFInfo
- Publication number
- CN112465557A CN112465557A CN202011417872.XA CN202011417872A CN112465557A CN 112465557 A CN112465557 A CN 112465557A CN 202011417872 A CN202011417872 A CN 202011417872A CN 112465557 A CN112465557 A CN 112465557A
- Authority
- CN
- China
- Prior art keywords
- advertisement
- candidate
- time
- total
- estimated time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012163 sequencing technique Methods 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 5
- 239000002699 waste material Substances 0.000 description 3
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000007670 refining Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0242—Determining effectiveness of advertisements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0251—Targeted advertisements
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an advertisement sending method, device, system and storage medium, wherein the method comprises the steps of judging whether the total estimated time of a plurality of candidate advertisements is greater than the total time of an advertisement putting plan; and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements. The method has the advantages that the candidate advertisement putting time is ensured through the comparison of the total estimated time of the candidate advertisements and the total time of the advertisement putting plan, the target advertisement is determined according to the comparison result, the estimated time and the playing importance degree of each candidate advertisement, the pushed target advertisement is made to accord with the total time of the advertisement putting plan, the pushed target advertisement is optimized according to the estimated time and the playing importance degree, the total time of the advertisement putting plan is utilized to the maximum extent, resources are not wasted, the cost is optimized, the experience of an advertisement putting party is improved, and the method is convenient for users.
Description
Technical Field
The invention relates to the technical field of advertising machines, in particular to an advertisement sending method, device, system and storage medium.
Background
The advertisement player is a new generation of intelligent equipment, forms a complete advertisement broadcasting control system through terminal software control, network information transmission and multimedia terminal display, and carries out advertisement propaganda through multimedia materials such as pictures, characters, videos, small plug-ins (weather, exchange rate and the like). The parallel issuing of a plurality of advertisements is the key for timely exposing the advertisement data of the advertisement data issuing system, and the total time of the advertisement putting plan is fixed, so the issued advertisements are limited, the current advertisement sending method cannot reasonably and maximally issue the advertisements to be put according to the total time of the advertisement putting plan, and the rest of the advertisement putting time is caused, so the waste of advertisement resources is caused, the putting cost is increased, and the experience of an advertisement putting party is influenced.
Accordingly, the prior art is yet to be developed and improved.
Disclosure of Invention
In view of the above, it is necessary to provide an advertisement transmission method, an apparatus, a system and a storage medium for solving the technical problems of cost increase and resource waste caused by not being able to maximally utilize the total time of an advertisement delivery plan in the prior art.
In a first aspect, the present application provides an advertisement sending method, including:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan;
and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
Optionally, the method further includes:
when the total estimated time of the candidate advertisements is equal to the total time of the advertisement putting plan, taking the candidate advertisements as target advertisements;
and when the total estimated time of the candidate advertisements is less than the total time of the advertisement putting plan, adding a new candidate advertisement, so that the sum of the estimated time of the new candidate advertisement and the total estimated time of the candidate advertisements is equal to the total time of the advertisement putting plan.
Optionally, when the total estimated time of the candidate advertisements is greater than the total time of the advertisement delivery plan, determining the target advertisement according to the estimated time and the play importance of each candidate advertisement includes:
acquiring the estimated time of each candidate advertisement and the playing importance degree of each candidate advertisement;
sequencing the candidate advertisements according to the estimated time and the playing importance degree of the candidate advertisements;
removing part of the candidate advertisements according to the sorting result so that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement putting plan;
and taking the remaining candidate advertisements as target advertisements.
Optionally, the sorting the candidate advertisements according to the estimated time and the playing importance of the candidate advertisements includes:
sorting the candidate advertisements according to the playing importance degrees of the candidate advertisements to obtain a first sorting result;
if the playing importance degrees of at least two candidate advertisements in the first sequencing result are the same, re-sequencing the candidate advertisements with the same playing importance degrees according to the estimated time to obtain a second sequencing result;
and taking the first sorting result or the second sorting result as the sorting result of each candidate advertisement.
Optionally, the removing part of the candidate advertisements according to the sorting result so that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement delivery plan includes:
calculating the advertisement time difference between the total estimated time of the candidate advertisements and the total time of the advertisement putting plan;
obtaining a sequencing result;
and selecting candidate advertisements to be removed from the sequencing result according to the advertisement time difference so as to ensure that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement putting plan.
Optionally, the method further includes:
and if the number of the target advertisements is multiple, the multiple target advertisements are issued to the same advertisement player or multiple advertisement players in parallel.
Optionally, the playing importance level is determined according to the priority of the candidate advertisement.
In a second aspect, the present application provides an advertisement delivery apparatus, the apparatus comprising:
the judging module is used for judging whether the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan;
and the advertisement determining module is used for determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, wherein the target advertisement is a plurality of candidate advertisements.
In a third aspect, an embodiment of the present application further provides an advertisement sending system, which includes the advertisement sending apparatus.
In a fourth aspect, embodiments of the present application further provide a computer-readable storage medium storing a computer program, which when executed by a processor, causes the processor to perform the following steps:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan;
and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
The embodiment of the invention has the following beneficial effects:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan; and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements. The method has the advantages that the candidate advertisement putting time is ensured through the comparison of the total estimated time of the candidate advertisements and the total time of the advertisement putting plan, the target advertisement is determined according to the comparison result, the estimated time and the playing importance degree of each candidate advertisement, the pushed target advertisement is made to accord with the total time of the advertisement putting plan, the pushed target advertisement is optimized according to the estimated time and the playing importance degree, the total time of the advertisement putting plan is utilized to the maximum extent, resources are not wasted, the cost is optimized, the experience of an advertisement putting party is improved, and the method is convenient for users.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Wherein:
fig. 1 is a schematic flow chart of an advertisement sending method in an embodiment of the present application;
fig. 2 is another schematic flow chart of an advertisement sending method in the embodiment of the present application;
FIG. 3 is a schematic structural diagram of an advertisement delivery device according to an embodiment of the present application;
fig. 4 is a block diagram of a computer device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Please refer to fig. 1, which is a schematic flow chart of an advertisement sending method in an embodiment of the present application, where the method includes:
in the embodiment of the application, the advertisement sending method is implemented by an advertisement sending device (hereinafter, referred to as a sending device), the sending device may be an internet of things system, the internet of things system is connected with a plurality of advertisement machines and performs network communication, and the connection mode may be 3G connection, 4G connection or WIFI connection; the transmitting device may also be a server, both of which are used to implement the advertisement transmitting method described above.
The sending device judges whether the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan. In particular, the candidate advertisement is any advertisement of a plurality of advertisements to be distributed on the advertisement engine. And each candidate advertisement is released at the advertising machine and corresponds to an estimated time, wherein the estimated time refers to the time from the moment that the candidate advertisement is sent to the advertising machine to receive and display the candidate advertisement. The total time of the advertisement putting plan refers to the total time of the advertisement machine for inserting the advertisements, the total time of the advertisement putting plan can be fixedly configured in advance, and the total time of the advertisement putting plan can be automatically adjusted according to market demands and audience degrees of different environment display places, so that the number of the advertisements played by the advertisement machine is as large as possible. For example, when a place A passes through 2 bus stations to a place B, the bus of the 1 st bus station is estimated to stay for 3 minutes, the 3 minutes is the total time of the advertisement putting plan, the bus of the 2 nd bus station is estimated to stay for 2 minutes, if the sending device detects that the stay time of the current bus station is different from the stay time of the last bus station, the total time of the advertisement putting plan is updated to the stay time of the current bus station, the total time of the advertisement putting plan is intelligently set according to different environments, the matching data of subsequent target advertisements is more accurate, the failure rate of advertisement publishing is reduced, and the advertisement putting efficiency is improved.
The sending device receives advertisement data sent by a client, wherein the material form of the advertisement data comprises image data, audio data, video data and the like, and also receives associated data corresponding to each advertisement data, and the associated data comprises estimated time of each advertisement, display cost of each advertisement, download success frequency of each advertisement, click rate of each advertisement, priority level of each advertisement and the like. The transmitting device receives the advertisement data and the corresponding associated data and processes the advertisement data and takes the processed advertisement data as candidate advertisements.
Since the total time of the advertisement delivery plan is determined, in order to ensure that the advertisement machine successfully receives and effectively displays the advertisement, it is necessary to ensure that the total estimated time of the candidate advertisements displayed by the advertisement machine does not exceed the total time of the advertisement delivery plan. That is, more candidate advertisements are delivered as much as possible, so that the total estimated time of the candidate advertisements to be finally delivered is equal to the total time of the advertisement delivery plan, thereby maximizing the utilization of time and saving the waste of resources and cost. Therefore, the sending device needs to calculate the total estimated time of all the candidate advertisements, and determine the optimal scheme for delivering the candidate advertisements by comparing the total estimated time with the total time of the advertisement delivery plan.
It can be understood that the total estimated time is obtained by calculating the sum of the estimated time of a plurality of candidate advertisements by the sending device, and whether the total estimated time is greater than the total time of the advertisement putting plan is judged.
And 102, if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
In the embodiment of the present application, based on the description of step 101, the best solution for delivering the candidate advertisement is that the total estimated time of the multiple candidate advertisements delivered is equal to the total time of the advertisement delivery plan, so that the advertisement delivery is maximized. If the total estimated time of the candidate advertisements to be delivered is greater than the total time of the advertisement delivery plan, it indicates that part of the candidate advertisements need to be deleted, so that the total estimated time of the remaining candidate advertisements is as equal to the total time of the advertisement delivery plan as possible, and successful delivery and display are ensured.
Further, the sending device determines the remaining candidate advertisements according to the estimated time and the playing importance degree of each candidate advertisement, and takes the remaining candidate advertisements as the target advertisements. The playing importance degree refers to the probability of playing preferentially when a plurality of advertisements are received by the same advertising player at the same time. In this embodiment of the application, the playing importance degree is determined according to the priority of the candidate advertisement, that is, when the sending device receives each advertisement data and its corresponding associated data, the sending device obtains the priority level of the candidate advertisement from the corresponding associated data, and the priority level can be differentiated by the size of a number, where the larger the number is, the higher the priority level is, the higher the playing importance degree is, that is, the more the candidate advertisement is issued and displayed. Of course, the above-mentioned manner for determining the playing importance degree may also be determined according to the display fee of the advertisement, and the higher the display fee, the higher the playing importance degree is, that is, the more the advertisement is issued and displayed first. Therefore, the above-mentioned manner for determining the playing importance level is not limited, and can be set according to different requirements.
Thus, based on the steps 101 and 102, the candidate advertisement delivery time is ensured by comparing the total estimated time of the candidate advertisements with the total advertisement delivery plan time, and the target advertisement is determined according to the comparison result, the estimated time and the play importance of each candidate advertisement, so that the delivered target advertisement conforms to the total advertisement delivery plan time, the delivered target advertisement is optimized according to the estimated time and the play importance, the total advertisement delivery plan time is utilized to the maximum extent, resources are not wasted, the cost is optimized, the experience of an advertisement delivery party is improved, and the user is facilitated.
For better understanding of the technical solution in the embodiment of the present application, please refer to fig. 2, which is another schematic flow chart of an advertisement sending method in the embodiment of the present application, where the method includes:
it can be understood that the content described in this step is similar to the content described in step 101 in the embodiment shown in fig. 1, and specific reference may be made to the related content in step 101 in the embodiment shown in fig. 1, which is not described herein again.
in the embodiment of the application, the estimated time of each candidate advertisement is obtained from the received associated data through the sending device, and then the estimated times are added to obtain the total estimated time. And then, subtracting the total time of the advertisement putting plan from the total estimated time to obtain an advertisement time difference.
In a feasible manner, if the total estimated time of the candidate advertisements is equal to the total time of the advertisement delivery plan, the candidate advertisements are used as target advertisements for being released at the advertisement player.
In another feasible way, if the total estimated time of the candidate advertisements is less than the total time of the advertisement putting plan, it indicates that there is time left under the condition of the total time of the current advertisement putting plan, therefore, a new candidate advertisement can be added again, so that the sum of the estimated time of the new candidate advertisement and the total estimated time of the candidate advertisements is equal to the total time of the advertisement putting plan, thereby maximizing the advertisement putting time. The new candidate advertisement may be an advertisement to be played in the next period, or may be an important or temporary advertisement to expand services. It is to be understood that the new candidate advertisement is not limited, and the sending device may notify the advertisement delivering party to add the new candidate advertisement in time, so as to improve the delivering efficiency. If the sending device does not receive any newly added candidate advertisement, the adding mode of the new candidate advertisement can be the original candidate advertisement, and only the estimated time of the original candidate advertisement needs to be prolonged by an advertisement time difference, so that the propaganda intensity of the original candidate advertisement is increased, users are further attracted, and the audience rate is improved.
In some application scenarios, if the sending device detects that the total time of the current advertisement delivery plan is different from the total time of the previous advertisement delivery plan, the updated total time of the advertisement delivery plan needs to be obtained, and the total estimated time of the candidate advertisements and the total time of the new advertisement delivery plan are determined again, and if the total estimated time of the candidate advertisements is still greater than the total time of the new advertisement delivery plan, the operation step 202 is repeated.
in the embodiment of the application, the sending device obtains the estimated time of each candidate advertisement and the priority of each candidate advertisement from the received advertisement data and the corresponding associated data thereof, and determines the playing importance degree corresponding to each candidate advertisement according to each priority.
In order to improve the delivery efficiency, deliver candidate advertisements as much as possible and improve the income of business merchants of enterprises, when the total estimated time of each candidate advertisement is longer than the total time of an advertisement delivery plan, part of the candidate advertisements need to be effectively deleted, wherein the deletion refers to suspending the delivery of the candidate advertisements and not being used as target advertisements. Specifically, the candidate advertisements are ranked according to the estimated time and the playing importance degree of the candidate advertisements, so that the deletion sequence of the candidate advertisements is determined through ranking to achieve the lowest loss.
In one possible approach, the step 203 of refining includes:
s2031, sorting the candidate advertisements according to the playing importance degree of the candidate advertisements to obtain a first sorting result;
s2032, if the playing importance degrees of at least two candidate advertisements in the first sequencing result are the same, re-sequencing the candidate advertisements with the same playing importance degrees according to the estimated time to obtain a second sequencing result;
s2033, taking the first sorting result or the second sorting result as the sorting result of each candidate advertisement.
Specifically, the playing importance level is determined by the priority level of each candidate advertisement. It can be understood that the playing importance degrees corresponding to the candidate advertisements are the same, and therefore, the candidate advertisements with the same playing importance degrees need to be sorted according to the estimated time of the candidate advertisements. If the estimated time is still the same, the candidate advertisements can be sorted according to other associated data such as display cost so as to finally determine the sorting result of each candidate advertisement.
And 204, selecting candidate advertisements to be removed from the sequencing result according to the advertisement time difference so as to ensure that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement putting plan, and taking the remaining candidate advertisements as target advertisements.
In the embodiment of the application, the estimated time with the minimum difference with the advertisement time is searched from the small playing importance degree to the large playing importance degree of the sequencing result, and then the candidate advertisements corresponding to the estimated time are removed to obtain the remaining candidate advertisements.
In a feasible manner, if the searched estimated time is equal to the advertisement time difference, the candidate advertisements corresponding to the estimated time are removed, and the remaining candidate advertisements are used as the target advertisements.
In another feasible mode, if the searched estimated time is smaller than the advertisement time difference, searching estimated time with a small difference with the advertisement time difference, shortening the estimated time with the small difference by a first time threshold, wherein the first time threshold is equal to the estimated time with the smallest difference subtracted from the advertisement time difference, then removing the candidate advertisement corresponding to the estimated time with the smallest difference, and taking the final residual candidate advertisement as the target advertisement. It should be noted that, if the estimated time with the small difference is smaller than the first time threshold, the estimated time with the small difference between the continuous difference and the advertisement time is the same, and so on, and is not repeated.
In another feasible manner, if the searched estimated time is greater than the advertisement time difference, the searched estimated time may be shortened by a second time threshold, where the second time threshold is equal to the advertisement time difference, and finally all the shortened candidate advertisements are used as target advertisements.
It should be noted that the above-mentioned removing refers to suspending the issuing and displaying of the candidate advertisement.
To further understand steps 201 through 204, an embodiment is described as follows:
the partial format for storing each advertisement data in the transmitting apparatus is as follows:
assuming that the candidate advertisements are 1 to 7, the total time of the advertisement putting plan is 240 seconds (i.e. 4 minutes), calculating the total estimated time of the candidate advertisements 1 to 7 to be 257 seconds, which is greater than the total time of the advertisement putting plan, and then subtracting the total time of the advertisement putting plan from the total estimated time to obtain an advertisement time difference of 17 seconds;
1-7 candidate advertisements are sorted according to the priorities from high to low, since the priorities of the candidate advertisement 1 and the candidate advertisement 2 are both 10, it is indicated that the playing importance degrees of the candidate advertisement 1 and the candidate advertisement 2 are the same, the candidate advertisement 1 and the candidate advertisement 2 are continuously sorted from large to small according to the respective estimated time, and since the estimated time of the candidate advertisement 1 is less than that of the candidate advertisement 2, the finally obtained second sorting result is as follows:
searching the estimated time with the smallest difference of 17 seconds from the advertisement time in the second sequencing result according to the sequence from bottom to top, wherein the priority of the candidate advertisement serial number 3 is equal to that of the candidate advertisement serial number 6, so that the playing importance degree of the candidate advertisement serial number is equal, but the estimated time of the candidate advertisement 3 is greater than the estimated time of the candidate advertisement 6, in order to deliver the advertisements as much as possible, and the time difference between the candidate advertisement 3 and the advertisement is smallest (difference is 3, and the time difference between the candidate advertisement 6 and the advertisement is 7), therefore, the candidate advertisement 3 is selected to be processed, that is, the candidate advertisement 3 is shortened by 17 seconds, so that the estimated time of the candidate advertisement 3 is updated to be 3 finally, and then the total estimated time of all updated candidate advertisements is equal to the total time of advertisement delivery plan, that is, the final target advertisement is as follows:
further, in a feasible manner, if a plurality of target advertisements need to be issued, the target advertisements are issued to the same advertisement machine or a plurality of advertisement machines at the same time, that is, the sending device adopts a parallel issuing manner, so that the issuing transmission time is shortened, thereby ensuring that the target advertisements can be issued to the corresponding advertisement machines in time, and reducing the probability of issuing failure.
Furthermore, in the parallel issuing process, a plurality of threads can be created, the threads alternately execute the issued tasks, once the thread finishes executing the current issued task, the next issued task is continuously selected to be continuously executed until all the issued tasks are finished.
In the embodiment of the application, the candidate advertisement delivery time is ensured by comparing the total estimated time of a plurality of candidate advertisements with the total advertisement delivery plan time, and the target advertisement is determined according to the comparison result, the estimated time and the play importance degree of each candidate advertisement, so that the delivered target advertisement accords with the total advertisement delivery plan time, the delivered target advertisement is optimized according to the estimated time and the play importance degree, the total advertisement delivery plan time is utilized to the maximum extent, resources are not wasted, the cost is optimized, the experience of an advertisement delivery party is improved, and the user convenience is brought.
Please refer to fig. 3, which is a schematic structural diagram of an advertisement transmitting device in an embodiment of the present application, the advertisement transmitting device includes:
the judging module 10 is configured to judge whether the total estimated time of the multiple candidate advertisements is greater than the total time of the advertisement delivery plan;
and the advertisement determining module 20 is configured to determine a target advertisement according to the estimated time and the playing importance of each candidate advertisement if the total estimated time of the plurality of candidate advertisements is greater than the total time of the advertisement putting plan, where the target advertisement is a plurality of candidate advertisements.
It should be noted that, the content of the above-mentioned determining module 10 and the content of the advertisement determining module 20 may refer to the content described in fig. 1 to fig. 2, which is not described herein again.
In the embodiment of the application, the candidate advertisement delivery time is ensured by comparing the total estimated time of a plurality of candidate advertisements with the total advertisement delivery plan time, and the target advertisement is determined according to the comparison result, the estimated time and the play importance degree of each candidate advertisement, so that the delivered target advertisement accords with the total advertisement delivery plan time, the delivered target advertisement is optimized according to the estimated time and the play importance degree, the total advertisement delivery plan time is utilized to the maximum extent, resources are not wasted, the cost is optimized, the experience of an advertisement delivery party is improved, and the user convenience is brought.
In an embodiment, an advertisement sending system is provided, where the system includes an advertisement sending apparatus shown in fig. 3, and specifically refer to the content described in fig. 3, which is not described herein again.
FIG. 4 is a diagram illustrating an internal structure of a computer device in one embodiment. The computer device may specifically be a terminal, and may also be a server. As shown in fig. 4, the computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program that, when executed by the processor, causes the processor to implement the age identification method. The internal memory may also have a computer program stored therein, which when executed by the processor, causes the processor to perform the age identification method. Those skilled in the art will appreciate that the architecture shown in fig. 4 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is proposed, comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the steps of:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan;
and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
In one embodiment, a computer-readable storage medium is proposed, in which a computer program is stored which, when executed by a processor, causes the processor to carry out the steps of:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan;
and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. An advertisement sending method, characterized in that the method comprises:
judging whether the total estimated time of the candidate advertisements is greater than the total time of an advertisement putting plan;
and if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement, wherein the target advertisement is a plurality of candidate advertisements.
2. The method of claim 1, further comprising:
when the total estimated time of the candidate advertisements is equal to the total time of the advertisement putting plan, taking the candidate advertisements as target advertisements;
and when the total estimated time of the candidate advertisements is less than the total time of the advertisement putting plan, adding a new candidate advertisement, so that the sum of the estimated time of the new candidate advertisement and the total estimated time of the candidate advertisements is equal to the total time of the advertisement putting plan.
3. The method of claim 1, wherein determining the target advertisement according to the estimated time and the playing importance of each candidate advertisement when the total estimated time of the candidate advertisements is greater than the total time of the advertisement delivery plan comprises:
acquiring the estimated time of each candidate advertisement and the playing importance degree of each candidate advertisement;
sequencing the candidate advertisements according to the estimated time and the playing importance degree of the candidate advertisements;
removing part of the candidate advertisements according to the sorting result so that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement putting plan;
and taking the remaining candidate advertisements as target advertisements.
4. The method of claim 3, wherein ranking the candidate advertisements according to their estimated time and importance comprises:
sorting the candidate advertisements according to the playing importance degrees of the candidate advertisements to obtain a first sorting result;
if the playing importance degrees of at least two candidate advertisements in the first sequencing result are the same, re-sequencing the candidate advertisements with the same playing importance degrees according to the estimated time to obtain a second sequencing result;
and taking the first sorting result or the second sorting result as the sorting result of each candidate advertisement.
5. The method according to claim 3 or 4, wherein the removing partial candidate advertisements according to the ranking result so that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement placement plan comprises:
calculating the advertisement time difference between the total estimated time of the candidate advertisements and the total time of the advertisement putting plan;
obtaining a sequencing result;
and selecting candidate advertisements to be removed from the sequencing result according to the advertisement time difference so as to ensure that the total estimated time of the remaining candidate advertisements is less than or equal to the total time of the advertisement putting plan.
6. The method of claim 1, further comprising:
and if the number of the target advertisements is multiple, the multiple target advertisements are issued to the same advertisement player or multiple advertisement players in parallel.
7. The method of claim 1, wherein the importance of playing is determined according to a priority of the candidate advertisement.
8. An advertisement transmission apparatus, characterized in that the apparatus comprises:
the judging module is used for judging whether the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan;
and the advertisement determining module is used for determining a target advertisement according to the estimated time and the playing importance degree of each candidate advertisement if the total estimated time of the candidate advertisements is greater than the total time of the advertisement putting plan, wherein the target advertisement is a plurality of candidate advertisements.
9. A computer-readable storage medium, storing a computer program which, when executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 7.
10. An advertisement transmission system comprising the advertisement transmission apparatus according to claim 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011417872.XA CN112465557A (en) | 2020-12-07 | 2020-12-07 | Advertisement sending method, device, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011417872.XA CN112465557A (en) | 2020-12-07 | 2020-12-07 | Advertisement sending method, device, system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112465557A true CN112465557A (en) | 2021-03-09 |
Family
ID=74801512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011417872.XA Pending CN112465557A (en) | 2020-12-07 | 2020-12-07 | Advertisement sending method, device, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112465557A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115239375A (en) * | 2022-07-07 | 2022-10-25 | 深圳辉煌明天科技有限公司 | Advertisement delivery method, device and system based on big data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7818207B1 (en) * | 2003-01-10 | 2010-10-19 | Google, Inc. | Governing the serving of advertisements based on a cost target |
| CN105046525A (en) * | 2015-06-30 | 2015-11-11 | 腾讯科技（北京）有限公司 | Advertisement delivery system, device and method |
| JP2016001319A (en) * | 2015-07-17 | 2016-01-07 | ヤフー株式会社 | Advertisement determination device, advertisement determination method, and program |
| CN111217216A (en) * | 2018-11-27 | 2020-06-02 | 广景视睿科技（深圳）有限公司 | Elevator advertisement projection control method and device and projector system |
| CN112016972A (en) * | 2020-08-31 | 2020-12-01 | 成都新潮传媒集团有限公司 | Advertisement sorting method and device and computer readable storage medium |
-
2020
- 2020-12-07 CN CN202011417872.XA patent/CN112465557A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7818207B1 (en) * | 2003-01-10 | 2010-10-19 | Google, Inc. | Governing the serving of advertisements based on a cost target |
| CN105046525A (en) * | 2015-06-30 | 2015-11-11 | 腾讯科技（北京）有限公司 | Advertisement delivery system, device and method |
| JP2016001319A (en) * | 2015-07-17 | 2016-01-07 | ヤフー株式会社 | Advertisement determination device, advertisement determination method, and program |
| CN111217216A (en) * | 2018-11-27 | 2020-06-02 | 广景视睿科技（深圳）有限公司 | Elevator advertisement projection control method and device and projector system |
| CN112016972A (en) * | 2020-08-31 | 2020-12-01 | 成都新潮传媒集团有限公司 | Advertisement sorting method and device and computer readable storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115239375A (en) * | 2022-07-07 | 2022-10-25 | 深圳辉煌明天科技有限公司 | Advertisement delivery method, device and system based on big data |
| CN115239375B (en) * | 2022-07-07 | 2023-05-09 | 深圳辉煌明天科技有限公司 | Advertisement putting method, device and system based on big data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110784759B (en) | Bullet screen information processing method and device, electronic equipment and storage medium | |
| CN110944219B (en) | Resource allocation method, device, server and storage medium | |
| CN106815254A (en) | A kind of data processing method and device | |
| CN112000871A (en) | Method, device and equipment for determining search result list and storage medium | |
| CN113468374A (en) | Target display method and device, electronic equipment and storage medium | |
| CN112465557A (en) | Advertisement sending method, device, system and storage medium | |
| CN114153581A (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN114358819A (en) | Method and device for publishing advertisement covering multiple platforms | |
| CN113329232B (en) | Resource distribution method and device, electronic equipment and storage medium | |
| CN113610571A (en) | Scheduling method of playing tasks | |
| CN112199521B (en) | Automatic media asset arranging method, device and system, electronic device and storage medium | |
| CN114513462B (en) | Dynamic service flow distribution method and system | |
| CN110933504A (en) | Video recommendation method, device, server and storage medium | |
| CN113329233B (en) | Live broadcast data processing method and device, electronic equipment and storage medium | |
| CN114020360A (en) | Method, device and equipment for preloading small program resources and storage medium | |
| CN114390105A (en) | Enterprise user distribution method and device based on test | |
| CN113467907A (en) | Task processing method and device, electronic equipment and storage medium | |
| CN113222661A (en) | Advertisement filling method and device and storage medium | |
| CN110570136B (en) | Distribution range determining method, distribution range determining device, electronic equipment and storage medium | |
| CN113743982A (en) | Advertisement putting scheme recommendation method and device, computer equipment and storage medium | |
| CN113515691B (en) | Resource distribution method, device, electronic equipment and storage medium | |
| CN113507624B (en) | Video information recommendation method and system | |
| CN112861041B (en) | Media content display method and device, electronic equipment and storage medium | |
| CN114418654B (en) | Advertisement recommendation method and device based on intelligent terminal interface switching | |
| CN114374881B (en) | Method and device for distributing user traffic, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |