Dynamic selection of groups of outbound marketing events
First Claim
1. A database system comprising a computer processor coupled to a computer-readable memory unit, said database system comprising a first database structure storing a first list identifying marketing events and a third list of value scores, a second database structure storing a second list of candidates, a third database structure storing at least one data model, and a database manager software application stored on a computer readable medium, wherein said database manager software application comprises a grouping tool, a computing tool, and an optimization tool, wherein each marketing event from said first list comprises a marketing offer and an identified channel means for communicating said marketing offer, wherein each value score from said third list is associated with a marketing event from said first list, wherein said value scores are associated with an expected profit gain associated with each said marketing offer, and wherein said marketing events from said first list are divided into a first plurality of groups, said memory unit comprising instructions that when executed by the computer processor implements a method comprising:
- applying, by said optimization tool, constraint data to said marketing events, wherein said constraint data comprises first data and second data, wherein said first data consists of an amount of money regarding execution costs for offering said marketing events to a candidate, wherein said second data consists of budgetary data regarding a total budgeted amount allotted for offering all of said marketing events, and wherein said execution costs comprise costs for promotional materials, mailing costs, and telemarketing costs;
receiving, by said computing device, timing constraints associated with offering successive marketing events comprising a same type of marketing offer;
first determining, by said optimization tool in response to said receiving said timing constraints, that said first marketing event of said marketing events comprises a same type of marketing offer as a marketing offer comprised by a second marketing event of said marketing events;
second determining, by said optimization tool in response to said receiving said timing constraints, that a timing conflict exists between offering said first marketing event and offering said second marketing event;
eliminating, by said optimization tool from said first list in response to said first determining and said second determining, said first marketing event;
dividing by said grouping tool, candidates from said second list of candidates into a second plurality of groups;
matching by said grouping tool, a first group from said first plurality of groups with a second group from said second plurality of groups, wherein all candidates from said second group comprise a first specified candidate trait;
computing, by said computing tool, response probability scores for said marketing events from said first group for all of said candidates within said second group, wherein each of said response probability scores are computed using said at least one data model; and
computing by said computing tool, a ranking score for each of said marketing events from said first group for all of said candidates from said second group, wherein each of said ranking scores are computed by multiplying a value score from said third list with an associated response probability score of said response probability scores;
optimizing, by said computer processor, said marketing events from said first group for all of said candidates from said second group, said computer processor executing said optimization tool to perform said optimizing; and
sorting, by said optimization tool, said marketing events from said first group for all of said candidates from said second group, wherein said marketing events from said first group are optimized and sorted for all of said candidates from said second group by optimizing and sorting said ranking scores for each of said marketing events from said from said first group.
1 Assignment
0 Petitions
Accused Products
Abstract
A database system and method for ordering marketing events for offering to candidates. The database system comprises a first database structure storing a first list identifying marketing events, a second database structure storing a second list of candidates, and a database manager software application stored on a computer readable medium. The database manager software application comprises a grouping tool and an optimization tool. The marketing events from the first list are divided into a first plurality of groups. The grouping tool is for dividing candidates from the second list into a second plurality of groups and matching a first group from first plurality of groups with a second group from the second plurality of groups. The optimization tool is for optimizing and sorting the marketing events from the first group for all candidates from the second group.
-
Citations
31 Claims
-
1. A database system comprising a computer processor coupled to a computer-readable memory unit, said database system comprising a first database structure storing a first list identifying marketing events and a third list of value scores, a second database structure storing a second list of candidates, a third database structure storing at least one data model, and a database manager software application stored on a computer readable medium, wherein said database manager software application comprises a grouping tool, a computing tool, and an optimization tool, wherein each marketing event from said first list comprises a marketing offer and an identified channel means for communicating said marketing offer, wherein each value score from said third list is associated with a marketing event from said first list, wherein said value scores are associated with an expected profit gain associated with each said marketing offer, and wherein said marketing events from said first list are divided into a first plurality of groups, said memory unit comprising instructions that when executed by the computer processor implements a method comprising:
-
applying, by said optimization tool, constraint data to said marketing events, wherein said constraint data comprises first data and second data, wherein said first data consists of an amount of money regarding execution costs for offering said marketing events to a candidate, wherein said second data consists of budgetary data regarding a total budgeted amount allotted for offering all of said marketing events, and wherein said execution costs comprise costs for promotional materials, mailing costs, and telemarketing costs; receiving, by said computing device, timing constraints associated with offering successive marketing events comprising a same type of marketing offer; first determining, by said optimization tool in response to said receiving said timing constraints, that said first marketing event of said marketing events comprises a same type of marketing offer as a marketing offer comprised by a second marketing event of said marketing events; second determining, by said optimization tool in response to said receiving said timing constraints, that a timing conflict exists between offering said first marketing event and offering said second marketing event; eliminating, by said optimization tool from said first list in response to said first determining and said second determining, said first marketing event; dividing by said grouping tool, candidates from said second list of candidates into a second plurality of groups; matching by said grouping tool, a first group from said first plurality of groups with a second group from said second plurality of groups, wherein all candidates from said second group comprise a first specified candidate trait; computing, by said computing tool, response probability scores for said marketing events from said first group for all of said candidates within said second group, wherein each of said response probability scores are computed using said at least one data model; and computing by said computing tool, a ranking score for each of said marketing events from said first group for all of said candidates from said second group, wherein each of said ranking scores are computed by multiplying a value score from said third list with an associated response probability score of said response probability scores; optimizing, by said computer processor, said marketing events from said first group for all of said candidates from said second group, said computer processor executing said optimization tool to perform said optimizing; and sorting, by said optimization tool, said marketing events from said first group for all of said candidates from said second group, wherein said marketing events from said first group are optimized and sorted for all of said candidates from said second group by optimizing and sorting said ranking scores for each of said marketing events from said from said first group. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A selection method, comprising:
-
providing a database system comprising a first database structure storing a first list identifying marketing events and a third list of value scores, a second database structure storing a second list of candidates, a third database structure storing at least one data model, and a database manager software application stored on a computer readable medium, wherein said database manager software application comprises a grouping tool, a computing tool, and an optimization tool, wherein each marketing event from said first list comprises a marketing offer and an identified channel means for communicating said marketing offer, wherein each value score from said third list is associated with a marketing event from said first list, wherein said value scores are associated with an expected profit gain associated with each said marketing offer, and wherein said marketing events from said first list are divided into a first plurality of groups; applying, by said optimization tool, constraint data to said marketing events, wherein said constraint data comprises first data and second data, wherein said first data consists of an amount of money regarding execution costs for offering said marketing events to a candidate, wherein said second data consists of budgetary data regarding a total budgeted amount allotted for offering all of said marketing events, and wherein said execution costs comprise costs for promotional materials, mailing costs, and telemarketing costs; receiving, by said computing device, timing constraints associated with offering successive marketing events comprising a same type of marketing offer; first determining, by said optimization tool in response to said receiving said timing constraints, that said a first marketing event of said marketing events comprises a same type of marketing offer as a marketing offer comprised by a second marketing event of said marketing events; second determining, by said optimization tool in response to said receiving said timing constraints, that a timing conflict exists between offering said first marketing event and offering said second marketing event; eliminating, by said optimization tool from said first list in response to said first determining and said second determining, said first marketing event; dividing by said grouping tool, candidates from said second list of candidates into a second plurality of groups; matching by said grouping tool, a first group from said first plurality of groups with a second group from said second plurality of groups, wherein all candidates from said second group comprise a first specified candidate trait; computing, by said computing tool, response probability scores for said marketing events from said first group for all of said candidates within said second group, wherein each of said response probability scores are computed using said at least one data model; and computing by said computing tool, a ranking score for each of said marketing events from said first group for all of said candidates from said second group, wherein each of said ranking scores are computed by multiplying a value score from said third list with an associated response probability score of said response probability scores; optimizing, by a computer processor of said database system, said marketing events from said first group for all of said candidates from said second group, said computer processor executing said optimization tool to perform said optimizing; and sorting, by said optimization tool, said marketing events from said first group for all of said candidates from said second group, wherein said marketing events from said first group are optimized and sorted for all of said candidates from said second group by optimizing and sorting said ranking scores for each of said marketing events from said from said first group. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 31)
-
-
21. A computer-executable program product comprising computer executable instructions tangibly embodied on a computer readable medium that when executed by said computer perform the method steps comprising an algorithm adapted to implement a method for ordering a first list identifying of marketing events within a database system, said database system comprising a first database structure storing said first list identifying marketing events and a third list of value scores, a second database structure storing a second list of candidates, a third database structure storing at least one data model, and a database manager software application stored on a computer readable medium, wherein said database manager software application comprises a grouping tool, a computing tool, and an optimization tool, wherein each marketing event from said first list comprises a marketing offer and an identified channel means for communicating said marketing offer, wherein each value score from said third list is associated with a marketing event from said first list, wherein said value scores are associated with an expected profit gain associated with each said marketing offer, wherein said marketing events from said first list are divided into a first plurality of groups, said method comprising the steps of:
-
applying, by said optimization tool, constraint data to said marketing events, wherein said constraint data comprises first data and second data, wherein said first data consists of an amount of money regarding execution costs for offering said marketing events to a candidate, wherein said second data consists of budgetary data regarding a total budgeted amount allotted for offering all of said marketing events, and wherein said execution costs comprise costs for promotional materials, mailing costs, and telemarketing costs; receiving, by said computing device, timing constraints associated with offering successive marketing events comprising a same type of marketing offer; first determining, by said optimization tool in response to said receiving said timing constraints, that said first marketing event of said marketing events comprises a same type of marketing offer as a marketing offer comprised by a second marketing event of said marketing events; second determining, by said optimization tool in response to said receiving said timing constraints, that a timing conflict exists between offering said first marketing event and offering said second marketing event; eliminating, by said optimization tool from said first list in response to said first determining and said second determining, said first marketing event; dividing by said grouping tool, candidates from said second list of candidates into a second plurality of groups; matching by said grouping tool, a first group from said first plurality of groups with a second group from said second plurality of groups, wherein all candidates from said second group comprise a first specified candidate trait; computing, by said computing tool, response probability scores for said marketing events from said first group for all of said candidates within said second group, wherein each of said response probability scores are computed using said at least one data model; and computing by said computing tool, a ranking score for each of said marketing events from said first group for all of said candidates from said second group, wherein each of said ranking scores are computed by multiplying a value score from said third list with an associated response probability score of said response probability scores; optimizing, by a computer processor of said database system, said marketing events from said first group for all of said candidates from said second group, said computer processor executing said optimization tool to perform said optimizing; and sorting, by said optimization tool, said marketing events from said first group for all of said candidates from said second group, wherein said marketing events from said first group are optimized and sorted for all of said candidates from said second group by optimizing and sorting said ranking scores for each of said marketing events from said from said first group. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification