Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to specific embodiments of the present specification and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present specification. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the embodiments of the present application.
As mentioned above, the current marketing rights are not targeted, and after the marketing campaign is promoted, a large number of users cannot generate enthusiasm, so that the marketing effect is not ideal.
To ensure that a majority of users are able to support a marketing campaign, it is easy to think of delivering high comprehensive scoring marketing rights to users. The overall score is dependent on the rate of the marketing equity (the rate of equity refers to the probability that the user uses the marketing equity) and the marketing cost of the marketing equity. In this manner, however, the utilization of the marketing equity has an approximately linear relationship with the marketing costs, which is not always true.
For example, in situations where the total cost is insufficient, the user cannot be given high value marketing rights, and then the weight of the marketing cost and the utilization rate in the composite score needs to be adjusted. In weight adjustment, marketing costs and utilization may vary drastically and do not necessarily lead to an ideal compromise.
In view of the above, the present application provides a scheme for delivering marketing rights in a nonlinear relationship from the two viewpoints of controlling marketing cost and user utilization.
In one aspect, an embodiment of the present application provides a method for delivering a marketing benefit, as shown in fig. 1, including:
step S102, marketing benefits are grouped based on the number of target user groups of the marketing benefits, each user of the target user groups corresponds to one marketing benefit group, and any two marketing benefits in the marketing benefit groups with the marketing benefits being more than 1 are mutually exclusive;
for step S102:
marketing benefits are benefits offered to users in marketing campaigns, such as cash packs, rebate packs, coupons, discount coupons, and the like, which are common in online purchases. The utilization rate determines whether the user approves the marketing rights and benefits, and the value of the marketing rights and benefits to the user can be presented.
The target user group contains the promotion object that the user is the marketing campaign. This step may determine a marketing equity group for each user of the target group of users, and the marketing equity group for each user may include marketing equities depending on marketing strategies to include all kinds of marketing equities, and may include some kinds of marketing equities.
As an exemplary introduction, assume that the target user group includes user 1, user 2, and user 3, and the marketing rights and interests of this marketing campaign are ABC.
If the number of each marketing equity is set to infinity, then the marketing equity groups of user 1, user 2, and user 3 may each include three marketing equity ABC;
if the number of each marketing right is set to be a preset value and the number of different marketing rights is the same or different, the number of marketing rights obtained by the user should not exceed the preset value.
For example, the number of marketing rights A is only two, the number of marketing rights B is only one, and the number of marketing rights C is three;
then, as one of the possible implementations, the marketing rights grouping for user 1 may include: marketing equity a, marketing equity C, the marketing equity grouping of user 2 may include: marketing equity C, the marketing equity group of user 3 may include marketing equity a, marketing equity B, marketing equity C;
or the marketing rights grouping of user 1 may include: marketing equity a and marketing equity C, the marketing equity grouping of user 2 may include: marketing equity B and marketing equity C, the marketing equity group of user 3 may include marketing equity a and marketing equity C.
Since the manner is not unique, the description is not repeated here.
Step S104, based on the upper limit of the marketing cost of the target user group and the predicted branch rate corresponding to each marketing equity, selecting the target marketing equity matched with the user from the marketing equity group corresponding to each user according to the strategy of the maximum total branch rate of the target user group.
For step S104:
each marketing benefit corresponds to a respective marketing cost, and in general, the higher the marketing cost of a marketing benefit, the greater the benefit to the user and the higher the corresponding equity. However, the marketing cost of the target user group is limited, and the step is to maximize the total utilization rate of the target user group and ensure the marketing benefit of the marketing activity for each user in the target user group on the premise that the marketing cost of the target user group is not exceeded.
Specifically, this step may be based on a packet knapsack algorithm to select matching target marketing rights for a plurality of users from a plurality of candidate marketing rights, respectively.
The packet backpack algorithm refers to a backpack that assumes N items and a capacity V. The cost of the i-th item is ci and the value is wi. The items are divided into groups, with the items in each group conflicting with each other, at most one piece. Solving which items to load into the backpack allows the sum of the costs of these items to be no more than the backpack capacity and the sum of the values to be maximized.
According to the definition, the marketing rights and interests can be used as articles (the number of the articles is infinity or a preset value) in the grouped knapsack algorithm, the marketing cost of the marketing rights and interests is used as the cost in the grouped knapsack algorithm, the predicted support rate corresponding to the marketing rights and interests is used as the price in the grouped knapsack algorithm, the upper limit of the marketing cost of the target user group is used as the knapsack capacity in the grouped knapsack algorithm, and the target marketing rights and interests corresponding to each user in the target user group are solved through the knapsack grouping algorithm.
Step S106, the matched target marketing interests are respectively put in the users in the target user group.
For step 106:
as shown in fig. 2, a targeted marketing benefit may be delivered to a user based on a delivery time decision after a delivery trigger event occurs. The delivery mode is not unique, and as an exemplary introduction, a passive delivery channel, such as a short message, a push, a card, a corner mark, a waist seal, a benefit payment mode and the like, can be used for delivering the target marketing benefits; or an active delivery channel, such as a home page screen flicking mode, can be used for delivering the target marketing benefits.
According to the method for delivering the high-count marketing benefits, the marketing benefits of the high-count utilization rate are delivered individually for different users on the premise that the marketing cost upper limit of the target user group is not exceeded, and the maximized marketing benefits are achieved. Because the upper limit of the marketing cost of the target user group is used as a constraint condition of delivery, the formation of a similar linear mathematical relationship between the marketing cost and the predicted branch rate is avoided, and therefore, in practical application, the weight parameters do not need to be additionally configured for the target user group and the predicted branch rate, and the marketing cost of a marketing activity is determined, so that the marketing cost of different users can be matched with the proper marketing rights.
The application can evaluate the branching behavior of all users on the marketing rights based on the branching data of the historical marketing events so as to obtain the predicted branching rate corresponding to the marketing rights.
As an exemplary introduction, the embodiment of the present application may construct a support model, and when executing step S104, the marketing benefits and the user portrait data of the users in the target user group may be input to a preset support model, so as to obtain the predicted support rate corresponding to the marketing benefits output by the support model.
The branch model is trained based on training sample data, wherein the training sample data can be marked historical marketing events, and the marked historical marketing events comprise user image features and marketing event features. In the training process, the user portrait features and the marketing event features are integrated to be used as feature vectors of the support model. And training the branch model through the marked training sample data to determine the branch weight of the feature vector on the marketing benefits put on the marketing event.
The predicted branch utilization rate of the marketing rights calculated by the trained branch model is related to the marketing event and the factors of the user, so that the method has higher accuracy.
The construction of the support model is described in an exemplary manner in connection with one implementation.
As shown in FIG. 3, the embodiment of the application can firstly establish a deep learning FTRL (Single-machine Single-thread running program) model, and the neural network structure schematic diagram of the model is shown in FIG. 3, and the model comprises an upper function and an embedded layer.
The embedded low-dimensional feature vector may be integrated from, but is not limited to, a user identity portrait feature, a user property portrait feature, a user credit use portrait feature, a marketing event time feature, a marketing event frequency feature, and a marketing equity feature.
The user identity portrayal feature may be user basic information such as age, gender, education, family, religion, occupation, etc.
The user property portrayal feature may be a user's financial information such as savings, consumption, investment, insurance, etc.
The credit use portrait features of the user are information of the loan of the user, such as the bar, the flower bar, the financial lever, the house loan and the like.
The marketing event time characteristic may be a time of release of the marketing event, such as a day of the week, a day of the month, a month of the year, a holiday, a workday, or a time interval and a frequency of release of the marketing event (such as a real-time frequency of the marketing event and an offline frequency of the marketing event), etc.
The marketing event frequency characteristic may be a frequency of placement of marketing events, such as frequent marketing events or intermittent marketing events, and the like.
The marketing equity feature may be a marketing equity related feature such as equity name, content, category, delivery channel, etc.
After the feature vector of the FTRL model is determined, the branch model may be trained based on the training sample data to determine a weight value of the feature vector.
In order to avoid larger deviation between the expected branch rate of the marketing equity determined by the branch model and the actual branch rate of the marketing equity, the embodiment of the application can take the average value of the marketing equity aiming at all training sample data as the predicted branch rate of the marketing equity.
Meanwhile, the accuracy of the support model can be further verified. For example, prior to performing step 104, the test sample data support model is used to perform a test, and the accuracy of the support model is evaluated based on the test result (e.g., an indicator of the area under the AUC curve of the test result) to adjust the parameters of the support model.
As an exemplary introduction, the embodiment of the application can judge whether the branch model is fitted or not based on the accuracy of the test result and the accuracy of the training result obtained after the branch model is trained;
if the accuracy of the training result is higher than that of the test result and the difference value of the training result and the test result exceeds or is equal to a preset threshold value, the test result and the training result are proved to have larger deviation, and the fact that the branch model is fitted is confirmed. At this time, the support model needs to be adjusted to reduce the error of the over-fitting.
Specifically, the present embodiment may solve the overfitting problem in the following manner:
mode one:
and removing the feature vector of the branch model, the occurrence number of which is smaller than or equal to a preset threshold value, in the training sample data, and then training the branch model again based on the training sample data.
The neural network structure of the support model can be simplified, and the problem that the support model is fitted after training due to excessive complexity of the internal neural network structure is avoided.
Mode two:
based on priori knowledge, regularization is performed on the partial feature vectors of the support model (for example, the weights of the partial feature vectors of the support model are directly determined by adopting an L1 regularization method or an L2 regularization method). The training model is then retrained based on the training sample data.
In the second mode, the regularized feature vector is used as a constraint condition for retraining the support model, so that an error function used for training is more prone to selecting a gradient reduction direction meeting the constraint, the training effect of the support model is finally enabled to be closer to priori knowledge, and the problem of over fitting after training is avoided.
Mode three:
retraining the branch model according to a dropout strategy based on training sample data;
in the third mode, under the dropout strategy, the feature vectors of the support model are randomly activated in each training round, so that the influence among the feature vectors in the training process is eliminated to a certain extent, and the support model reduces the fitting error after retraining.
Mode four:
and after the training times are adjusted, retraining the support model based on training sample data.
In general, training can be stopped when the model accuracy cannot be effectively improved after training. Through multiple practices, the optimization benefit starts to be obviously reduced when the training times reach 1.5-2 times of the number of the training sample data, so that the adjusted training times are preferably not more than 1.5-2 times of the number of the training sample data.
The fourth mode can avoid that excessive training aggravates errors caused by fitting.
In addition, the embodiment can also perform offline evaluation on the utilization rate based on the offline evaluation sample data, and optimize parameters of the utilization model according to the offline evaluation result. Since the offline evaluation and the test evaluation principle are the same, the description thereof will not be repeated here.
And after the supporting model is finally constructed, the predicted supporting rate of the marketing rights and interests can be obtained through the supporting model.
And then, selecting a target marketing benefit matched with the user from the marketing benefit groups corresponding to each user by adopting a grouping knapsack algorithm.
By way of exemplary introduction, assuming a total number of users of M, a category of marketing equity of K, a total marketing equity of N, a number of $n per marketing equity regardless of marketing equity inventory i (i=1, 2, … …, K) infinity, cost per equity c i (i=1,2,……,K)。
Based on the principle of packet knapsack, users can be divided into M groups, namely each user is regarded as a packet, and each packet contains all kinds of marketing rights, namely K different kinds of marketing rights. Then the packet in the packet knapsack algorithm, i.e. user, the item in each packet, i.e. prize (marketing equity), the value of the item in each packet is pij (the rate of the user i corresponding to the marketing equity j), if the upper limit of the average marketing cost of the user is C, the total knapsack capacity is C x M, and if the marketing equity is chosen as x ij (whether user i corresponds to marketing equity j selected);
according to the formulaThe target marketing rights of each user can be obtained.
Wherein, based on the definition of the packet backpack, the above formula needs to obey the following constraints:
the above is an introduction to the delivery method of the present embodiment. It should be noted that, in the embodiment, the deep learning method for branch rate prediction may be replaced by other branch models, so long as the regression models considering the user features and the marketing benefit features of the same dimension can make the prediction in principle, the only difference is the accuracy and stability of the deep model in the big data scene, and the prediction results of the branch models may be the scheme of the embodiment of the present application.
Corresponding to the above method for delivering the marketing rights, as shown in fig. 4, the embodiment of the present application further provides a device 400 for delivering the marketing rights, including:
the grouping module 41 groups the marketing interests based on the number of target user groups of the marketing interests, wherein each user of the target user groups corresponds to one marketing interest group, and any two marketing interests in the marketing interest groups with the marketing interests greater than 1 are mutually exclusive;
a selection module 42, based on the upper limit of the marketing cost of the target user group and the predicted branch rate corresponding to each marketing equity, for selecting a target marketing equity matched with the user from the marketing equity group corresponding to each user according to a policy that the total branch rate of the target user group is the largest;
and the delivering module 43 is used for delivering the matched target marketing rights to the users in the target user group respectively.
The throwing device provided by the embodiment of the application can individually throw the marketing benefits with high utilization rate for different users on the premise of not exceeding the upper limit of the marketing cost, thereby realizing the maximized marketing benefits. Because the upper limit of the marketing cost is used as a constraint condition of release, a similar linear mathematical relationship is avoided between the marketing cost and the predicted branch rate, so that in practical application, the weight parameters are not required to be additionally configured for the upper limit and the predicted branch rate, and the marketing cost of a marketing activity is determined, so that the marketing cost is matched with the proper marketing rights and interests for different users.
The selection module 42 specifically uses the marketing rights as the items in the knapsack algorithm, uses the marketing cost of the marketing rights as the cost in the knapsack algorithm, uses the predicted utilization rate corresponding to the marketing rights as the price in the knapsack algorithm, uses the upper limit of the marketing cost of the target user group as the knapsack capacity in the knapsack algorithm, and solves the target marketing rights corresponding to each user in the target user group through the knapsack grouping algorithm.
Wherein the number of each marketing equity is set to infinity; or, the number of each marketing right is set to be a preset value, and the number of different marketing rights is the same or different.
Optionally, the selection module 42 is further configured to: and inputting the user portrait data of the users in the marketing rights and the target user group into a preset support model to obtain the predicted support rate corresponding to the marketing rights.
Optionally, the support model is trained based on training sample data comprising user image features and marketing event features.
Wherein, the user portrait features include: user identity portrayal features, user property portrayal features, user credit usage portrayal features;
the marketing event feature comprises: marketing event time characteristics and marketing event frequency characteristics.
Optionally, the throwing device of the embodiment of the present application further includes:
the test module is used for inputting test sample data into the support model to obtain a test result;
the judging module is used for judging whether the branch model is fitted or not based on the accuracy of the test result and the accuracy of a training result obtained after the branch model is trained;
and the training module retrains the branch model if the branch model is fitted so as to reduce the error of the fit of the branch model.
The training module specifically comprises any of the following units:
the first training unit is used for removing feature vectors of which the occurrence times of the branch model in training sample data are smaller than or equal to a preset threshold value, and then retraining the branch model based on the training sample data.
And the second training unit is used for regularizing part of the feature vectors of the branch model, and then retraining the branch model based on training sample data.
The third training unit is used for retraining the branch model according to a dropout strategy based on training sample data; under the dropout strategy, the feature vector of the support model is randomly activated in each training round.
Obviously, the throwing device of the embodiment of the application can be used as an execution main body of the throwing method of the marketing rights, so that the technical effect achieved by the throwing method can be achieved, and the throwing device of the embodiment of the application can be achieved as well. For example, the delivery device of the embodiment of the present application may implement the functions of the delivery method shown in fig. 1 to 3.
Fig. 5 is a schematic structural view of an electronic device according to an embodiment of the present application. Referring to fig. 5, at the hardware level, the electronic device includes a processor, and optionally an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, network interface, and memory may be interconnected by an internal bus, which may be an ISA (Industry Standard Architecture ) bus, a PCI (Peripheral Component Interconnect, peripheral component interconnect standard) bus, or EISA (Extended Industry Standard Architecture ) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 5, but not only one bus or type of bus.
And the memory is used for storing programs. In particular, the program may include program code including computer-operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.
The processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs the computer program to form the multimedia playing device on a logic level. The processor is used for executing the programs stored in the memory and is specifically used for executing the following operations:
grouping the marketing interests based on the number of target user groups of the marketing interests, wherein each user of the target user groups corresponds to one marketing interest group, and any two marketing interests in the marketing interest groups with the marketing interests greater than 1 are mutually exclusive;
selecting a target marketing benefit matched with the user from a marketing benefit group corresponding to each user according to a strategy of maximum total branching rate of the target user group based on the upper limit of marketing cost of the target user group and the predicted branching rate corresponding to each marketing benefit;
and respectively throwing matched target marketing benefits to users in the target user group.
The method performed by the electronic device disclosed in the embodiment of fig. 1 of the present application may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.
The electronic device may also execute the method of fig. 1 and implement the functions of the delivery device in the embodiments shown in fig. 1-3, and the embodiments of the present application are not described herein again.
Of course, other implementations, such as a logic device or a combination of hardware and software, are not excluded from the electronic device of the present application, that is, the execution subject of the following processing flows is not limited to each logic unit, but may be hardware or a logic device.
The embodiments of the present application also provide a computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable electronic device comprising a plurality of application programs, enable the portable electronic device to perform the method of the embodiment of fig. 1, and in particular to perform the operations of:
grouping the marketing interests based on the number of target user groups of the marketing interests, wherein each user of the target user groups corresponds to one marketing interest group, and any two marketing interests in the marketing interest groups with the marketing interests greater than 1 are mutually exclusive;
selecting a target marketing benefit matched with the user from a marketing benefit group corresponding to each user according to a strategy of maximum total branching rate of the target user group based on the upper limit of marketing cost of the target user group and the predicted branching rate corresponding to each marketing benefit;
and respectively throwing matched target marketing benefits to users in the target user group.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should be understood that when the computer program in the computer readable storage medium of the embodiment of the present application is executed by the processor, the method of delivering shown in fig. 1 can be implemented, and the functions of the delivering device shown in fig. 1 to 3 are implemented, which will not be described herein.
In summary, the foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.