Predictive communications system

Information

  • Patent Grant
  • 11856140
  • Patent Number
    11,856,140
  • Date Filed
    Monday, March 7, 2022
    2 years ago
  • Date Issued
    Tuesday, December 26, 2023
    5 months ago
Abstract
A computer implemented method and computer system for generating outbound calls in a call center in which a plurality of agents are to communicate respectively with outside parties through the outbound calls. The method includes determining a number of agents available for outbound calls, determining phone numbers respectively corresponding to the outside parties, creating an ordered list of calls corresponding to the phone numbers and periodically generating new call attempts by automatically dialing the phone numbers at a dynamic rate, wherein a number of new call attempts is based on a predictive algorithm.
Description
BACKGROUND

The disclosed technology relates to generating outbound communications from a call center. Call centers are computer systems that connect parties, such as potential customers, to persons or groups of persons, referred to as agents, that are able to assist the party. Customers, or other callers interact with a contact center using voice, email, text, and web interfaces to communicate with agent(s) through a computer network and one or more of text or multimedia channels. The agent(s) may be remote from the contact center and may handle communications with customers on behalf of an enterprise associated with the contact center.


The agent(s) may utilize computing devices, such as workstations, desktop computers, laptops, telephones, a mobile smartphone and/or a tablet. Similarly, customers may communicate using a plurality of devices, including a telephone, a mobile smartphone, a tablet, a laptop, a desktop computer, or other. For example, telephone communication may traverse networks such as a public switched telephone networks (PSTN), Voice over Internet Protocol (VoIP) telephony (via the Internet), a Wide Area Network (WAN) or a Large Area Network. The network types are provided by way of example and are not intended to limit types of networks used for communications.


In some implementations, agents may be assigned to one or more “queues”, and the agents assigned to a queue may handle communications that are placed in the queue by the contact center. For example, there may be queues associated with a language (e.g., English or Chinese), topic (e.g., technical support or billing), or a particular country of origin of the communication. When a communication is received by the contact center, the communication may be placed in a relevant queue, and the communication can be routed to one or more of the agents assigned to the relevant queue to handle the communication.


Further, outbound call campaigns, where the call center proactively contacts outside parties and connects the parties with agents, is a well-known form of telemarketing and/or information gathering. For example, the agents may originate calls to the customers or potential customers and ask survey questions or describe products and services that are for sale. In more sophisticated instances, a list of outbound calls is created and calls on the list are made automatically initiated by the call center computer(s) and, when answered, are routed/connected to an agent in a manner that can be similar to routing of incoming communications. It is desirable to balance the quantity and rate of outgoing calls with the number of available agents in a dynamic manner to minimize both agent idle time and the need to abandon calls when an agent is not available to handle the call. The dynamics of a call center are very difficult to forecast because of the many dynamic, and seemingly random factors that are involved. For example, it is difficult, if not impossible to predict the time that any specific call will take (e.g., the call recipient may have many questions). Therefore, the availability of agents is very dynamic. Further, the same group of agents could be handling incoming calls to the call center contemporaneously with the outgoing calls and/or the agents may be assigned to multiple distinct outgoing call campaigns.


The concept of “predictive modeling”, also known as “predictive analytics”, applies mathematical processes to predict future events or outcomes by analyzing existing patterns that are likely to be indicative of future results. Once historical data indicating previous activity has been collected, it can often be used to train statistical models known as “machine learning models” (ML). Predictive modeling has been used in connection with meteorology and weather forecasting, as well as in many business applications. For example, predictive modeling is often applied in online advertising and marketing to determine what kinds of products users might be interested in, and what they are likely to click on, based on previous activity on the Internet. Predictive modeling has also been used to detect email “spam” and to detect fraudulent activity, such as financial scams.


There are many known predictive analytics methodologies, including logistic regression, time series analysis, decision trees, and neural networks. A neural network is a machine learning model that processes large volumes of labeled data to detect correlations between variables in the data. The algorithm can then be used to make inferences about unlabeled data files that are similar in type to the training data set. Common algorithms for predictive modeling include: Random Forest; Gradient Boosted; K-Means; and Prophet


Various predictive modeling tools, which allow customized predictive models to be created, are well known. These tools include:

    • Sisense
    • Oracle Crystal Ball
    • IBM SPSS Predictive Analytics Enterprise
    • SAS advanced Analytics Predictive modeling considerations


In applying a predictive model, it is critical to define and acquire the correct data and define the workflow of the application in which the model is uses. Further, in outgoing call campaigns, as noted above, there are many unrelated variables, that render the application of learning models difficult and ineffective. For example, it is difficult to apply learning models to the various variables in a pragmatic manner, there is no standard source of quality training datasets For these reasons, predictive modeling has not been effectively applied to outgoing call campaigns.


SUMMARY

Applicants have identified specific parameters of influence, and workflows, in outbound call campaigns for which application of a learning model can be effective to improve the efficiency of call origination and routing in a call campaign computing system. A first disclosed implementation is a computer implemented method for generating outbound calls in a call center in which a plurality of agents are to communicate respectively with outside parties through the outbound calls, the method includes determining a number of agents available for outbound calls, determining phone numbers respectively corresponding to the outside parties, creating an ordered list of calls corresponding to the phone numbers, periodically generating new call attempts by automatically dialing the phone numbers at a dynamic rate, wherein a number of new call attempts is based on a predictive algorithm that includes;

    • (a) selecting a set of N number of calls that are next on the ordered list
    • (b) determinizing corresponding probabilities of pick up for each call in the set of calls;
    • (c) summing the corresponding probabilities of pick up to determine a pick up rate for the set of calls; and
    • (d) launching a number of calls in the set of calls that correspond to the number of available agents; and
    • repeating (a), (b), (c) and (d) until a desired number of calls have been launched.


A second disclosed implementation is a computer system including processors which execute code to accomplish a method of generating outbound calls in a call center in which a plurality of agents are to communicate respectively with outside parties through the outbound calls, the method includes determining a number of agents available for outbound calls, determining phone numbers respectively corresponding to the outside parties, creating an ordered list of calls corresponding to the phone numbers, periodically generating new call attempts by automatically dialing the phone numbers at a dynamic rate, wherein a number of new call attempts is based on a predictive algorithm that includes;

    • (a) selecting a set of N number of calls that are next on the ordered list
    • (b) determinizing corresponding probabilities of pick up for each call in the set of calls;
    • (c) summing the corresponding probabilities of pick up to determine a pick up rate for the set of calls; and
    • (d) launching a number of calls in the set of calls that correspond to the number of available agents; and
    • repeating (a), (b), (c) and (d) until a desired number of calls have been launched.





BRIEF DESCRIPTION OF THE DRAWING

The foregoing summary, as well as the following detailed description of the invention, will be better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there are shown in the drawings various illustrative embodiments. It should be understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown.



FIG. 1 is a schematic illustration of a computer system for pacing outbound calls in a campaign.



FIG. 2 is an architecture and flow diagram of the application of a predictive model for predicting call picked up rate.



FIG. 3 is a graph showing the results of an analysis of the impact of the utilization of predicted values to select records in an outbound call campaign.



FIG. 4 is an architecture and flow diagram of utilization of predicted values to select records in an outbound call campaign.



FIG. 5 is an architecture and flow diagram of utilization of predicted values to allocate agents in an outbound call campaign.



FIG. 6 is an architecture and flow diagram of utilization of predicted values to cancel pending calls in an outbound call campaign.





DETAILED DESCRIPTION

Certain terminology is used in the following description for convenience only and is not limiting. For example, unless specifically set forth herein, the terms “a,” “an” and “the” are not limited to one element but instead should be read as meaning “at least one.” The terminology includes the words noted above, derivatives thereof and words of similar import.


As noted above, in an outbound calling campaign, it is desirable to have an agent ready and waiting when a call is answered by a party. However, it is also desirable to maximize the number of outbound calls per agent, i.e., to minimize agent idle time. To balance these conflicting objectives, it is known to automatically pace outbound calls, in cycles of calls originated, based on the number of currently available agents and historical “picked up rate” that indicates the number of calls that will likely be picked up (i.e. answered by a live voice), as a percentage of calls made for example. However, as noted above, there are a myriad of unrelated dynamic factors in ascertaining the best pacing for an outbound call campaign. As a result, known outbound call campaigns often have a high number of idle agents, and/or answered calls that must be abandoned without connection to an agent.


As noted above, calls of outgoing call campaigns are accomplished in cycles in which a relatively small (with respect to the entire number of calls in the campaign) number of calls are made at one time based on the number of available agents to handle the calls and other parameters (referred to as “features” herein) of the call campaign. For example, it may be desirable that less than 50% of outgoing calls be abandoned by the call center (because there is not available agent when the call is answered, for example). The following formula can be applied to determine the number of calls that should be ringing currently:

    • number_new_attempts=max(number_attempts−number_pending_attempts, 0)
    • number_attempts=floor(min(ceiling(number_agents_available*1.0/pick_up_rate),
    • number_agents_available*MAX_DIALING_RATIO,
    • max(number_agents_available, floor((number_agents_available+allowed_aba)
    • Where:
    • pick_up_rate=total_answered_attempts/total_finished_attempts
    • allowed_abandonment=picked_up_attempts*ABANDONMENT_RATE−total_abandon
    • picked_up_attempts=all attempts where the record answered the call


The following table describes examples of various variables/data structures that can be used in an algorithm to determine a number of new calls for a cycle.













Reference
Description







number_pending_attempts
Number of attempts that are ringing and



waiting either for the customer to pick up,



orfor the agent to connect.


number_agents_available
Number of agents available for



outboundcalls.


pick_up_rate
Current customer pick up rate for a given



window.


total_answered_attempts
Attempts that were answered by a customer.


total_finished_attempts
Total number of attempts finished in a given



window.


MAX_DIALING_RATIO
The maximum dialing ratio per agent. For



predictive, it must be greater than 1 so



thatwe can attempt more calls than agents



available.


allowed_abandonment
The number of additional calls an automated



Dialer can originate while respecting the



desired abandonment rates/limits


total_finished_attempts
Total number of attempts finished in a given



window.


ABANDONMENT_RATE
Constant that defines the abandonment rate



for a given time window.


total_abandoned_attempts
The number of times a call center



terminated a call before it was completed.



This may happen where there wasn't an



agent available when the contact answered



the call.









Disclosed implementations leverage Machine Learning models in new ways, and for new applications, to automatically learn from data and improve decision making for outbound call campaigns. For example, applicant has discovered that, by applying Machine Learning models to predict picked up rate, the efficiency of an outbound call campaign can be greatly improved with minimal computing resources. An outbound dialer system possesses large, classified datasets that can be used to train supervised predictive models. For instance, each call of a previous campaign has a corresponding system disposition and possibly a call disposition. Therefore, this data can be used to produce various predictive models to determine, for example, a probability of an individual call being picked-up, a probability of a busy call or a probability of a call being abandoned. Accordingly, these models can provide valuable information for various decisions that are critical to outbound call campaigns such as: calculation of the number of calls; selection and sorting of records; allocation of agents for pending calls; and cancellation of pending calls.



FIG. 1 illustrates an outgoing call campaign system 100 in accordance with disclosed implementations. As will be seen below, system 100 can be applied to originate outbound calls in a campaign in cycles and at a rate that improves efficiency of the campaign. System 100 may include one or more servers 102. Server(s) 102 may be configured to communicate with one or more remote computing platforms 104 according to a client/server architecture and/or other architectures. Users, such as those desiring to configure the features of a call campaign, may access system 100 via client computing platform(s) 104. System 100 can be integrated into a conventional call center architecture.


Server(s) 102 may be configured by machine-readable instructions 106. Machine-readable instructions 106 may include one or more instruction modules. The instruction modules may include computer program modules. The instruction modules may include one or more of agent determination module 108, phone number determination module 110, ordered list access module 112, call attempt module 114, predictive module 116 and/or other instruction modules. For example, modules can be provided for selection and sorting of records; allocation of agents for pending calls; and/or cancellation of pending calls, as described in detail below.


Agent determination module 108 can determine, or otherwise ascertain, a number of agents currently available for outbound calls. Phone number determination module 110 can determine, or otherwise ascertain, phone numbers respectively corresponding to the outside parties to be contacted in an outbound call campaign. Ordered list access module 112 can access an ordered list of calls corresponding to the phone numbers. Call attempt module 114 can periodically generate new call attempts, in cycles, by automatically dialing the phone numbers at a dynamic rate. Predictive module 116 can determine the dynamic rate based on a predictive algorithm that includes;

    • (a) selecting a set of N number of calls that are next on the ordered list
    • (b) determinizing corresponding probabilities of pick up for each call in the set of calls;
    • (c) summing the corresponding probabilities of pick up to determine a pick up rate for the set of calls;
    • (d) launching a number of calls in the set of calls that correspond to the number of available agents; and
    • repeating (a), (b), (c) and (d) until a desired number of calls have been launched.


In some implementations, server(s) 102, remote computing platform(s) 104, and/or external resources 124 may be operatively linked via one or more electronic communication links. For example, such electronic communication links may be established, at least in part, via a network such as the Internet and/or other networks. It will be appreciated that this is not intended to be limiting, and that the scope of this disclosure includes implementations in which server(s) 102, remote computing platform(s) 104, and/or external resources 124 may be operatively linked via some other communication media.


External resources 124 may include sources of information outside of system 100, external entities participating with system 100, and/or other resources. In some implementations, some or all the functionality attributed herein to external resources 124 may be provided by resources included in system 100. For example, external resources can include a database of a call center system. As used herein, the term “module” may refer to any component or set of components that perform the functionality attributed to the module. This may include one or more physical processors during execution of processor readable instructions, the processor readable instructions, circuitry, hardware, storage media, or any other components.



FIG. 2 illustrates the application of a predictive model to improve the calculation of the number of calls in each cycle of an outbound call campaign. The use of a predictive model in this manner allows the number of potentially launched calls in a cycle to be calculated based on the predicted probability of each individual potential call, or a set of calls, being picked-up, not merely an overall percentage of calls that are expected to be picked up. The sum of the predicted probabilities of the potentially launched calls can be matched to the number of available agents to ascertain the number of calls to launch at any particular time. For example, the expected number of picked-up calls should be similar to the expected number of available agents to minimize agent idle time and minimize the number of abandoned calls. This allows the campaign algorithm to look at the calls in the campaign list and determine which specific calls to launch in a cycle based on the number of available agents. As a simple example, if the next four calls on a campaign list have respective probabilities of 10%, 20%, 50%, and 20%, and there is only one available agent, these four calls can be launched and one pickup will be expected (because the summed probability is 100% or 1 call).


The summing of call pickup probabilities can be periodically or continuously accomplished to select the specific calls, and the quantity thereof, to launch at any given time. In other words, the utilization of the predicted picked-up rate based on probabilities of pickup of each call allows improvement of both the average number of picked-up calls per cycle (related with agents' idle time) and the intended abandonment rate when compared with historical picked up rate and maximum dialing ratio. As shown in FIG. 2, a call campaign can be created at creation phase 210 in a conventional manner. Typically, the campaign will define the number of calls to be made the phone numbers to call, the acceptable abandonment rate, and other parameters that specify the campaign characteristics.


At prediction phase 220, a predictive model (any one of various known predictive algorithms can be utilized) is applied to each call, or a subset of calls, in the campaign to assign an individual probability of pick up for each of the calls analyzed by the predictive model. The individual probabilities of pick up can be stored in a database in association with the corresponding calls (e.g., phone numbers). At call launch phase 230, the individual probabilities generated by the predictive model can be applied to launch calls in the campaign in multiple cycles.


In particular, at call launch phase 230, a next number X of call records is read, at step 231, from the database storing the call campaign features. The number X of records can be adjusted in various ways and can be a predetermined fixed integer, such as 100. At step 232, the corresponding predicted pick up probabilities for each of the X calls is read from the database. At step 234, the probabilities are summed and a calculated suggested number of calls to be launched is generated. At 235, the maximum acceptable abandonment rate, the number of currently available agents and other parameters are retrieved, and an allowable number of calls is estimated based on these parameters. At 236 it is determined whether the allowable number of calls is greater than the suggested number of calls and, if so, the calculated suggested calls are launched. If not, the allowable number of calls can be launched step 230 can be repeated with a different value of X until the calculated suggested calls are less that the allowable number of calls.


Since the required latency for each cycle is very reduced, the application of the predictive model may have some tasks executed before each cycle. The predictive model can produce the features some time before in order to facilitate the procedure and to reduce required computing resources. For example, prediction phase 220 can be accomplished at any time if the data, parameters, and assumptions used by the predictive model are not out of date. To make the calculation of the number of calls even faster predicted probabilities can be generated each time the record list or other features of the campaign are updated in order to make predictions available for each cycle. Therefore, it is only necessary to extract the predicted values, and generate a cumulative sum thereof, once for each cycle. However, it may be desirable to have real-time access to the next records in order to produce a more accurate estimate of the number of launched calls.


In another implementation, a predictive model can be applied to provide a more efficient selection of records and thus can avoid the unnecessary launch of many calls that will not be answered. Such a selection may improve the picked-up rate and agents' idle time by reducing the total number of calls with a minimum impact on the number of picked-up calls. Moreover, it allows a more efficient utilization of the resources by minimizing the degradation of caller IDs (e.g., less busy calls) and by making the cycles more productive. The probability of a call being picked-up is a logical criterion for the selection of records for a call campaign cycle. Therefore, those records with a very low probability could be excluded. FIG. 3 shows the results of an analysis of the impact of the utilization of predicted values to select records.


As shown in FIG. 3, the average daily number of calls has a sharp decline at the lowest minimum probability scores while the average daily number of picked-up calls has a minimum impact. This selection allows the system to discard a higher percentage of calls to be launched than the percentage of picked up calls that will be missed. For example, the utilization of 0.2 as a threshold allowed the system to increase the picked up rate from 45.48% to 60.2%.


Sorting records is also a task that could benefit from the utilization of the predictive model. The predicted probabilities of a call being picked-up could be a valuable basis to sort records. For example, if the objective is to schedule the best time to call, prediction can be made for different times and the best schedule can be selected according to these predictions. If the objective is to obtain a less volatile picked-up rate, records can be sorted in order to obtain a smoother distribution of the picked-up rate over time. If the goal is to first launch the calls with the highest probability of being picked-up and leave the ones with the lowest probability to the end, the records can be sorted in descending order according to the predicted probability. FIG. 4 shows the application of a predictive model to improve the selection and sorting of records for an outgoing call campaign.


As shown in FIG. 4, a call campaign can be created at creation phase 410 in a conventional manner. Creation phase 410 can be similar to, or the same as, creation phase 210 in FIG. 2. In predicting phase 420, a predictive model (any one of various known predictive algorithms can be utilized) is applied to each call, or a subset of calls, in the campaign to assign an individual probability of pick up for each of the calls analyzed by the predictive model. Predicting phase 420 can be similar to predicting phase 220 of FIG. 2. As noted above with respect to FIG. 2, the individual probabilities of pick up can be stored in a database in association with the corresponding calls (e.g., phone numbers).


The predictive model used for sorting can be similar to the model applied in the calculation of the number of launched calls as described above. The applied features can also be similar. However, this predictive model should be applied to the complete list of records when it is necessary to select and sort calls for a campaign. Also, this model may be applied for different times when it is necessary to schedule the best time to call. Call records are selected and sorted in sorting phase 430. Sorting phase 430 includes the primary steps of selecting records above a threshold/minimum score at 421 and sorting the records in accordance with objectives of the call campaign at 422. As noted above, the individualized call picked up rate is one metric that can benefit more from the application of learning models. The selection of records allows the system to discard a significant number of calls with minimum impact on picked-up calls. The agents' idle time can also benefit from the improvements made on the picked-up rate.


Agent reservations can be recalculated across cycles to guarantee a “blanket” effect for all dialed records across all campaigns. Campaigns with ongoing dials will have agents reserved for those possible calls. Conventionally, measures such as historical picked-up rate or maximum dialing ratio, which are not the most adequate measures are used for agent reservations. These measures are not ordinarily adjusted to the characteristics of current pending calls (e.g., attempt number, campaign, historical behavior of the customer) and to current ringing time. Thus, the utilization of a predictive model of the probability of a call being picked-up may allow a more effective allocation of agents by producing a more accurate estimate of the number of picked-up calls. Therefore, such an application can improve agents' idle time and abandonment rate by diminishing the difference between picked-up calls and allocated agents. The impact on these metrics are significant when there are more agents (increasing agents' idle time) or less agents (causing more abandonment then necessary).



FIG. 5 illustrates the application of a predictive model to allocate agents for pending calls. The creation of the campaign and the utilization of the predictive model is similar that applied in the calculation of the number of calls. Both share the same features except for the ringing time that is provided in real time. Therefore, the creation of features is shared by both models. Also, the creation of the predictions is done at the same time (whenever a record list or features are updated) and these predictions are applied at each cycle. The prediction is accomplished for each recordID and possible ringing time. These two attributes are the input parameters required to extract predictive probabilities later in each cycle. However, it is necessary to train a different predictive model for this implementation because this application also uses ringing time as a parameter/feature. The implementations described above do not use ringing time because they are applied before each call is launched. Ringing time is used as a feature due to its predictive value and also because we do have this information available in each cycle for each pending call. At 520, the number of allocated agents is calculated based on the predicted probabilities for each ringing time. The utilization of the predictive model to allocate agents can improve intended abandonment and agents' idle time.


When the expected number of picked-up calls is much higher than the expected number of available agents, it is very likely that some of these calls will be abandoned. It would be useful to cancel some of these pending calls to avoid abandonment. The predictive models can also be applied to support the decision to cancel pending calls. Thus, it may be determined how many pending calls should be cancelled based on the predicted number of picked up calls and predicted number of available agents for the same time period. For example, if it is predicted that only one agent will be available, only the set of calls that will have one expected picked up calls can be kept and all the others can be cancelled. To be able to do it, we need a predictive model regarding a pending call being picked up (the same as the one applied to the allocation of agents) and another to predict the number of available agents in a specific time window. The later model could be trained by applying data about agents availability and activity. A predictive model of the number the available agents could be trained by applying data about agents availability and activity. The output should be the expected number of available agents in a specific time window. The predictive model applied in the allocation of agents could be used to estimate the number of picked-upcalls in the same time windows. Based on both predictions, the algorithm would decide which pending call should be canceled. FIG. 6 illustrate the utilization of a predictive model to cancel pending calls. At 620, the number of pending calls that will be picked up is calculated based on the predicted probabilities for each ringing time and other variables. At each cycle, the expected number of picked up calls among pending calls will be calculated based on the extracted predicted probabilities of being picked up and the extracted predicted number of available agents. Then, based on both predictions (expected number of picked up calls and expected number of available agents) it is decided the number of calls to be canceled. Therefore, it should only be kept the set of calls that will have a similar number of picked up calls to the expected number of available agents for the same time window. This improves intended abandonment rate with minimum impact on agents' idle time values.


A predictive model is also very useful to select/exclude calls in a campaign. The picked up rate increases as the applied minimum predicted value to select calls also increases. This selection allows the system to discard a higher percentage of calls to be launched than the percentage of picked up calls that will be missed. For example, the utilization of 0.2 as a threshold increased the picked up rate from 45.48% to 60.2% in experiments conducted by the applicant.


The predictive model is also valuable to produce a more accurate estimate of the picked up rate of the next calls in order to be applied in the calculation of the number of calls to be launched. This estimate adjusts to the variance of real picked up rate and it is substantially more accurate than the existing estimate (historical picked up rate of each campaign). Applicants' experiments resulted in a large improvement in the mean absolute error (from 0.165 to 0.088) and in the root mean squared error (from 0.206 to 0.116).


The utilization of the predicted picked-up rate improves both the average number of picked-up calls per cycle (related with agents' idle time) and the abandonment rate when compared with historical picked up rate and maximum dialing ratio (1, 2 and 3). The only exception is “power dialing”, i.e. dialing a phone number right after a previous call is completed, for the abandonment rate but it has a high cost on the average number of picked up calls per cycle. For example, the median abandonment rate obtained by the historical picked-up rate, maximum dialing ratio 3 and maximum dialing ratio 2 were respectively 2.44, 4.31 and 2.26 times higher than the obtained by the predicted picked-up rate. Despite this large advantage on the abandonment rate, the median average number of picked-up calls per cycle obtained by the predicted picked-up rate was also higher than the median of the historical picked-up rate (+4.3%), maximum dialing ratio 2 (+12.1%) and power dialing (+77%) and very similar to maximum dialing ratio 3 (−1.2%).


It will be appreciated by those skilled in the art that changes could be made to the embodiments described above without departing from the broad inventive concept thereof. It is understood, therefore, that this invention is not limited to the particular embodiments disclosed, but it is intended to cover modifications within the spirit and scope of the present invention as defined by the appended claims.

Claims
  • 1. A computer implemented method for generating outbound calls in a call center in which a plurality of agents are to communicate respectively with outside parties through the outbound calls, the method comprising: determining a number of agents available for outbound calls;determining phone numbers respectively corresponding to the outside parties;creating an ordered list of calls corresponding to the phone numbers;periodically generating new call attempts by automatically dialing the phone numbers at a dynamic rate, wherein a number of new call attempts is based on a predictive algorithm, wherein the predictive algorithm includes: (a) selecting a set of N number of calls that are next on the ordered list(b) determinizing corresponding probabilities of pick up for each call in the set of calls;(c) summing the corresponding probabilities of pick up to determine a pick up rate for the set of calls; and(d) launching a number of calls in the set of calls that correspond to the number of available agents; andrepeating (a), (b), (c) and (d) until a desired number of calls have been launched.
  • 2. The method of claim 1 further comprising, prior to step (d) determining if the picked up rate is too high and if the picked up rate for the set of calls is too high for the number of available agents, returning to step (a) and reducing N.
  • 3. The method of claim 2, wherein the picked up rate is determined to be too high if it results in an abandonment rate that is higher than a predetermined threshold.
  • 4. The method of claim 1, wherein the predictive model is trained to provide a more efficient selection of records to thereby reduce the number of calls that will not be answered.
  • 5. The method of claim 1, wherein the predictive model is trained to sort records to thereby increase efficiency of the call campaign.
  • 6. The method of claim 1, wherein the predictive model is trained to allocate agents for pending calls.
  • 7. The method of claim 1, wherein the predictive model is trained to cancel pending calls that are not likely to served by an agent.
  • 8. The method of claim 1, wherein the predicative model is trained with a data set derived from call disposition records from at least one previous call campaign.
  • 9. The method of claim 8, wherein a number of new call attempts is based on a predictive algorithm which predicts at least one of a probability of an individual call being picked-up, a probability of an individual call being busy, or a probability of an individual call being abandoned.
  • 10. The method of claim 1, wherein creating an ordered list of calls corresponding to the phone numbers includes determining corresponding probabilities of pick up for each call in the set of calls and sorting the records based on the corresponding probabilities.
  • 11. The method of claim 1, wherein creating an ordered list of calls corresponding to the phone numbers includes determining corresponding probabilities of pick up for each call in the set of calls and selecting the records based on the corresponding probabilities.
  • 12. A computer system for generating outbound calls in a call center in which a plurality of agents are to communicate respectively with outside parties through the outbound calls, the method comprising: at least one computer processor; andat least one memory having instructions stored thereon which, when executed by the at least one computer processor, cause the at least one computer processor to carry out a method including: determining a number of agents available for outbound calls;determining phone numbers respectively corresponding to the outside parties;creating an ordered list of calls corresponding to the phone numbers;periodically generating new call attempts by automatically dialing the phone numbers at a dynamic rate, wherein a number of new call attempts is based on a predictive algorithm, wherein the predictive algorithm includes:(a) selecting a set of N number of calls that are next on the ordered list(b) determinizing corresponding probabilities of pick up for each call in the set of calls;(c) summing the corresponding probabilities of pick up to determine a pick up rate for the set of calls; and(d) launching a number of calls in the set of calls that correspond to the number of available agents; andrepeating (a), (b), (c) and (d) until a desired number of calls have been launched.
  • 13. The system of claim 12 further comprising, prior to step (d) determining if the picked up rate is too high and if the picked up rate for the set of calls is too high for the number of available agents, returning to step (a) and reducing N.
  • 14. The system of claim 13, wherein the picked up rate is determined to be too high if it results in an abandonment rate that is higher than a predetermined threshold.
  • 15. The system of claim 12, wherein the predictive model is trained to provide a more efficient selection of records to thereby reduce the number of calls that will not be answered.
  • 16. The system of claim 12, wherein the predictive model is trained to sort records to thereby increase efficiency of the call campaign.
  • 17. The system of claim 12, wherein the predictive model is trained to allocate agents for pending calls.
  • 18. The system of claim 12, wherein the predictive model is trained to cancel pending calls that are not likely to served by an agent.
  • 19. The system of claim 12, wherein the predicative model is trained with a data set derived from call disposition records from at least one previous call campaign.
  • 20. The system of claim 19, wherein a number of new call attempts is based on a predictive algorithm which predicts at least one of a probability of an individual call being picked-up, a probability of an individual call being busy, or a probability of an individual call being abandoned.
  • 21. The method of claim 12, wherein creating an ordered list of calls corresponding to the phone numbers includes determining corresponding probabilities of pick up for each call in the set of calls and sorting the records based on the corresponding probabilities.
  • 22. The method of claim 12, wherein creating an ordered list of calls corresponding to the phone numbers includes determining corresponding probabilities of pick up for each call in the set of calls and selecting the records based on the corresponding probabilities.
US Referenced Citations (633)
Number Name Date Kind
5343518 Kneipp Aug 1994 A
5570419 Cave Oct 1996 A
5862203 Wulkan et al. Jan 1999 A
5897616 Kanevsky et al. Apr 1999 A
5966691 Kibre et al. Oct 1999 A
5970124 Csaszar et al. Oct 1999 A
6100891 Thorne Aug 2000 A
6128415 Hultgren et al. Oct 2000 A
6163607 Bogart et al. Dec 2000 A
6230197 Beck et al. May 2001 B1
6263057 Silverman Jul 2001 B1
6263065 Durinovic-Johri Jul 2001 B1
6345093 Lee et al. Feb 2002 B1
6373938 Palacios Apr 2002 B1
6385584 McAllister et al. May 2002 B1
6411687 Bohacek et al. Jun 2002 B1
6493695 Pickering et al. Dec 2002 B1
6560222 Pounds et al. May 2003 B1
6587831 O'Brien Jul 2003 B1
6639982 Stuart et al. Oct 2003 B1
6721416 Farrell Apr 2004 B1
6754333 Flockhart et al. Jun 2004 B1
6859776 Cohen et al. Feb 2005 B1
6970829 Leamon Nov 2005 B1
7023979 Wu et al. Apr 2006 B1
7076047 Brennan et al. Jul 2006 B1
7110525 Heller et al. Sep 2006 B1
7209475 Shaffer et al. Apr 2007 B1
7274787 Schoeneberger Sep 2007 B1
7292689 Odinak et al. Nov 2007 B2
7343406 Buonanno et al. Mar 2008 B1
7372952 Wu et al. May 2008 B1
7382773 Schoeneberger et al. Jun 2008 B2
7409336 Pak et al. Aug 2008 B2
7426268 Walker et al. Sep 2008 B2
7466334 Baba Dec 2008 B1
7537154 Ramachandran May 2009 B2
7634422 Andre et al. Dec 2009 B1
7657263 Chahrouri Feb 2010 B1
7672746 Hamilton et al. Mar 2010 B1
7672845 Beranek et al. Mar 2010 B2
7676034 Wu et al. Mar 2010 B1
7698163 Reed et al. Apr 2010 B2
7752159 Nelken et al. Jul 2010 B2
7774790 Jirman et al. Aug 2010 B1
7788286 Nourbakhsh et al. Aug 2010 B2
7853006 Fama et al. Dec 2010 B1
7864946 Fama et al. Jan 2011 B1
7869998 Di Fabbrizio et al. Jan 2011 B1
7949123 Flockhart et al. May 2011 B1
7953219 Freedman et al. May 2011 B2
7966369 Briere et al. Jun 2011 B1
8060394 Woodings et al. Nov 2011 B2
8073129 Kalavar Dec 2011 B1
8116446 Kalavar Feb 2012 B1
8135125 Sidhu et al. Mar 2012 B2
8160233 Keren et al. Apr 2012 B2
8184782 Vatland et al. May 2012 B1
8223951 Edelhaus et al. Jul 2012 B1
8229761 Backhaus et al. Jul 2012 B2
8243896 Rae Aug 2012 B1
8300798 Wu et al. Oct 2012 B1
8369338 Peng et al. Feb 2013 B1
8370155 Byrd et al. Feb 2013 B2
8391466 Noble, Jr. Mar 2013 B1
8447279 Peng et al. May 2013 B1
8488769 Noble et al. Jul 2013 B1
8526576 Deich et al. Sep 2013 B1
8535059 Noble, Jr. et al. Sep 2013 B1
8583466 Margulies et al. Nov 2013 B2
8594306 Laredo et al. Nov 2013 B2
8626137 Devitt et al. Jan 2014 B1
8635226 Chang et al. Jan 2014 B2
8644489 Noble et al. Feb 2014 B1
8671020 Morrison et al. Mar 2014 B1
8688557 Rose et al. Apr 2014 B2
8738739 Makar et al. May 2014 B2
8767948 Riahi et al. Jul 2014 B1
8811597 Hackbarth et al. Aug 2014 B1
8861691 De et al. Oct 2014 B1
8869245 Ranganathan et al. Oct 2014 B2
8898219 Ricci Nov 2014 B2
8898290 Siemsgluess Nov 2014 B2
8909693 Frissora et al. Dec 2014 B2
8935172 Noble, Jr. et al. Jan 2015 B1
8995648 Gibbs Mar 2015 B1
8996509 Sundaram Mar 2015 B1
9020142 Kosiba et al. Apr 2015 B2
9026431 Moreno Mengibar et al. May 2015 B1
9060057 Danis Jun 2015 B1
9065915 Lillard et al. Jun 2015 B1
9082094 Etter et al. Jul 2015 B1
9100483 Snedden Aug 2015 B1
9117450 Cook et al. Aug 2015 B2
9123009 Etter et al. Sep 2015 B1
9137366 Medina et al. Sep 2015 B2
9152737 Micali et al. Oct 2015 B1
9160853 Daddi et al. Oct 2015 B1
9178999 Hedge et al. Nov 2015 B1
9185222 Govindarajan et al. Nov 2015 B1
9237232 Williams et al. Jan 2016 B1
9280754 Schwartz et al. Mar 2016 B1
9286413 Coates et al. Mar 2016 B1
9300801 Warford et al. Mar 2016 B1
9319524 Webster Apr 2016 B1
9386152 Riahi et al. Jul 2016 B2
9397985 Seger et al. Jul 2016 B1
9426291 Ouimette et al. Aug 2016 B1
9473637 Venkatapathy et al. Oct 2016 B1
9514463 Grigg et al. Dec 2016 B2
9595049 Showers et al. Mar 2017 B2
9609131 Placiakis et al. Mar 2017 B2
9674361 Ristock et al. Jun 2017 B2
9679265 Schwartz et al. Jun 2017 B1
9774731 Haltom et al. Sep 2017 B1
9787840 Neuer, III et al. Oct 2017 B1
9813495 Van et al. Nov 2017 B1
9813559 Noble, Jr. Nov 2017 B1
9823949 Ristock et al. Nov 2017 B2
9883037 Lewis et al. Jan 2018 B1
9894478 Deluca et al. Feb 2018 B1
9930181 Moran et al. Mar 2018 B1
9955021 Liu et al. Apr 2018 B1
RE46852 Petrovykh May 2018 E
9998596 Dunmire et al. Jun 2018 B1
10009465 Fang et al. Jun 2018 B1
10038788 Khalatian Jul 2018 B1
10044862 Cai et al. Aug 2018 B1
10079939 Bostick et al. Sep 2018 B1
10085073 Ray et al. Sep 2018 B2
10101974 Ristock et al. Oct 2018 B2
10115065 Fama et al. Oct 2018 B1
10135973 Algard et al. Nov 2018 B2
10154138 Te Booij et al. Dec 2018 B2
10194027 Daddi et al. Jan 2019 B1
10235999 Naughton et al. Mar 2019 B1
10241752 Lemay et al. Mar 2019 B2
10242019 Shan et al. Mar 2019 B1
10276170 Gruber et al. Apr 2019 B2
10277745 Araujo et al. Apr 2019 B1
10290017 Traasdahl et al. May 2019 B2
10331402 Spector et al. Jun 2019 B1
10380246 Clark et al. Aug 2019 B2
10440180 Jayapalan et al. Oct 2019 B1
10445742 Prendki et al. Oct 2019 B2
10460728 Anbazhagan et al. Oct 2019 B2
10497361 Rule et al. Dec 2019 B1
10554590 Cabrera-Cordon et al. Feb 2020 B2
10554817 Sullivan et al. Feb 2020 B1
10572879 Hunter et al. Feb 2020 B1
10574822 Sheshaiahgari et al. Feb 2020 B1
10601992 Dwyer et al. Mar 2020 B2
10623572 Copeland Apr 2020 B1
10635973 Dirac et al. Apr 2020 B1
10636425 Naughton et al. Apr 2020 B2
10699303 Ismail et al. Jun 2020 B2
10715648 Vashisht et al. Jul 2020 B1
10718031 Wu et al. Jul 2020 B1
10728384 Channakeshava et al. Jul 2020 B1
10735586 Johnston Aug 2020 B1
10742806 Kotak Aug 2020 B2
10750019 Petrovykh et al. Aug 2020 B1
10783568 Chandra et al. Sep 2020 B1
10789956 Dube Sep 2020 B1
10803865 Naughton et al. Oct 2020 B2
10812654 Wozniak Oct 2020 B2
10812655 Adibi et al. Oct 2020 B1
10827069 Paiva Nov 2020 B1
10827071 Adibi et al. Nov 2020 B1
10839432 Konig et al. Nov 2020 B1
10841425 Langley et al. Nov 2020 B1
10855844 Smith et al. Dec 2020 B1
10861031 Sullivan et al. Dec 2020 B2
10878479 Wu et al. Dec 2020 B2
10943589 Naughton et al. Mar 2021 B2
10970682 Aykin Apr 2021 B1
11017176 Ayers et al. May 2021 B2
11089158 Holland et al. Aug 2021 B1
11425252 Martin Aug 2022 B1
20010008999 Bull Jul 2001 A1
20010024497 Campbell Sep 2001 A1
20010054072 Discolo et al. Dec 2001 A1
20020019737 Stuart et al. Feb 2002 A1
20020029272 Weller Mar 2002 A1
20020034304 Yang Mar 2002 A1
20020038420 Collins et al. Mar 2002 A1
20020067823 Walker et al. Jun 2002 A1
20020143599 Nourbakhsh et al. Oct 2002 A1
20020169664 Walker et al. Nov 2002 A1
20020174182 Wilkinson et al. Nov 2002 A1
20020181689 Rupe et al. Dec 2002 A1
20030007621 Graves et al. Jan 2003 A1
20030009520 Nourbakhsh et al. Jan 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030061068 Curtis Mar 2003 A1
20030112927 Brown et al. Jun 2003 A1
20030126136 Omoigui Jul 2003 A1
20030167167 Gong Sep 2003 A1
20040044585 Franco Mar 2004 A1
20040044664 Cash et al. Mar 2004 A1
20040062364 Dezonno et al. Apr 2004 A1
20040078257 Schweitzer et al. Apr 2004 A1
20040098274 Dezonno et al. May 2004 A1
20040103051 Reed et al. May 2004 A1
20040141508 Schoeneberger et al. Jul 2004 A1
20040162724 Hill et al. Aug 2004 A1
20040162753 Vogel et al. Aug 2004 A1
20040174980 Knott et al. Sep 2004 A1
20040215451 Macleod Oct 2004 A1
20050033957 Enokida Feb 2005 A1
20050043986 McConnell et al. Feb 2005 A1
20050063365 Mathew et al. Mar 2005 A1
20050071178 Beckstrom et al. Mar 2005 A1
20050105712 Williams et al. May 2005 A1
20050177368 Odinak et al. Aug 2005 A1
20050226220 Kilkki et al. Oct 2005 A1
20050228774 Ronnewinkel Oct 2005 A1
20050246511 Willman et al. Nov 2005 A1
20050271198 Chin et al. Dec 2005 A1
20060095575 Sureka et al. May 2006 A1
20060126818 Berger et al. Jun 2006 A1
20060153357 Acharya et al. Jul 2006 A1
20060166669 Claussen Jul 2006 A1
20060188086 Busey et al. Aug 2006 A1
20060209797 Anisimov et al. Sep 2006 A1
20060215831 Knott et al. Sep 2006 A1
20060229931 Fligler et al. Oct 2006 A1
20060256953 Pulaski et al. Nov 2006 A1
20060271361 Vora et al. Nov 2006 A1
20060274856 Dun et al. Dec 2006 A1
20060277108 Altberg et al. Dec 2006 A1
20070011153 Pillai Jan 2007 A1
20070016565 Evans et al. Jan 2007 A1
20070036334 Culbertson et al. Feb 2007 A1
20070038499 Margulies et al. Feb 2007 A1
20070041519 Erhart et al. Feb 2007 A1
20070061183 Seetharaman et al. Mar 2007 A1
20070078725 Koszewski et al. Apr 2007 A1
20070121894 Noble May 2007 A1
20070121902 Stoica et al. May 2007 A1
20070121903 Moore, Jr. et al. May 2007 A1
20070133760 Cotignola Jun 2007 A1
20070136284 Cobb et al. Jun 2007 A1
20070155411 Morrison Jul 2007 A1
20070157021 Whitfield Jul 2007 A1
20070160188 Sharpe et al. Jul 2007 A1
20070162296 Altberg et al. Jul 2007 A1
20070198329 Lyerly et al. Aug 2007 A1
20070201636 Gilbert et al. Aug 2007 A1
20070263810 Sterns Nov 2007 A1
20070265990 Sidhu et al. Nov 2007 A1
20070269031 Honig et al. Nov 2007 A1
20070280460 Harris et al. Dec 2007 A1
20070287430 Hosain et al. Dec 2007 A1
20080002823 Fama et al. Jan 2008 A1
20080043976 Maximo et al. Feb 2008 A1
20080065902 Spohrer et al. Mar 2008 A1
20080095355 Mahalaha et al. Apr 2008 A1
20080126957 Tysowski et al. May 2008 A1
20080205620 Odinak et al. Aug 2008 A1
20080225872 Collins et al. Sep 2008 A1
20080254774 Lee Oct 2008 A1
20080255944 Shah et al. Oct 2008 A1
20080260138 Chen et al. Oct 2008 A1
20080288770 Kline et al. Nov 2008 A1
20080300955 Hamilton et al. Dec 2008 A1
20090018996 Hunt et al. Jan 2009 A1
20090080411 Lyman Mar 2009 A1
20090086945 Buchanan et al. Apr 2009 A1
20090086949 Caspi et al. Apr 2009 A1
20090086953 Vendrow Apr 2009 A1
20090110182 Knight, Jr. et al. Apr 2009 A1
20090171164 Jung et al. Jul 2009 A1
20090222551 Neely et al. Sep 2009 A1
20090228264 Williams et al. Sep 2009 A1
20090234710 Belgaied et al. Sep 2009 A1
20090234732 Zorman et al. Sep 2009 A1
20090245479 Surendran Oct 2009 A1
20090285384 Pollock et al. Nov 2009 A1
20090306981 Cromack et al. Dec 2009 A1
20090307052 Mankani et al. Dec 2009 A1
20100106568 Grimes Apr 2010 A1
20100114646 Mcilwain et al. May 2010 A1
20100189249 Shah Jul 2010 A1
20100189250 Williams et al. Jul 2010 A1
20100211515 Woodings et al. Aug 2010 A1
20100235341 Bennett Sep 2010 A1
20100250196 Lawler et al. Sep 2010 A1
20100262549 Kannan et al. Oct 2010 A1
20100266115 Fedorov et al. Oct 2010 A1
20100266116 Stolyar et al. Oct 2010 A1
20100274618 Byrd et al. Oct 2010 A1
20100287131 Church Nov 2010 A1
20100293033 Hall et al. Nov 2010 A1
20100299268 Guha et al. Nov 2010 A1
20100332287 Gates et al. Dec 2010 A1
20110014932 Estevez Jan 2011 A1
20110022461 Simeonov Jan 2011 A1
20110071870 Gong Mar 2011 A1
20110077994 Segev et al. Mar 2011 A1
20110082688 Kim et al. Apr 2011 A1
20110116618 Zyarko et al. May 2011 A1
20110125697 Erhart et al. May 2011 A1
20110143323 Cohen Jun 2011 A1
20110182283 Van et al. Jul 2011 A1
20110185293 Barnett et al. Jul 2011 A1
20110216897 Laredo et al. Sep 2011 A1
20110264581 Clyne Oct 2011 A1
20110267985 Wilkinson et al. Nov 2011 A1
20110286592 Nimmagadda Nov 2011 A1
20110288897 Erhart et al. Nov 2011 A1
20120046996 Shah et al. Feb 2012 A1
20120051537 Chishti et al. Mar 2012 A1
20120084217 Kohler et al. Apr 2012 A1
20120087486 Guerrero et al. Apr 2012 A1
20120095835 Makar et al. Apr 2012 A1
20120109830 Vogel May 2012 A1
20120257116 Hendrickson et al. Oct 2012 A1
20120265587 Kinkead Oct 2012 A1
20120290373 Ferzacca et al. Nov 2012 A1
20120321073 Flockhart et al. Dec 2012 A1
20130023235 Fan et al. Jan 2013 A1
20130060587 Bayrak Mar 2013 A1
20130073361 Silver Mar 2013 A1
20130085785 Rogers et al. Apr 2013 A1
20130090963 Sharma et al. Apr 2013 A1
20130124361 Bryson May 2013 A1
20130136252 Kosiba et al. May 2013 A1
20130223608 Flockhart Aug 2013 A1
20130223610 Kohler et al. Aug 2013 A1
20130236002 Jennings et al. Sep 2013 A1
20130257877 Davis Oct 2013 A1
20130304581 Soroca et al. Nov 2013 A1
20130325972 Boston et al. Dec 2013 A1
20140012603 Scanlon et al. Jan 2014 A1
20140016762 Mitchell et al. Jan 2014 A1
20140039944 Humbert et al. Feb 2014 A1
20140039962 Nudd et al. Feb 2014 A1
20140067375 Wooters Mar 2014 A1
20140079195 Srivastava et al. Mar 2014 A1
20140079207 Zhakov et al. Mar 2014 A1
20140099916 Mallikarjunan et al. Apr 2014 A1
20140101261 Wu et al. Apr 2014 A1
20140136346 Teso May 2014 A1
20140140494 Zhakov May 2014 A1
20140143018 Nies et al. May 2014 A1
20140143249 Cazzanti et al. May 2014 A1
20140161241 Baranovsky et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140177819 Vymenets et al. Jun 2014 A1
20140188477 Zhang Jul 2014 A1
20140200988 Kassko et al. Jul 2014 A1
20140219132 Delveaux et al. Aug 2014 A1
20140219438 Brown et al. Aug 2014 A1
20140244712 Walters et al. Aug 2014 A1
20140254790 Shaffer et al. Sep 2014 A1
20140257908 Steiner et al. Sep 2014 A1
20140270108 Riahi et al. Sep 2014 A1
20140270138 Uba et al. Sep 2014 A1
20140270142 Bischoff et al. Sep 2014 A1
20140270145 Erhart et al. Sep 2014 A1
20140278605 Borucki et al. Sep 2014 A1
20140278649 Guerinik et al. Sep 2014 A1
20140279045 Shottan et al. Sep 2014 A1
20140279050 Makar et al. Sep 2014 A1
20140314225 Riahi et al. Oct 2014 A1
20140335480 Asenjo et al. Nov 2014 A1
20140372171 Martin et al. Dec 2014 A1
20140379424 Shroff Dec 2014 A1
20150006400 Eng et al. Jan 2015 A1
20150010134 Erel et al. Jan 2015 A1
20150012278 Metcalf Jan 2015 A1
20150016600 Desai et al. Jan 2015 A1
20150023484 Ni et al. Jan 2015 A1
20150030151 Bellini et al. Jan 2015 A1
20150030152 Waxman et al. Jan 2015 A1
20150051957 Griebeler et al. Feb 2015 A1
20150066632 Gonzalez et al. Mar 2015 A1
20150071418 Shaffer et al. Mar 2015 A1
20150078538 Jain Mar 2015 A1
20150100473 Manoharan et al. Apr 2015 A1
20150127400 Chan et al. May 2015 A1
20150127441 Feldman May 2015 A1
20150127677 Wang et al. May 2015 A1
20150142704 London May 2015 A1
20150172463 Quast et al. Jun 2015 A1
20150178371 Seth et al. Jun 2015 A1
20150195406 Dwyer et al. Jul 2015 A1
20150213454 Vedula Jul 2015 A1
20150215464 Shaffer et al. Jul 2015 A1
20150222751 Odinak et al. Aug 2015 A1
20150256677 Konig et al. Sep 2015 A1
20150262188 Franco Sep 2015 A1
20150262208 Bjontegard et al. Sep 2015 A1
20150269377 Gaddipati Sep 2015 A1
20150271334 Wawrzynowicz Sep 2015 A1
20150281445 Kumar et al. Oct 2015 A1
20150281449 Milstein et al. Oct 2015 A1
20150281450 Shapiro et al. Oct 2015 A1
20150281454 Milstein et al. Oct 2015 A1
20150287410 Mengibar et al. Oct 2015 A1
20150295788 Witzman et al. Oct 2015 A1
20150296081 Jeong Oct 2015 A1
20150334230 Volzke Nov 2015 A1
20150339446 Sperling et al. Nov 2015 A1
20150339620 Esposito et al. Nov 2015 A1
20150339769 Deoliveira et al. Nov 2015 A1
20150347900 Bell et al. Dec 2015 A1
20150350429 Kumar et al. Dec 2015 A1
20150350440 Steiner et al. Dec 2015 A1
20150350443 Kumar et al. Dec 2015 A1
20150379562 Spievak et al. Dec 2015 A1
20160026629 Clifford et al. Jan 2016 A1
20160034260 Ristock et al. Feb 2016 A1
20160034995 Williams et al. Feb 2016 A1
20160036981 Hollenberg et al. Feb 2016 A1
20160036983 Korolev et al. Feb 2016 A1
20160042419 Singh Feb 2016 A1
20160042749 Hirose Feb 2016 A1
20160055499 Hawkins et al. Feb 2016 A1
20160057284 Nagpal et al. Feb 2016 A1
20160065739 Brimshan et al. Mar 2016 A1
20160080567 Hooshiari et al. Mar 2016 A1
20160085891 Ter et al. Mar 2016 A1
20160112867 Martinez Apr 2016 A1
20160124937 Elhaddad May 2016 A1
20160125456 Wu et al. May 2016 A1
20160134624 Jacobson et al. May 2016 A1
20160140627 Moreau et al. May 2016 A1
20160150086 Pickford May 2016 A1
20160155080 Gnanasambandam et al. Jun 2016 A1
20160173692 Wicaksono et al. Jun 2016 A1
20160180381 Kaiser et al. Jun 2016 A1
20160191699 Agrawal et al. Jun 2016 A1
20160191709 Pullamplavil et al. Jun 2016 A1
20160191712 Bouzid et al. Jun 2016 A1
20160234386 Wawrzynowicz Aug 2016 A1
20160247165 Ryabchun et al. Aug 2016 A1
20160261747 Thirugnanasundaram et al. Aug 2016 A1
20160295018 Loftus et al. Oct 2016 A1
20160295020 Shaffer Oct 2016 A1
20160300573 Carbune et al. Oct 2016 A1
20160335576 Peng Nov 2016 A1
20160349960 Kumar et al. Dec 2016 A1
20160358611 Abel Dec 2016 A1
20160360033 Kocan Dec 2016 A1
20160378569 Ristock et al. Dec 2016 A1
20160381222 Ristock et al. Dec 2016 A1
20170004178 Ponting et al. Jan 2017 A1
20170006135 Siebel et al. Jan 2017 A1
20170006161 Riahi et al. Jan 2017 A9
20170011311 Backer et al. Jan 2017 A1
20170024762 Swaminathan Jan 2017 A1
20170032436 Disalvo et al. Feb 2017 A1
20170034226 Bostick et al. Feb 2017 A1
20170068436 Auer et al. Mar 2017 A1
20170068854 Markiewicz et al. Mar 2017 A1
20170098197 Yu et al. Apr 2017 A1
20170104875 Im et al. Apr 2017 A1
20170111505 Mcgann et al. Apr 2017 A1
20170111509 Mcgann et al. Apr 2017 A1
20170116173 Lev-Tov et al. Apr 2017 A1
20170118336 Tapuhi et al. Apr 2017 A1
20170132536 Goldstein et al. May 2017 A1
20170148073 Nomula et al. May 2017 A1
20170155766 Kumar et al. Jun 2017 A1
20170161439 Raduchel et al. Jun 2017 A1
20170162197 Cohen Jun 2017 A1
20170169325 Mccord et al. Jun 2017 A1
20170207916 Luce et al. Jul 2017 A1
20170214795 Charlson Jul 2017 A1
20170220966 Wang Aug 2017 A1
20170223070 Lin Aug 2017 A1
20170236512 Williams et al. Aug 2017 A1
20170286774 Gaidon Oct 2017 A1
20170288866 Vanek et al. Oct 2017 A1
20170308794 Fischerstrom Oct 2017 A1
20170316386 Joshi et al. Nov 2017 A1
20170323344 Nigul Nov 2017 A1
20170337578 Chittilappilly et al. Nov 2017 A1
20170344754 Kumar et al. Nov 2017 A1
20170344988 Cusden et al. Nov 2017 A1
20170359421 Stoops et al. Dec 2017 A1
20170372436 Dalal et al. Dec 2017 A1
20180018705 Tognetti Jan 2018 A1
20180032997 Gordon et al. Feb 2018 A1
20180052664 Zhang et al. Feb 2018 A1
20180053401 Martin et al. Feb 2018 A1
20180054464 Zhang et al. Feb 2018 A1
20180060830 Abramovici et al. Mar 2018 A1
20180061256 Elchik et al. Mar 2018 A1
20180077088 Cabrera-Cordon et al. Mar 2018 A1
20180077250 Prasad et al. Mar 2018 A1
20180097910 D'Agostino et al. Apr 2018 A1
20180114234 Fighel Apr 2018 A1
20180121766 Mccord et al. May 2018 A1
20180137472 Gorzela et al. May 2018 A1
20180137555 Clausse et al. May 2018 A1
20180146093 Kumar et al. May 2018 A1
20180150749 Wu et al. May 2018 A1
20180152558 Chan et al. May 2018 A1
20180165062 Yoo et al. Jun 2018 A1
20180165691 Heater et al. Jun 2018 A1
20180165692 Mccoy Jun 2018 A1
20180165723 Wright et al. Jun 2018 A1
20180174198 Wilkinson et al. Jun 2018 A1
20180189273 Campos et al. Jul 2018 A1
20180190144 Corelli et al. Jul 2018 A1
20180198917 Ristock et al. Jul 2018 A1
20180205825 Vymenets et al. Jul 2018 A1
20180248818 Zucker et al. Aug 2018 A1
20180260857 Kar et al. Sep 2018 A1
20180285423 Ciano et al. Oct 2018 A1
20180286000 Berry et al. Oct 2018 A1
20180293327 Miller et al. Oct 2018 A1
20180293532 Singh et al. Oct 2018 A1
20180300295 Maksak et al. Oct 2018 A1
20180300641 Donn et al. Oct 2018 A1
20180308072 Smith et al. Oct 2018 A1
20180309801 Rathod Oct 2018 A1
20180349858 Walker et al. Dec 2018 A1
20180361253 Grosso Dec 2018 A1
20180365651 Sreedhara et al. Dec 2018 A1
20180367672 Ristock et al. Dec 2018 A1
20180372486 Farniok et al. Dec 2018 A1
20180376002 Abraham Dec 2018 A1
20190013017 Kang et al. Jan 2019 A1
20190028587 Unitt et al. Jan 2019 A1
20190028588 Shinseki et al. Jan 2019 A1
20190037077 Konig et al. Jan 2019 A1
20190042988 Brown et al. Feb 2019 A1
20190043106 Talmor et al. Feb 2019 A1
20190058793 Konig et al. Feb 2019 A1
20190104092 Koohmarey et al. Apr 2019 A1
20190108834 Nelson et al. Apr 2019 A1
20190130329 Fama et al. May 2019 A1
20190132443 Munns et al. May 2019 A1
20190146647 Ramachandran et al. May 2019 A1
20190147045 Kim May 2019 A1
20190172291 Naseath Jun 2019 A1
20190180095 Ferguson et al. Jun 2019 A1
20190180747 Back et al. Jun 2019 A1
20190182383 Shaev et al. Jun 2019 A1
20190196676 Hillis et al. Jun 2019 A1
20190197568 Li et al. Jun 2019 A1
20190205389 Tripathi et al. Jul 2019 A1
20190236205 Jia et al. Aug 2019 A1
20190238680 Narayanan et al. Aug 2019 A1
20190253553 Chishti Aug 2019 A1
20190258825 Krishnamurthy Aug 2019 A1
20190287517 Green et al. Sep 2019 A1
20190295027 Dunne et al. Sep 2019 A1
20190306315 Portman et al. Oct 2019 A1
20190335038 Alonso Y Caloca et al. Oct 2019 A1
20190341030 Hammons et al. Nov 2019 A1
20190342450 Kulkarni et al. Nov 2019 A1
20190349477 Kotak Nov 2019 A1
20190377789 Jegannathan et al. Dec 2019 A1
20190378076 O'Gorman et al. Dec 2019 A1
20190385597 Katsamanis et al. Dec 2019 A1
20190386917 Malin Dec 2019 A1
20190392357 Surti et al. Dec 2019 A1
20190394333 Jiron et al. Dec 2019 A1
20200005375 Sharan et al. Jan 2020 A1
20200007680 Wozniak Jan 2020 A1
20200012697 Fan et al. Jan 2020 A1
20200012992 Chan et al. Jan 2020 A1
20200019893 Lu Jan 2020 A1
20200028968 Mendiratta et al. Jan 2020 A1
20200050788 Feuz et al. Feb 2020 A1
20200050996 Generes, Jr. et al. Feb 2020 A1
20200058299 Lee et al. Feb 2020 A1
20200076947 Deole Mar 2020 A1
20200097544 Alexander et al. Mar 2020 A1
20200104801 Kwon et al. Apr 2020 A1
20200118215 Rao et al. Apr 2020 A1
20200119936 Balasaygun et al. Apr 2020 A1
20200125919 Liu et al. Apr 2020 A1
20200126126 Briancon et al. Apr 2020 A1
20200134492 Copeland Apr 2020 A1
20200134648 Qi et al. Apr 2020 A1
20200137097 Zimmermann et al. Apr 2020 A1
20200154170 Wu et al. May 2020 A1
20200160870 Baughman et al. May 2020 A1
20200175478 Lee et al. Jun 2020 A1
20200193335 Sekhar et al. Jun 2020 A1
20200193983 Choi Jun 2020 A1
20200211120 Wang et al. Jul 2020 A1
20200218766 Yaseen et al. Jul 2020 A1
20200219500 Bender et al. Jul 2020 A1
20200242540 Rosati et al. Jul 2020 A1
20200250272 Kantor et al. Aug 2020 A1
20200250557 Kishimoto et al. Aug 2020 A1
20200257996 London Aug 2020 A1
20200280578 Hearty et al. Sep 2020 A1
20200280635 Barinov et al. Sep 2020 A1
20200285936 Sen Sep 2020 A1
20200329154 Baumann et al. Oct 2020 A1
20200336567 Dumaine Oct 2020 A1
20200342868 Lou et al. Oct 2020 A1
20200351375 Lepore et al. Nov 2020 A1
20200351405 Pace Nov 2020 A1
20200357026 Liu et al. Nov 2020 A1
20200364507 Berry Nov 2020 A1
20200365148 Ji et al. Nov 2020 A1
20200395008 Cohen et al. Dec 2020 A1
20200410506 Jones et al. Dec 2020 A1
20210004536 Adibi et al. Jan 2021 A1
20210005206 Adibi et al. Jan 2021 A1
20210042839 Adamec Feb 2021 A1
20210056481 Wicaksono et al. Feb 2021 A1
20210067627 Delker et al. Mar 2021 A1
20210081869 Zeelig et al. Mar 2021 A1
20210081955 Zeelig et al. Mar 2021 A1
20210082417 Zeelig et al. Mar 2021 A1
20210082418 Zeelig et al. Mar 2021 A1
20210084149 Zeelig et al. Mar 2021 A1
20210089762 Rahimi et al. Mar 2021 A1
20210091996 Mcconnell et al. Mar 2021 A1
20210105361 Bergher et al. Apr 2021 A1
20210124843 Vass et al. Apr 2021 A1
20210125275 Adibi Apr 2021 A1
20210133763 Adibi et al. May 2021 A1
20210133765 Adibi et al. May 2021 A1
20210134282 Adibi et al. May 2021 A1
20210134283 Adibi et al. May 2021 A1
20210134284 Adibi et al. May 2021 A1
20210136204 Adibi et al. May 2021 A1
20210136205 Adibi et al. May 2021 A1
20210136206 Adibi et al. May 2021 A1
20210201244 Sella et al. Jul 2021 A1
20220129905 Sethumadhavan et al. Apr 2022 A1
20220398682 Tam Dec 2022 A1
Foreign Referenced Citations (6)
Number Date Country
1 418 519 May 2004 EP
5986065 Sep 2016 JP
2006-037836 Apr 2006 WO
2012024316 Feb 2012 WO
2015099587 Jul 2015 WO
2019142743 Jul 2019 WO
Non-Patent Literature Citations (40)
Entry
Gaietto, Molly., “What is Customer DNA?”,—NGDATA Product News, Oct. 27, 2015, 10 pages.
Fan et al., “Demystifying Big Data Analytics for Business Intelligence Through the Lens of Marketing Mix”, Big Data Research, vol. 2, Issue 1, Mar. 1, 2015, 16 pages.
An et al.,, Towards Automatic Persona Generation Using Social Media Aug. 1, 2016, 2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW), 2 pages.
Bean-Mellinger, Barbara., “What is the Difference Between Marketing and Advertising?”, available on Feb. 12, 2019, retrieved from https://smallbusiness.chron .com/difference-between-marketing-advertising-2504 7 .html, Feb. 12, 2019, 6 pages.
Twin, Alexandra., “Marketing”, URL: https://www.investopedia.com/lerms/m/marketing.asp, Mar. 29, 2019, 5 pages.
dictionary.com, “Marketing”, URL: https://www.dictionary.com/browse/marketing, Apr. 6, 2019, 7 pages.
Ponn et al., “Correlational Analysis between Weather and 311 Service Request Volume”, eil.mie.utoronto.ca., Jan. 1, 2017, 16 pages.
Zhang et al., “A Bayesian approach for modeling and analysis of call center arrivals”, Jan. 1, 2013 Winter Simulations Conference (WSC), ieeexplore.ieee.org, pp. 713-723.
Mehrotra et al., “Call Center Simulation Modeling: Methods, Challenges, and Opportunities” Proceedings of the 2003 Winter Simulation Conference, vol. 1, Jan. 1, 2003, pp. 135-143.
Mandelbaum et al., “Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Center”, Operations Research, Sep. - Oct., 2009, vol. 57, No. 5 (Sep. 1-Oct., 2009), pp. 1189-1205.
Fukunaga et al., “Staff Scheduling for Inbound Call Centers and Customer Contact Centers”, AI Magazine, Winter, vol. 23, No. 4, Jan. 1, 2002, pp. 30-40.
Feldman et al., “Staffing of Time-Varying Queues to Achieve Time-Stable Performance”, Management Science, Feb. 1, 2008, vol. 54, No. 2, Call Center Management, pp. 324-338.
Business Wire, “Rockwell SSD announces Call Center Simulator”, Feb. 4, 1997, 4 pages.
Nathan, Stearns., “Using skills-based routing to the advantage of your contact center”, Customer Inter@ction Solutions, Technology Marketing Corporation, May 1, 2001, vol. 19 No. 11, pp. 54-56.
Aldor-Noiman et al., “Workload forecasting for a call center: Methodology and a case study”, The Annals of Applied Statistics, vol. 3, No. 4, 2009, pp. 1403-1447.
Koole et al., “An overview of routing and staffing algorithms in multi-skill customer contact centers”, 2006, 43 pages.
Krishnan, Krish, “Data Warehousing in the Age of Big Data”, Morgan Kaufmann, Chapter 5, 2013, 28 pages.
Aksin et al., “The Modern Call Center: A Multi-Disciplinary Perspective on Operations Management Research”, Production and Operations Management, 2007, vol. 16, No. 6, pp. 665-688.
Buesing et al., “Getting the Best Customer Service from your IVR: Fresh eyes on an old problem,” [online] Mckinsey and Co., published on Feb. 1, 2019, available at: < https://www.nnckinsey.conn/business-functions/operations/our-insights/ getting-the-best-customer-service-from-your-ivr-fresh-eyes . . . (Year: 2019).
Chiu et al., “A multi-agent infrastructure for mobile workforce management in a service oriented enterprise”, Proceedings of the 38th annual Hawaii international conference on system sciences, IEEE, 2005, pp. 10.
Diimitrios et al., “An overview of workflow management: From process modeling to workflow automation infrastructure,” Distributed and parallel Databases, 1995, vol. 3, No. 2 pp. 119-153.
Ernst et al. “An Annotated Bibliography of Personnel Scheduling and Rostering”, CSIRO Mathematical and Information Sciences, 2003, 155 pages.
Ernst et al., “Staff scheduling and rostering: A review of applications, methods and models,” European Journal of Operational Research, 2004, vol. 153, pp. 3-27.
Federal Register, vol. 72, No. 195, Oct. 10, 2007, pp. 57526-57535.
Federal Register, vol. 75, No. 169, Sep. 1, 2010, pp. 53643-53660.
Federal register, vol. 79, No. 241 issued on Dec. 16, 2014, p. 74629, col. 2, Gottschalk v. Benson.
Federal Register, vol. 84, No. 4, Jan. 7, 2019, pp. 50-57.
Federal Register, vol. 84, No. 4, Jan. 7, 2019, p. 53-55.
Grefen et al., “A reference architecture for workflow management systems”, Data & Knowledge Engineering, 1998, vol. 27, No. 1, pp. 31-57.
https://www.uspto.gov/patent/laws-and-regulations/examination-policy/examination- guidelines-training-materials-view-ksr, signed Aug. 20, 2010.
Huang et al., “Agent-based workflow management in collaborative product development on the Internet”, Computer-Aided Design, 2000, vol. 32, No. 2, pp. 133-144.
Janarthanam, “Hands on Chatbots and conversational UI development: Build chatbots and voice user interfaces with Chatfuel, Dialogflow, Microsoft Bot Framework, Twilio, and Alexa Skills” Dec. 2017.
Myers et al., “At the Boundary of Workflow and AI”, Proc. AAAI 1999 Workshop on Agent-Based Systems in The Business Context, 1999, 09 pages.
Niven, “Can music with prosocial lyrics heal the working world? A field intervention in a call center.” Journal of Applied Social Psychology, 2015; 45(3), 132-138. doi:10.1111/jasp.12282 ).
On Hold Marketing, “Growing Your Business with Customized on-Hold Messaging” (Published on Apr. 5, 2018 at https://adhq.com/about/ad-news/growing-your-business-with-customized-on-hold-messaging) (Year: 2018).
U.S. Appl. No. 16/668,214, NFOA mailed Nov. 10, 2021.
U.S. Appl. No. 16/668,215, NFOA mailed Dec. 7, 2021.
Van Den Bergh et al. “Personnel scheduling: A literature review”, European journal of operational research, 2013, vol. 226, No. 3 pp. 367-385.
United States Patent and Trademark Office, Non-Final Office Action for U.S. Appl. No. 16/550,961 dated Mar. 2, 2020.
United States Patent and Trademark Office, Final Office Action for U.S. Appl. No. 16/550,961 dated Jun. 17, 2020.
Related Publications (1)
Number Date Country
20230283716 A1 Sep 2023 US