IP Library Granted Patent US 10,171,409
Granted Patent B2
US 10,171,409 · App. 14/934,438 · Granted Jan 1, 2019

Systems and methods for path optimization in a message campaign

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,171,409
App. No.
14/934,438
Granted
Jan 1, 2019
Kind
B2
Abstract

A method is provided for path optimization for a message campaign. A graphical user interface representation of the message campaign is displayed. Sets of input instructions are received. Each set of input instructions corresponds to a path in the message campaign. The sets of input instructions are executed, causing different electronic messages to be sent according to corresponding paths to different destination targets. Responses are monitored. A winning path is then determined based on a correlation of a criterion with a goal for the message campaign and also the responses or results of executing the plurality of sets of input instructions. The winning path from among the plurality of paths is then upweighted. The message campaign then uses the upweighted winning path by causing a second plurality of electronic messages to be sent through the winning path to destination targets in the plurality of destination targets.

Claims (43)

1. A method for path optimization for a message campaign, the method being performed by one or more processors, the method comprising:

displaying a graphical user interface representation of the message campaign, wherein the message campaign is electronically connected to one or more sources of destination target information, the one or more sources of destination target information collectively defining a plurality of recipients;

receiving a plurality of sets of input instructions, each respective set of input instructions in the plurality of sets of input instructions corresponding to a path in a plurality of paths in the message campaign, wherein, each path defines non-content characteristics of the message campaign according to which associated messages are sent, including: type, quantity, means for sending, recipient, and at least one of interval, order and frequency;

the plurality of paths in the message campaign including:

a first path specifying that a first subset comprising one or more electronic messages is to be sent following a delay of a first predefined wait period to a first subset of recipients, wherein the first subset of recipients includes two or more recipients; and

a second path specifying that a second subset comprising one or more electronic messages is to be sent following a delay of a second predefined wait period, different from the first predefined wait period, to a second subset of recipients, different from the first subset of recipients, wherein the second subset of recipients includes two or more recipients;

for each respective set of input instructions in the plurality of sets of input instructions, sending a respective subset of electronic messages in a first plurality of electronic messages according to a corresponding path in the plurality of paths to a respective subset of recipients in the plurality of recipients, including sending the first subset comprising one or more electronic messages to the first subset of recipients following the delay of the first predefined wait period and sending the second subset of electronic messages to the second subset of recipients following the delay of the second predefined wait period;

monitoring responses to the first subset comprising one or more electronic messages;

determining a winning path from among the plurality of paths based on a path discriminator, the path discriminator using:

i) a correlation of a criterion with a goal for the message campaign for each respective set of input instructions in the plurality of sets of input instructions, and

ii) the responses to the first subset comprising one or more electronic messages;

upweighting, responsive to the determining, the winning path from among the plurality of paths; and

using the message campaign with the upweighted winning path by causing a second plurality of electronic messages to be sent through the winning path to recipients in the plurality of recipients.

2. The method of claim 1 , wherein a respective path in the plurality of paths comprises a plurality of steps and one or more input nodes, wherein an input node in the one or more input nodes corresponds to a step in the plurality of steps.

3. The method of claim 1 , wherein determining the winning path is performed without human intervention.

4. The method of claim 1 , wherein a respective path in the plurality of paths comprises a subpath branching from a decision block.

5. The method of claim 1 , wherein the graphical user interface representation includes a drag and drop capability for receiving a respective set of input instructions in the plurality of sets of input instructions.

6. The method of claim 1 , wherein the graphical user interface representation includes a configuration screen.

7. The method of claim 1 , further including receiving, via the graphical user interface, an override input that overrides the winning path of the determining step with a manually-selected path in the plurality of paths that is designated by the override input.

8. The method of claim 1 , wherein determining the winning path includes comparing a number of user clicks, opens, or conversions uniquely associated with each path in the plurality of paths.

9. The method of claim 1 , wherein determining the winning path requires a number of responses that exceeds a predetermined sample size threshold.

10. The method of claim 1 , further comprising selecting a new winning path from among the plurality of paths by repeating, at a later time, the sending, monitoring, determining and upweighting steps.

11. The method of claim 1 , wherein upweighting the winning path causes a path in the plurality of paths other than the winning path to not be implemented in the message campaign during the using step.

12. The method of claim 1 , wherein upweighting the winning path causes the winning path to be used more often in the using step than a path in the plurality of paths that is not the winning path and wherein the path that is not the winning path is used in the using step for a portion of the electronic messages in the second plurality of electronic messages.

13. The method of claim 1 , wherein an electronic message in the first plurality of messages is an E-mail message.

14. The method of claim 1 , wherein the one or more sources of destination target information comprise a database, a spreadsheet, or a web service feed.

15. A computer system for performing path optimization for a message campaign, the computer system comprising a processor and a memory, the memory comprising instructions executable by the processor for:

displaying a graphical user interface representation of the message campaign, wherein the message campaign is electronically connected to one or more sources of destination target information, the one or more sources of destination target information collectively defining a plurality recipients;

receiving a plurality of sets of input instructions, each respective set of input instructions in the plurality of sets of input instructions corresponding to a path in a plurality of paths in the message campaign, wherein, each path defines non-content characteristics of the message campaign according to which associated messages are sent, including: type, quantity, means for sending, recipient, and at least one of interval, order and frequency;

the plurality of paths in the message campaign including:

a first path specifying that a first subset comprising one or more electronic messages is to be sent following a delay of a first predefined wait period to a first subset of recipients, wherein the first subset of recipients includes two or more recipients; and

a second path specifying that a second subset comprising one or more electronic messages is to be sent following a delay of a second predefined wait period, different from the first predefined wait period, to a second subset of recipients, different from the first subset of recipients, wherein the second subset of recipients includes two or more recipients;

for each respective set of input instructions in the plurality of sets of input instructions, sending a respective subset of electronic messages in a first plurality of electronic messages according to a corresponding path in the plurality of paths to a respective subset of recipients in the plurality of recipients, including sending the first subset comprising one or more electronic messages to the first subset of recipients following the delay of the first predefined wait period and sending the second subset of electronic messages to the second subset of recipients following the delay of the second predefined wait period;

monitoring responses to the first subset comprising one or more electronic messages; determining a winning path from among the plurality of paths based on a path discriminator, the path discriminator using:

i) a correlation of a criterion with a goal for the message campaign for each respective set of input instructions in the plurality of sets of input instructions, and

ii) the responses to the first subset comprising one or more electronic messages;

upweighting, responsive to the determining, the winning path from among the plurality of paths; and

using the message campaign with the upweighted winning path by causing a second plurality of electronic messages to be sent through the winning path to recipients in the plurality of recipients.

16. The computer system of claim 15 , wherein a respective path in the plurality of paths comprises a plurality of steps and one or more input nodes, wherein an input node in the one or more input nodes corresponds to a step in the plurality of steps.

17. The computer system of claim 15 , wherein determining the winning path is performed without human intervention.

18. The computer system of claim 15 , wherein a respective path in the plurality of paths comprises a subpath branching from a decision block.

19. The computer system of claim 15 , wherein the graphical user interface representation includes a drag and drop capability for receiving a respective set of input instructions in the plurality of sets of input instructions.

20. The computer system of claim 15 , wherein the graphical user interface representation includes a configuration screen.

Assignments (10)
RELEASE OF SECURITY INTEREST Recorded Dec 1, 2025
From: HERCULES CAPITAL, INC.
To: SELLIGENT, INC.
Reel/Frame 073067/0468 →
TERMINATION AND RELEASE OF PATENT SECURITY AGREEMENT RECORDED AT REEL 59280, FRAME 0669 Recorded Dec 1, 2025
From: BARINGS FINANCE LLC
To: SELLIGENT, INC.
Reel/Frame 073840/0046 →
SECURITY INTEREST Recorded Mar 16, 2022
From: SELLIGENT, INC.
To: BARINGS FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 059280/0669 →
SECURITY INTEREST Recorded Jan 13, 2021
From: SELLIGENT, INC.
To: HERCULES CAPITAL, INC., COLLATERAL AGENT
Reel/Frame 054906/0001 →
RELEASE OF SECURITY INTEREST Recorded Nov 4, 2020
From: AB PRIVATE CREDIT INVESTORS LLC
To: SELLIGENT, INC.
Reel/Frame 054270/0584 →
SECURITY INTEREST Recorded May 23, 2019
From: SELLIGENT, INC.
To: AB PRIVATE CREDIT INVESTORS LLC, AS COLLATERAL AGENT
Reel/Frame 049262/0549 →
CHANGE OF NAME Recorded Sep 20, 2018
From: STRONGMAIL SYSTEMS, INC.
To: STRONGVIEW SYSTEMS, INC.
Reel/Frame 047119/0560 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2018
From: VISHWANATHAN, SHRIRAM
To: SELLIGENT, INC.
Reel/Frame 047119/0617 →
CHANGE OF NAME Recorded Sep 20, 2018
From: STRONGVIEW SYSTEMS, INC.
To: SELLIGENT, INC.
Reel/Frame 047570/0222 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2018
From: MAYALA, TULSI RAM
To: STRONGMAIL SYSTEMS, INC.
Reel/Frame 046932/0075 →