Utilizing a genetic algorithm in applying objective functions to determine distribution times for electronic communications

US11645542B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11645542-B2
Application numberUS-201916384558-A
CountryUS
Kind codeB2
Filing dateApr 15, 2019
Priority dateApr 15, 2019
Publication dateMay 9, 2023
Grant dateMay 9, 2023

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

The present disclosure relates to systems, methods, and non-transitory computer readable media for generating a target distribution schedule for providing electronic communications based on predicted behavior rates by utilizing a genetic algorithm and one or more objective functions. For example, the disclosed systems can generate predicted behavior rates by training and utilizing one or more behavior prediction models. Based on the predicted behavior rates, the disclosed systems can further utilize a genetic algorithm to apply objective functions to generate one or more candidate distribution schedules. In accordance with the genetic algorithm, the disclosed systems can select a target distribution schedule for a particular user/client device. The disclosed systems can thus provide one or more electronic communications to individual users based on respective target distribution schedules.

First claim

Opening claim text (preview).

What is claimed is: 1. In a digital medium environment for distributing electronic communications across computer networks, a computer-implemented method of determining electronic message send times for individual recipient devices, the computer-implemented method comprising: determining, by at least one processor for a user over a target time horizon and based on previously distributed electronic communications, a predicted open rate using an open behavior machine learning model trained to predict open rates, a predicted click rate using a click behavior machine learning model trained to predict click rates, and a predicted fatigue rate using a fatigue behavior machine learning model trained to predict fatigue rates; utilizing a genetic algorithm by the at least one processor to generate, based on the predicted open rate, the predicted click rate, and the predicted fatigue rate, a distribution schedule for providing electronic communications to the user by: determining, by the at least one processor utilizing an objective function in relation to the predicted open rate, the predicted click rate, and the predicted fatigue rate, a set of candidate distribution schedules; generating, by the at least one processor, a modified set of candidate distribution schedules by adding at least one of a crossover distribution schedule or a mutation distribution schedule to the set of candidate distribution schedules; and selecting, by the at least one processor, a target distribution schedule from the modified set of candidate distribution schedules based on the objective function; and providing an electronic communication for display within a user interface on a client device associated with the user based on the target distribution schedule. 2. The computer-implemented method of claim 1 , further comprising receiving input from an administrator device to set the target time horizon and the objective function utilized by the genetic algorithm. 3. The computer-implemented method of claim 1 , wherein the objective function utilized by the genetic algorithm comprises at least one of: a rate maximization objective function, an open rate decay objective function, or a threshold interaction probability objective function. 4. The computer-implemented method of claim 1 , wherein the open behavior machine learning model, the click behavior machine learning model, and the fatigue behavior machine learning model are each trained based on historical user behavior in relation to the previously distributed electronic communications. 5. The computer-implemented method of claim 1 , wherein the distribution schedule comprises a plurality of individual distribution times for providing the electronic communication and further comprises, for each of the plurality of individual distribution times, an indication of whether to provide the electronic communication. 6. A non-transitory computer readable medium comprising instructions that, when executed by at least one processor, cause a computer device to: determine, by the at least one processor for a user over a target time horizon and based on previously distributed electronic communications, a predicted open rate using an open behavior machine learning model trained to predict open rates, a predicted click rate using a click behavior machine learning model trained to predict click rates, and a predicted fatigue rate using a fatigue behavior machine learning model trained to predict fatigue rates; utilize a genetic algorithm by the at least one processor to generate, based on the predicted open rate, the predicted click rate, and the predicted fatigue rate, a distribution schedule for providing electronic communications to the user by: determining, by the at least one processor utilizing an objective function in relation to the predicted open rate, the predicted click rate, and the predicted fatigue rate, a set of candidate distribution schedules; generating, by the at least one processor, a modified set of candidate distribution schedules by adding at least one of a crossover distribution schedule or a mutation distribution schedule to the set of candidate distribution schedules; and selecting, by the at least one processor, a target distribution schedule from the modified set of candidate distribution schedules based on the objective function; and provide an electronic communication for display within a user interface on a client device associated with the user based on the target distribution schedule. 7. The non-transitory computer readable medium of claim 6 , further comprising instructions that, when executed by the at least one processor, cause the computer device to generate the crossover distribution schedule by combining two candidate distribution schedules from the set of candidate distribution schedules. 8. The non-transitory computer readable medium of claim 6 , further comprising instructions that, when executed by the at least one processor, cause the computer device to generate the mutation distribution schedule by modifying a candidate distribution schedule from the set of candidate distribution schedules. 9. The non-transitory computer readable medium of claim 6 , further comprising instructions that, when executed by the at least one processor, cause the computer device to utilize a fitness function comprising the objective function to select the set of candidate distribution schedules from among a plurality of candidate distribution schedules in accordance with one or more distribution parameters. 10. The non-transitory computer readable medium of claim 6 , further comprising instructions that, when executed by the at least one processor, cause the computer device to select the target distribution schedule by repeatedly applying the genetic algorithm to generate modified sets of candidate distribution schedules until one or more stop criteria are satisfied. 11. The non-transitory computer readable medium of claim 6 , wherein the objective function comprises one of a rate maximization objective function, an open rate decay objective function, or a threshold interaction probability objective function. 12. The non-transitory computer readable medium of claim 11 , further comprising instructions that, when executed by the at least one processor, cause the computer device to receive an input from an administrator device to select the objective function from among the rate maximization objective function, the open rate decay objective function, or the threshold interaction probability objective function. 13. The non-transitory computer readable medium of claim 11 , wherein: the rate maximization objective function weights the predicted open rate and the predicted click rate to improve the weighted predicted open rate and the weighted predicted click rate over the target time horizon in accordance the predicted fatigue rate; the open rate decay objective function applies an open rate decay to the weighted predicted open rate of the rate maximization objective function; and the threshold interaction probability objective function increases a probability that the user will either open or click a distributed electronic communication a threshold number of times within the target time horizon. 14. A system comprising: a memory device comprising an open behavior machine learning model, a click behavior machine learning model, a fatigue behavior machine learning model, a genetic algorithm, and an objective function; and one or more processors coupled to the memory device, the one or more processors configured to: determine, for a user over a target time horizon and based on previously distributed electronic

Assignees

Inventors

Classifications

  • Convolutional networks [CNN, ConvNet] · CPC title

  • Supervised learning · CPC title

  • Combinations of networks · CPC title

  • G06N3/086Primary

    using evolutionary algorithms, e.g. genetic algorithms or genetic programming · CPC title

  • for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11645542B2 cover?
The present disclosure relates to systems, methods, and non-transitory computer readable media for generating a target distribution schedule for providing electronic communications based on predicted behavior rates by utilizing a genetic algorithm and one or more objective functions. For example, the disclosed systems can generate predicted behavior rates by training and utilizing one or more b…
Who is the assignee on this patent?
Adobe Inc
What technology area does this patent fall under?
Primary CPC classification G06N3/086. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 09 2023 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 7 related publications on this page (citations in our corpus or others sharing the same primary CPC).