US 10,970,641 B1Grant
Heuristic context prediction engine
Issue Date:2021-04-06
•20 Claims
•10 Drawing Sheets
Abstract
A heuristic engine includes capabilities to collect an unstructured data set and a current business context. Providing a heuristic algorithm, executing within the engine, with the data set and the context may allow determination of predicted future contexts and subsequent actions that refine and improve the quality of service provided to a customer. Such heuristic algorithms may learn from past data transactions and appropriate correlations with events and available data.
Metadata
Assignee
- State Farm Mutual Automobile Insurance Company
Inventors
- Elizabeth Flowers
- Puneit Dua
- Eric Balota
- Shanna L. Phillips
Application Information
Application Number:US 15/495,579
Filing Date:2017-04-24
Priority Date:2016-05-12
Art Unit:2122
Classifications
IPC:
G06Q30/00G06Q30/02G06F16/90G06F11/30G06N5/04G06N20/00
Field of Search:
G06N 5/04G06N 20/00
Patent Drawings (10 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of U.S. Provisional Patent Application Nos. 62/337,711 and 62/335,374, filed respectively on May 12, 2016 and May 17, 2016, and U.S. Provisional Application Nos. 62/368,448, 62/368,406, 62/368,359, 62/368,588, 62/368,572, 62/368,548, 62/368,536, 62/368,525, 62/368,512, 62/368,503, 62/368,332, 62/368,298, 62/368,271, filed on Jul. 29, 2016, the disclosures of which are hereby incorporated herein by reference.
FIELD OF THE INVENTION
[0002] The disclosure generally relates to systems, methods, apparatus, and non-transitory computer readable media for using heuristic algorithms to predict a context of a customer service interaction and, more particularly, to process natural language inputs and unstructured data sets to determine and refine a customer service interaction.
BACKGROUND
[0003] Organizations involved in customer service activities often process large amounts of unstructured data to make decisions while interacting with a customer in real-time. For example, in the case of a customer service representative speaking on the telephone with a customer experiencing an issue with a product or service, appropriate solutions may include a combination of timeliness of response and accuracy in content.
[0004] Such unstructured data may include voluminous transaction records spanning decades, unstructured customer service data, or real-time transcripts of customer service interactions with scattered contextual indicators. To reasonably expect a customer service representative to effectively leverage such large data sets in real-time places an unreasonable burden on a customer service representative. However, failing to do so robs the customer service representative of vital context not readily apparent, and the wealth of knowledge gained throughout the history of an organization that would otherwise need to be distilled to briefing materials and expensively trained over time. Thus, organizations may value tools to rapidly process large data sets, to infer context, suggest lessons learned based upon transaction data, while learning through successive process iterations. Furthermore, appropriate application of such tools may provide a competitive advantage in a crowded and competitive customer service industry.
[0005] In an effort to automate and provide better predictability of customer service experiences, many organizations develop customer relationship management (CRM) software packages. Organizations that develop these software packages often develop custom solutions, at great expense, to best meet the needs of their customers in unique industries. Such tools while providing a great level of detail for the customer service representative, lack the flexibility to react to changing business conditions or fully exploit the underlying technology, driving additional cost into an already expensive solution.
[0006] Some organizations where able to make concessions on customized solutions turn to off-the-shelf or commercially available software solutions that reduce the overall cost of implementation. Such solutions may provide customer service representative prompting tools with question and answer formats that allow for consistency of customer experience, however, at the expense of a less personalized experience required in many industries. While more flexible than fully-custom solutions, the impersonal question-answer format of customer interaction may not improve without costly software revisions, rarely performed by original equipment manufacturers (OEMs) of off-the-shelf solutions.
[0007] The ability for a customer service experience to learn and improve over successive iterations remains paramount for organizations to offer discriminating customer service experiences. Often the burden of continual improvement falls to the customer service representative, as a human being able to adapt and learn to changing conditions more rapidly even within the confines of a rigid customer service software application. However, with the advent of outsourcing prevalent in the customer service industry, the customer service representative may lack much of the necessary context required to provide high levels of relevant customer service. This lack of context in an interconnected company is less an issue of distance and more an issue of data access and the ability to contextually process data to present relevant solutions in a timely manner.
SUMMARY
[0008] One exemplary embodiment includes a computer-implemented method, executed with a computer processor, to predict a current and subsequent context. The method may include retrieving an un-structured website history transaction data set stored in a first memory, receiving a unique customer identifier, accessing a heuristic algorithm, and/or executing the algorithm using the data set and the identifier. The algorithm may output a correlation score associated with at least one user and predict the current context using at least one correlation score, calculate a predicted question using the current context, and/or update the algorithm using the subsequent context. The method may include additional, less, or alternate actions, including those discussed elsewhere herein.
[0009] Yet another exemplary embodiment includes a computer-implemented method, executed with a computer processor, that generates a predicted subsequent context using a chat window that includes retrieving an un-structured transaction set correlating questions and answers stored in a first memory, receiving a natural language input from a chat window from a customer, and/or accessing and executing a heuristic algorithm to generate the predicted subsequent context using the language input and the data set. The embodiment includes calculating a predicted question using the predicted subsequent context, receiving an actual customer question with a human machine interface, and/or updating the algorithm using a calculated correlation between the actual customer question and the predicted question. The method may include additional, less, or alternate actions, including those discussed elsewhere herein.
[0010] An alternative embodiment includes a computer-implemented method, executed with a computer processor, that generates a predicted subsequent customer question and suggested answers. The method may include retrieving an un-structured transaction set correlating past customer questions and/or receiving a natural language input in a customer service environment. Furthermore, the method may include accessing and executing a heuristic algorithm to generate a predicted subsequent customer question using the language input and the transaction set. Still further, the embodiment may include receiving, with the processor, an actual customer question with a human machine interface and/or updating the algorithm using a calculated correlation between the actual customer question and the predicted subsequent question. The method may include additional, less, or alternate actions, including those discussed elsewhere herein.
[0011] Another exemplary embodiment includes a computer-implemented method, executed with a computer processor, that generates an agent training suggestion using a natural language input and an unstructured agent transaction record. The method may include retrieving an un-structured agent transaction record and receiving a natural language input. The method may include accessing and executing a heuristic algorithm to generate the agent training suggestion using the transaction record and the natural language input. Furthermore, the method may include receiving an indication of agent behavior modification and/or updating the algorithm using a calculated correlation between the suggestion and the indication. The method may include additional, less, or alternate actions, including those discussed elsewhere herein.
[0012] Exemplary embodiments may include computer-implemented methods that may in other embodiments include apparatus configured to implement the method, and/or non-transitory computer readable mediums comprising computer-executable instructions that cause a processor to perform the method.
[0013] Advantages will become more apparent to those skilled in the art from the following description of the preferred embodiments which have been shown and described by way of illustration. As will be realized, the present embodiments may be capable of other and different embodiments, and their details are capable of modification in various respects. Accordingly, the drawings and description are to be regarded as illustrative in nature and not as restrictive.
BRIEF DESCRIPTION OF THE DRAWINGS
[0014] The Figures described below depict various aspects of the system and methods disclosed herein. It should be understood that each figure depicts an aspect of a particular aspect of the disclosed system and methods, and that each of the Figures is intended to accord with a possible aspect thereof. Further, wherever possible, the following description refers to the reference numerals included in the following Figures, in which features depicted in multiple Figures are designated with consistent reference numerals.
[0015] There are shown in the Figures arrangements which are presently discussed, it being understood, however, that the present embodiments are not limited to the precise arrangements and instrumentalities shown, wherein:
[0016] FIG. 1 illustrates an exemplary computer system to predict a context in accordance with one aspect of the present disclosure;
[0017] FIG. 2 illustrates an exemplary computer-implemented method to predict a context in accordance with one aspect of the present disclosure;
[0018] FIG. 3 illustrates an exemplary computer system to predict a context with a chat window in accordance with one aspect of the present disclosure;
[0019] FIG. 4 illustrates an exemplary computer-implemented method to predict a context with a chat window in accordance with one aspect of the present disclosure;
[0020] FIG. 5 illustrates an exemplary computer system to troubleshoot a system in accordance with one aspect of the present disclosure;
[0021] FIG. 6 illustrates an exemplary computer-implemented method to troubleshoot a system in accordance with one aspect of the present disclosure;
[0022] FIG. 7 illustrates an exemplary computer system to assess agent training in accordance with one aspect of the present disclosure;
[0023] FIG. 8 illustrates an exemplary computer-implemented method to assess agent training in accordance with one aspect of the present disclosure;
[0024] FIG. 9 illustrates an exemplary computing system to in accordance with one aspect of the present disclosure; and
[0025] FIG. 10 illustrates an exemplary article of manufacture in accordance with one aspect of the present disclosure.
[0026] The Figures depict preferred embodiments for purposes of illustration only. Alternative embodiments of the systems and methods illustrated herein may be employed without departing from the principles of the invention described herein.
DETAILED DESCRIPTION
[0027] Various embodiments of the present disclosure include the collection of unstructured data sets together with a current context. Heuristic algorithms processing these unstructured data sets together the context may allow calculation of a future context, and the presentation of context relevant data that improves over time. By subsequently training the heuristic algorithm with the outcome of a current and future predicted context, and the relevance of presented data, the heuristic algorithm may improve its efficiency as the unstructured data set grows.
[0028] Although the following text sets forth a detailed description of numerous different embodiments, it should be understood that the legal scope of the description is defined by the words of the claims set forth at the end of this patent and equivalents. The detailed description is to be construed as exemplary only and does not describe every possible embodiment since describing every possible embodiment would be impractical. Numerous alternative embodiments may be implemented, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope of the claims.
Context Prediction
[0029] FIG. 1 illustrates a block diagram of an exemplary computer system 100 to predict a current and subsequent context. The exemplary system 100 enables a user 105 to interface with a user terminal 110 to initiate a transaction that involves asking a question. Such a request may, in one embodiment, involve an earlier initiation by a customer service representative 160, interacting with a service terminal 155. In another embodiment, the transaction may result from a user initiated request, absent the representative 160.
[0030] In the exemplary embodiment illustrated in FIG. 1 , the user terminal 110 interfaces through a network 115 to a network interface 130 and a network server 120, such as via wireless communication or data transmission over one or more radio links or wireless, digital communication channels. The network 115 may include any of a variety of local or wire-area networks, for example the Internet, or a corporate intranet with access controls. The network interface 130 may provide interfaces and translation capabilities allowing a processor 135 to communicate using a variety of network protocols, among a variety of network layers, in parallel and serially.
[0031] A human-machine interface 140, together with the network interface 130, and the processor 135, may comprise a heuristic engine 125, in one embodiment. In another embodiment, the heuristic engine 125 may include additional components, for example memory devices, processing engines, and interfaces, not illustrated, to perform required functions. The processor 135 may include interfaces to a heuristic server 145 and transaction server 150, according to one embodiment. The human-machine interface 140 may include interfaces to the service terminal 155 used by the customer service representative 160.
[0032] In accordance with one aspect of the present disclosure, the system 100 may perform the method 200, as illustrated in FIG. 4 . However, the method 200 does not specifically require the system 100, or the elements included therein in a particular arrangement, to perform the method steps illustrated in the process 200.
[0033] The exemplary method 200 includes (block 205) a customer, for example the customer 105 in FIG. 1 , initiates a transaction that involves asking a question. The heuristic engine 125 of FIG. 1 , may in one embodiment, retrieve website transaction data (block 210), for example from the server 120 using a SQL database request, or otherwise as appropriate given the specific implementation of the server 120. In one embodiment of the present disclosure, the customer 105 may provide a unique identifier, for example in the form of a caller-id telephone number, or internet address, such as an IP address, MAC address, transaction identifier, or other identifier that uniquely identifies a user over a telecommunications network, such as the network 115 in FIG. 1 . The processor 125 may retrieve a heuristic algorithm from, for example, the heuristic server 145 (block 220). The heuristic algorithm may in one embodiment, include a commercially available heuristic algorithm, for example, the Watson algorithm, a cognitive heuristic algorithm, commercially available from the International Business Machines Corporation. Such an algorithm may, in one embodiment, reside within the heuristic server 145 in machine executable instructions, specific to the processor 135. In another embodiment, the heuristic algorithm may reside within the heuristic server 145 as compiled object code, or un-compiled source code.
[0034] The processor 135 may execute the algorithm with the unique identifier and the transaction data (block 225). In one embodiment, the processor 135 may include compilation and linking steps necessary to translate object code or source code into machine executable instructions appropriate for the processor 135 at run-time, or at a time prior to required execution. The processor may predict a current context for the customer 105 (block 230), such as classifying the customer into a particular category based upon product type, or otherwise. In one embodiment (block 235), the processor 135 may receive a customer question, for example from the terminal 110, through the network 115, translated by the network interface 130. Using the predicted context, and the customer question, the processor 135 may (block 240) calculate a predicted question from which to compare the actual question. Providing the heuristic algorithm the results of such a comparison (block 245), allows in one embodiment the training or learning of the heuristic algorithm.
Contextual Chat Window Predictions
[0035] FIG. 3 illustrates a block diagram of an exemplary computer system 300 to generate a predicted subsequent context using a chat window. The exemplary system 300 enables a user 305 to interface with a mobile device 310 to initiate a transaction that involves asking a question through a chat window. Such a request may, in one embodiment involve an earlier initiation by a customer service representative 365, interacting with a service terminal 360. In another embodiment, the transaction may result from a user initiated request, absent the representative 365.
[0036] The mobile device 310 may communicatively couple to a human-machine interface 355 through a wireless interface device 320, according to one embodiment. Such a wireless interface device 320 may comprise a WiFi access point, for example in accordance with IEEE Std 802.11, or any of a variety of cellular or mobile access point equipment required to translate wireless digital and analog signals into signals within a computer network. The wireless interface device 320 may in various embodiments include a plurality of interface devices within, for example a cellular data infrastructure network commercially available for consumer or business use.
[0037] The human-machine interface 355 may interface to a processor 335 disposed for example within a heuristic engine 345, together with a network interface 325, according to one embodiment of the present disclosure. Other embodiments of the heuristic engine 345 may include a variety of memory devices, interface devices, and processing devices, to execute required functions. The computer processor 335 may interface to a heuristic server 340 and a local transaction server 350, in one embodiment, and may interface to a remote transaction server 330 via the network interface 325. A customer service representative 365 may interface with a service terminal 360 to initiate and interact with the customer 305 via, for example, a chat window.
[0038] In accordance with one aspect of the present disclosure, the system 300 may perform the method 400, as illustrated in FIG. 4 . However, the method 400 does not specifically require the system 300, nor do the elements included therein require a particular arrangement, to perform the method steps illustrated in the process 400.
[0039] A customer, such as the customer 305 of FIG. 3 , may initiate a chat session (block 405), for example using the mobile device 310 of FIG. 3 . In one embodiment, the processor 335 may retrieve a transaction set (block 410) from the transaction server 350, that correlates questions and answers. The processor 335, may retrieve a heuristic algorithm from the heuristic server 340 (block 420). The customer 305 may provide a natural language input (block 415), for example into the mobile device 310, and the processor 335 may execute the algorithm with the question and answer set, and the language input from the user. One exemplary embodiment includes the processor 335 generating a predicted subsequent context (block 430), and the processor 335 receiving an actual customer question (block 435). The processor 335 may update the algorithm with the predicted context and actual question (block 440). In another exemplary embodiment, the processor 335 may update the algorithm with a comparison of the predicted question and the actual question.
Question and Answer Prediction
[0040] FIG. 5 illustrates a block diagram of an exemplary computer system 500 to use natural language inputs to prompt questions and answer sets. The exemplary system 500 enables a user 505, for example interfacing with a cellular telephone 510, to provide a natural language input over a wireless network. The cellular telephone 510 may communicate over a wireless protocol 515 through a wireless access point 520, communicatively coupled to a computer network 525. The computer network 525 may interface to a remote server 545 and a first customer service representative 535 through a customer service terminal 540. A second customer service representative, in one embodiment, may interface with a view-screen 565 and a telephone 560, that respectively communicatively couple to a computer processor 570 and a network interface 550. In one embodiment, the network interface 550 and computer processor 570 together comprise a heuristic engine 575, that interfaces to the computer network 525, a heuristic server 585, and a transaction server 580.
[0041] In accordance with one aspect of the present disclosure, the system 500 may perform the computer-implemented method 600, as illustrated in FIG. 6 . However, in one embodiment, the method 600 may not, or does not, specifically require the system 500, nor do the elements included therein require a particular arrangement, to perform the method steps illustrated in the process 600.
[0042] The method 600 includes a user, for example the user 505 of FIG. 5 , speaking in a natural language (block 605). The processor 570, for example, may retrieve a transaction set from the remote server 545 or the transaction server 580 (block 610). The transaction set, in one embodiment, may include correlation data between question and answer sets. The processor 570 may retrieve a heuristic algorithm, for example from the heuristic server 585 (block 620). In one exemplary embodiment, the processor 570 may execute the algorithm with the transaction set and data representing the natural language input of the user.
[0043] In accordance with one exemplary embodiment, a user or customer may (block 625) ask a question in natural language. The processor may prompt the first service representative 535, and/or second service representative 555, using the service terminal 540, viewscreen 565, and/or the telephone 560 with at least one predicted question (block 635). In one embodiment, the processor (block 570) updates the heuristic algorithm, for example in the heuristic server 585, with a correlation between a predicted question and the actual question asked (block 625).
Cause and Effect Transaction Analysis
[0044] FIG. 7 illustrates a block diagram of an exemplary computer system 700 to modify sales agent training based upon a cause-effect transaction analysis. The exemplary system 700 enables a user 705, using for example a telephone 750 to interface with a network interface 715. The network interface 715 may also interface with a remote server 720, and a computer processor 725. A service representative 755 may interface, in one embodiment, with a human-machine interface 745 using a telephone 750. The human-machine interface 745, a heuristic server 730, a transaction server 735, and the network interface 715 may each interface with the computer processor 725. The network interface 715, computer processor 725, and the human-machine interface 745 may comprise, in one embodiment, a heuristic engine 740. In other embodiments, the heuristic engine 735 may include a variety of memory devices, interface devices, and processing devices, to execute required functions.
[0045] In accordance with one aspect of the present disclosure, the system 700 may perform the computer-implemented method 800, as illustrated in FIG. 8 . However, in one embodiment, the method 800 does not, or may not, specifically require the system 700, nor do the elements included therein require a particular arrangement, to perform the method steps illustrated in the process 800.
[0046] The method 800 includes a sales agent, or employee of an organization, such as the user 705 of FIG. 7 , interacts with a training or customer service interface (block 805), for example the telephone 710 of FIG. 7 . The processor 725 may retrieve at least one agent transaction record (block 810), for example from the remote server 720 or the transaction server 735. In one embodiment, the processor 725 may retrieve a heuristic algorithm from the heuristic server 730. An agent, for example the agent 705 of FIG. 7 , may provide a context in natural language (block 820), for example through the telephone 710. The processor 725 may execute the algorithm with the transaction record and the natural language (block 825).
[0047] The processor may determine recommended agent training resources (block 830). In one embodiment, the processor 725 may update the heuristic algorithm, for example in the heuristic server 730, with the recommended resource, and/or change in behavior, in one embodiment correlated to business need.
[0048] FIG. 9 illustrates an exemplary computing system 900 in accordance with the embodiments disclosed in FIGS. 1-8 and 10 . The exemplary computing system 900 and components disclosed therein may comprise part, all, or none of the disclosed embodiments of FIGS. 1-8 and 10 . The system 900 includes one or more microprocessors 905, coupled to supporting devices through multi-access busses 925 and 940. Dynamic random access memory 930 and 935 may interface to data bus 925, and store data used by the one or more microprocessors 905. The system 900 includes instruction registers 920 that store executable instructions for the one or more microprocessors 905, and data registers 915 that store data for execution. In some embodiments, the system 900 includes one or more arithmetic co-processors 910, to assist or supplement the one or more microprocessors 905.
[0049] Data bus 940 includes interfaces to a graphics interface 945 that may in some embodiments process and transmit graphical data for a user on a display or similar devices. Likewise, data bus 940 includes interfaces for a digital I/O interface that processes and transmits, for example, keyboard, pointing device, and other digital and analog signals produced and consumed by users or other machines. A network interface 955 processes and transmits encoded information over wired and wireless networks to connect the system 900 to other machines and users. Data bus 940 also includes at least one interface to a non-volatile memory interface, that may process and transmit data that resides on non-volatile memory devices.
[0050] FIG. 10 illustrates a non-transitory computer readable medium 1005, that comprises processor executable instructions 1010. Such processor executable instructions may include instructions executed by the one or more processors 905 of FIG. 9 .
Machine Learning and Other Matters
[0051] In certain embodiments, the heuristic engine and algorithms discussed herein may include machine learning, cognitive learning, deep learning, combined learning, and/or pattern recognition techniques. For instance, a processor or a processing element may be trained using supervised or unsupervised machine learning, and the machine learning program may employ a neural network, which may be a convolutional neural network, a deep learning neural network, or a combined learning module or program that learns in two or more fields or areas of interest. Machine learning may involve identifying and recognizing patterns in existing data in order to facilitate making predictions for subsequent data. Models may be created based upon example inputs in order to make valid and reliable predictions for novel inputs.
[0052] Additionally or alternatively, the machine learning programs may be trained by inputting sample data sets or certain data into the programs, such as image, mobile device, insurer database, and/or third-party database data. The machine learning programs may utilize deep learning algorithms that may be primarily focused on pattern recognition, and may be trained after processing multiple examples. The machine learning programs may include Bayesian program learning (BPL), voice recognition and synthesis, image or object recognition, optical character recognition, and/or natural language processing—either individually or in combination. The machine learning programs may also include natural language processing, semantic analysis, automatic reasoning, and/or machine learning.
[0053] In supervised machine learning, a processing element may be provided with example inputs and their associated outputs, and may seek to discover a general rule that maps inputs to outputs, so that when subsequent novel inputs are provided the processing element may, based upon the discovered rule, accurately predict the correct output. In unsupervised machine learning, the processing element may be required to find its own structure in unlabeled example inputs. In one embodiment, machine learning techniques may be used to extract the relevant data for one or more tokenized icons from user device details, user request or login details, user device sensors, geolocation information, image data, the insurer database, a third-party database, and/or other data.
[0054] In one embodiment, a processing element (and/or heuristic engine or algorithm discussed herein) may be trained by providing it with a large sample of images and/or user data with known characteristics or features. Based upon these analyses, the processing element may learn how to identify characteristics and patterns that may then be applied to analyzing user device details, user request or login details, user device sensors, geolocation information, image data, the insurer database, a third-party database, and/or other data. For example, the processing element may learn, with the user's permission or affirmative consent, to identify the user and/or the asset that is to be the subject of a transaction, such as generating an insurance quote or claim, opening a financial account, handling a loan or credit application, processing a financial (such as a credit card) transaction or the like.
ADDITIONAL CONSIDERATIONS
[0055] All of the foregoing computer systems may include additional, less, or alternate functionality, including that discussed herein. All of the computer-implemented methods may include additional, less, or alternate actions, including those discussed herein, and may be implemented via one or more local or remote processors and/or transceivers, and/or via computer-executable instructions stored on computer-readable media or medium.
[0056] The processors, transceivers, mobile devices, service terminals, servers, remote servers, database servers, heuristic servers, transaction servers, and/or other computing devices discussed herein may communicate with each via wireless communication networks or electronic communication networks. For instance, the communication between computing devices may be wireless communication or data transmission over one or more radio links, or wireless or digital communication channels.
[0057] Customers may opt into a program that allows them share mobile device and/or customer, with their permission or affirmative consent, with a service provider remote server. In return, the service provider remote server may provide the functionality discussed herein, including security, fraud, or other monitoring, and generate recommendations to the customer and/or generate alerts for the customers in response to abnormal activity being detected.
[0058] The following additional considerations apply to the foregoing discussion. Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.
[0059] Additionally, certain embodiments are described herein as including logic or a number of routines, subroutines, applications, or instructions. These may constitute either software (e.g., code embodied on a machine-readable medium or in a transmission signal) or hardware. In hardware, the routines, etc., are tangible units capable of performing certain operations and may be configured or arranged in a certain manner. In example embodiments, one or more computer systems (e.g., a standalone, client or server computer system) or one or more hardware modules of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware module that operates to perform certain operations as described herein.
[0060] In various embodiments, a hardware module may be implemented mechanically or electronically. For example, a hardware module may comprise dedicated circuitry or logic that is permanently configured (e.g., as a special-purpose processor, such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC)) to perform certain operations. A hardware module may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement a hardware module mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.
[0061] Accordingly, the term “hardware module” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. Considering embodiments in which hardware modules are temporarily configured (e.g., programmed), each of the hardware modules need not be configured or instantiated at any one instance in time. For example, where the hardware modules comprise a general-purpose processor configured using software, the general-purpose processor may be configured as respective different hardware modules at different times. Software may accordingly configure a processor, for example, to constitute a particular hardware module at one instance of time and to constitute a different hardware module at a different instance of time.
[0062] Hardware modules may provide information to, and receive information from, other hardware modules. Accordingly, the described hardware modules may be regarded as being communicatively coupled. Where multiple of such hardware modules exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) that connect the hardware modules. In embodiments in which multiple hardware modules are configured or instantiated at different times, communications between such hardware modules may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware modules have access. For example, one hardware module may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware module may then, at a later time, access the memory device to retrieve and process the stored output. Hardware modules may also initiate communications with input or output devices, and may operate on a resource (e.g., a collection of information).
[0063] The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processor-implemented modules.
[0064] Similarly, the methods or routines described herein may be at least partially processor-implemented. For example, at least some of the operations of a method may be performed by one or more processors or processor-implemented hardware modules. The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processor or processors may be located in a single location (e.g., within a home environment, an office environment or as a server farm), while in other embodiments the processors may be distributed across a number of locations.
[0065] The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the one or more processors or processor-implemented modules may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the one or more processors or processor-implemented modules may be distributed across a number of geographic locations.
[0066] Unless specifically stated otherwise, discussions herein using words such as “processing,” “computing,” “calculating,” “determining,” “presenting,” “displaying,” or the like may refer to actions or processes of a machine (e.g., a computer) that manipulates or transforms data represented as physical (e.g., electronic, magnetic, or optical) quantities within one or more memories (e.g., volatile memory, non-volatile memory, or a combination thereof), registers, or other machine components that receive, store, transmit, or display information.
[0067] As used herein any reference to “one embodiment” or “an embodiment” means that a particular element, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
[0068] Some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. For example, some embodiments may be described using the term “coupled” to indicate that two or more elements are in direct physical or electrical contact. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other. The embodiments are not limited in this context.
[0069] As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).
[0070] In addition, use of the “a” or “an” are employed to describe elements and components of the embodiments herein. This is done merely for convenience and to give a general sense of the description. This description, and the claims that follow, should be read to include one or at least one and the singular also includes the plural unless it is obvious that it is meant otherwise.
[0071] The patent claims at the end of this patent application are not intended to be construed under 35 U.S.C. § 112(f) unless traditional means-plus-function language is expressly recited, such as “means for” or “step for” language being explicitly recited in the claim(s).
[0072] The systems and methods described herein are directed to improvements to computer functionality, and improve the functioning of conventional computers.
[0073] This detailed description is to be construed as exemplary only and does not describe every possible embodiment, as describing every possible embodiment would be impractical, if not impossible. One may be implement numerous alternate embodiments, using either current technology or technology developed after the filing date of this application.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer-implemented method, executed with processor, comprising:
retrieving, by the processor, an un-structured website history transaction data set stored in a first memory;
receiving, by the processor and from a network interface device, an identifier uniquely identifying a user of a plurality of users;
accessing, by the processor, a heuristic algorithm stored in a second memory;
executing the heuristic algorithm, by the processor, and using the un-structured website history transaction data set and the identifier, wherein executing the heuristic algorithm causes the heuristic algorithm to output a correlation score associated with the user;
predicting, by the processor and using the correlation score, a first context indicating a user category;
generating, by the processor and using the first context, a predicted question of the user; and
updating, by the processor and based at least in part on the predicted question, the heuristic algorithm in the second memory using a second context received from the network interface device.
2. The computer-implemented method of claim 1, wherein the identifier comprises an internet network address.
3. The computer-implemented method of claim 1, wherein the identifier comprises a source telephone number.
4. The computer-implemented method of claim 1, wherein the un-structured website history transaction data set comprises past transactions related to at least one account.
5. The computer-implemented method of claim 1, wherein the first memory comprises an external transaction server.
6. The computer-implemented method of claim 1, wherein the second memory comprises an external heuristic server.
7. The computer-implemented method of claim 1, wherein the un-structured website history transaction data set corresponds to the identifier provided via a human-machine interface.
8. The computer-implemented method of claim 1, further comprising:
receiving, by the processor, the second context, wherein the second context comprises a question from the user;
determining, by the processor, a difference between the predicted question and the second context; and
updating, by the processor and in response to determining the difference, the heuristic algorithm in the second memory.
9. The computer-implemented method of claim 1, further comprising:
receiving a question from the user; and
predicting, based at least in part on the question, the first context.
10. A computer system comprising one or more processors configured to:
retrieve an un-structured website history transaction data set stored in a first memory;
receive, from a network interface device, an identifier uniquely identifying a user of a plurality of users;
access a heuristic algorithm stored in a second memory;
execute the heuristic algorithm, using the un-structured website history transaction data set and the identifier, wherein executing the heuristic algorithm causes the heuristic algorithm to output a correlation score associated with the user;
predict, using the correlation score, a first context indicating a user category;
generate, using the first context, a predicted question of the user; and
update, based at least in part on the predicted question, the heuristic algorithm in the second memory using a second context received from the network interface device.
11. The computer system of claim 10, wherein the identifier comprises an internet network address.
12. The computer system of claim 10, wherein the identifier comprises a source telephone number.
13. The computer system of claim 10, wherein the un-structured website history transaction data set comprises past transactions related to at least one account.
14. The computer system of claim 10, wherein the first memory comprises an external transaction server, and the second memory comprises an external heuristic server.
15. A non-transitory computer readable medium, comprising computer readable instructions that, when executed by processor, cause the processor to perform acts comprising:
retrieving an un-structured website history transaction data set stored in a first memory;
receiving, from a network interface device, an identifier uniquely identifying a user of a plurality of users;
accessing a heuristic algorithm stored in a second memory;
executing the heuristic algorithm, using the un-structured website history transaction data set and the identifier, wherein executing the heuristic algorithm causes the heuristic algorithm to output a correlation score associated with the user;
predicting, using the correlation score, a first context indicating a user category;
generating, using the first context, a predicted question of the user; and
updating, based at least in part on the predicted question, the heuristic algorithm in the second memory using a second context received from the network interface device.
16. The non-transitory computer readable medium of claim 15, wherein the identifier comprises an internet network address.
17. The non-transitory computer readable medium of claim 15, wherein the identifier comprises a source telephone number.
18. The non-transitory computer readable medium of claim 15, wherein the un-structured website history transaction data set comprises past transactions related to at least one account.
19. The non-transitory computer readable medium of claim 15, wherein the first memory comprises an external transaction server, and the second memory comprises an external heuristic server.
20. The non-transitory computer readable medium of claim 15, wherein the un-structured website history transaction data set corresponds to the identifier provided via a human-machine interface.
Patent Citations (104)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US6658393(B1) | 2003-12-01 | Basch et al. | Applicant |
| US7765557(B2) | 2010-07-01 | Young | Applicant |
| US7870431(B2) | 2011-01-01 | Cirne et al. | Applicant |
| US8019678(B2) | 2011-09-01 | Wright et al. | Applicant |
| US8117097(B2) | 2012-02-01 | Abbott | Applicant |
| US8135633(B1) | 2012-03-01 | LeBaron et al. | Applicant |
| US8217396(B2) | 2012-07-01 | Yamazaki et al. | Applicant |
| US8271396(B2) | 2012-09-01 | Ronning et al. | Applicant |
| US8560390(B2) | 2013-10-01 | Higgins et al. | Applicant |
| US8600873(B2) | 2013-12-01 | Fisher | Applicant |
| US8615520(B2) | 2013-12-01 | Fallah | Applicant |
| US8635117(B1) | 2014-01-01 | Acuna-Rohter | Applicant |
| US8688579(B1) | 2014-04-01 | Ethington et al. | Applicant |
| US8732023(B2) | 2014-05-01 | Mikurak | Applicant |
| US8775299(B2) | 2014-07-01 | Achanta et al. | Applicant |
| US8781962(B2) | 2014-07-01 | Vasten | Applicant |
| US8811711(B2) | 2014-08-01 | Calman et al. | Applicant |
| US8826155(B2) | 2014-09-01 | Dixon et al. | Applicant |
| US8838474(B2) | 2014-09-01 | Macy et al. | Applicant |
| US8838491(B2) | 2014-09-01 | Erbey et al. | Applicant |
| US8842331(B1) | 2014-09-01 | Enge | Applicant |
| US8885963(B2) | 2014-11-01 | Coleman | Applicant |
| US8892461(B2) | 2014-11-01 | Lau et al. | Applicant |
| US8996411(B2) | 2015-03-01 | Thomas | Applicant |
| US9117117(B2) | 2015-08-01 | Macciola et al. | Applicant |
| US9349145(B2) | 2016-05-01 | Rozman et al. | Applicant |
| US9473634(B1) | 2016-10-01 | Ouimette et al. | Applicant |
| US9626453(B2) | 2017-04-01 | Koerner et al. | Applicant |
| US9942250(B2) | 2018-04-01 | Stiansen et al. | Applicant |
| US10489861(B1) | 2019-11-01 | Ross | Examiner |
| US10504029(B2) | 2019-12-01 | Edelen et al. | Applicant |
| US2002/0194117(A1) | 2002-12-01 | Nabe et al. | Applicant |
| US2003/0074328(A1) | 2003-04-01 | Schiff et al. | Applicant |
| US2004/0036961(A1) | 2004-02-01 | McGuire | Applicant |
| US2004/0039691(A1) | 2004-02-01 | Barratt et al. | Applicant |
| US2005/0091524(A1) | 2005-04-01 | Abe et al. | Applicant |
| US2006/0212386(A1) | 2006-09-01 | Willey et al. | Applicant |
| US2006/0253468(A1) | 2006-11-01 | Ramsey et al. | Applicant |
| US2006/0253578(A1) | 2006-11-01 | Dixon et al. | Applicant |
| US2006/0256953(A1) | 2006-11-01 | Pulaski et al. | Applicant |
| US2006/0265090(A1) | 2006-11-01 | Conway et al. | Applicant |
| US2007/0168285(A1) | 2007-07-01 | Girtakovskis et al. | Applicant |
| US2008/0255891(A1) | 2008-10-01 | Stone | Applicant |
| US2009/0049550(A1) | 2009-02-01 | Shevchenko | Applicant |
| US2009/0064323(A1) | 2009-03-01 | Lin | Examiner |
| US2009/0254971(A1) | 2009-10-01 | Herz | Examiner |
| US2010/0076994(A1) | 2010-03-01 | Soroca | Examiner |
| US2010/0222053(A1) | 2010-09-01 | GiriSrinivasaRao et al. | Applicant |
| US2010/0332287(A1) | 2010-12-01 | Gates et al. | Applicant |
| US2010/0332500(A1) | 2010-12-01 | Pan et al. | Applicant |
| US2011/0047071(A1) | 2011-02-01 | Choudhuri et al. | Applicant |
| US2011/0071857(A1) | 2011-03-01 | Malov et al. | Applicant |
| US2011/0131125(A1) | 2011-06-01 | Lawrence et al. | Applicant |
| US2011/0178901(A1) | 2011-07-01 | Imrey et al. | Applicant |
| US2011/0191250(A1) | 2011-08-01 | Bishop et al. | Applicant |
| US2011/0225138(A1) | 2011-09-01 | Johnston | Applicant |
| US2011/0258049(A1) | 2011-10-01 | Ramer | Examiner |
| US2011/0262536(A1) | 2011-10-01 | Jordan et al. | Applicant |
| US2011/0295722(A1) | 2011-12-01 | Reisman | Applicant |
| US2011/0306028(A1) | 2011-12-01 | Galimore | Applicant |
| US2011/0307258(A1) | 2011-12-01 | Liberman et al. | Applicant |
| US2012/0116972(A1) | 2012-05-01 | Walker | Applicant |
| US2012/0158541(A1) | 2012-06-01 | Ganti et al. | Applicant |
| US2012/0158573(A1) | 2012-06-01 | Crocker | Applicant |
| US2012/0158574(A1) | 2012-06-01 | Brunzell et al. | Applicant |
| US2012/0259722(A1) | 2012-10-01 | Mikurak | Applicant |
| US2012/0262461(A1) | 2012-10-01 | Fisher et al. | Applicant |
| US2013/0018796(A1) | 2013-01-01 | Kolhatkar et al. | Applicant |
| US2014/0006166(A1) | 2014-01-01 | Chiang et al. | Applicant |
| US2014/0081832(A1) | 2014-03-01 | Merrill et al. | Applicant |
| US2014/0189829(A1) | 2014-07-01 | McLachlan et al. | Applicant |
| US2014/0214654(A1) | 2014-07-01 | Greenbaum et al. | Applicant |
| US2014/0222631(A1) | 2014-08-01 | Love et al. | Applicant |
| US2014/0236829(A1) | 2014-08-01 | Ganti | Applicant |
| US2014/0249872(A1) | 2014-09-01 | Stephan et al. | Applicant |
| US2014/0270145(A1) | 2014-09-01 | Erhart et al. | Applicant |
| US2014/0278839(A1) | 2014-09-01 | Lynam et al. | Applicant |
| US2014/0324564(A1) | 2014-10-01 | Walker et al. | Applicant |
| US2014/0337083(A1) | 2014-11-01 | Goyal et al. | Applicant |
| US2015/0106265(A1) | 2015-04-01 | Stubblefield et al. | Applicant |
| US2015/0117747(A1) | 2015-04-01 | Smith et al. | Applicant |
| US2015/0142595(A1) | 2015-05-01 | Acuna-Rohter | Applicant |
| US2015/0142713(A1) | 2015-05-01 | Gopinathan et al. | Applicant |
| US2015/0178371(A1) | 2015-06-01 | Seth et al. | Applicant |
| US2015/0201077(A1) | 2015-07-01 | Konig et al. | Applicant |
| US2015/0235240(A1) | 2015-08-01 | Chang et al. | Applicant |
| US2015/0254719(A1) | 2015-09-01 | Barfield, Jr. et al. | Applicant |
| US2015/0278944(A1) | 2015-10-01 | Searson et al. | Applicant |
| US2015/0287026(A1) | 2015-10-01 | Yang et al. | Applicant |
| US2016/0042359(A1) | 2016-02-01 | Singh | Applicant |
| US2016/0044054(A1) | 2016-02-01 | Stiansen et al. | Applicant |
| US2016/0055184(A1) | 2016-02-01 | Fokoue-Nkoutche et al. | Applicant |
| US2016/0080485(A1) | 2016-03-01 | Hamedi | Applicant |
| US2016/0098705(A1) | 2016-04-01 | Kurapati | Applicant |
| US2016/0132886(A1) | 2016-05-01 | Burke et al. | Applicant |
| US2016/0179877(A1) | 2016-06-01 | Koerner et al. | Applicant |
| US2016/0180726(A1) | 2016-06-01 | Ahuja et al. | Applicant |
| US2016/0225076(A1) | 2016-08-01 | Merrill et al. | Applicant |
| US2016/0247068(A1) | 2016-08-01 | Lin | Applicant |
| US2016/0373891(A1) | 2016-12-01 | Ramer et al. | Applicant |
| US2017/0032466(A1) | 2017-02-01 | Feldman et al. | Applicant |
| US2017/0041464(A1) | 2017-02-01 | Sharma | Applicant |
| US2017/0236125(A1) | 2017-08-01 | Guise et al. | Applicant |
| US2017/0289168(A1) | 2017-10-01 | Bar et al. | Applicant |
Non-Patent Literature (41)
- Jeffords, et. al., “New Technologies to Combat Check Fraud”, The CPA Journal, Mar. 1999, pp. 30-35.Applicant
- Non Final Office Action dated Apr. 15, 2020 for U.S. Appl. No. 15/495,716 “Process Re-Design Targeting Engine” Flowers, 31 pages.Applicant
- Non Final Office Action dated Apr. 29, 2020 for U.S. Appl. No. 15/495,724 “Financial Literacy Mentoring Assistant Engine” Flowers, 9 pages.Applicant
- Non Final Office Action dated May 1, 2020 for U.S. Appl. No. 15/495,549 “Heuristic Identity Authentication Engine” Flowers, 13 pages.Applicant
- Boldi, et. al., “Query Suggestions Using Query-Flow Graphs”, Proc. of the 2009 Workshop on Web Search Click Data, 2009, pp. 56-63.Applicant
- Madaan, et. al., “A Data Mining Approach to Predict Users' Next Question in QA System”, 2015 2nd International Conference on Computing for Sustainable Global Development, pp. 211-215.Applicant
- Ng'Ambi, “Pre-empting User Questions through Anticipation—Data Mining FAQ Lists”, Proc. of the 2002 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology, 2002, pp. 101-109.Applicant
- Final Office Action dated May 26, 2020 for U.S. Appl. No. 15/495,603 “Heuristic Money Laundering Detection Engine” Flowers, 12 pages.Applicant
- Non Final Office Action dated May 29, 2020 for U.S. Appl. No. 15/495,699 “Book of Business Impact Assessment Engine” Flowers, 14 pages.Applicant
- Non Final Office Action date Jun. 11, 2020 for U.S. Appl. No. 15/495,678 “Natural Language Troubleshooting Engine” Flowers, 15 pages.Applicant
- Sordoni, “A Hierarchical Recurrent Encoder-Decoder for Generative Context-Aware Query Suggestion”, Proc. of the 24th ACM International Conference on Information and Knowledge Management, 2015, pp. 553-562.Applicant
- Tyler, et. al., “Large Scale Query Log Analysis of Re-Finding”, Proc. of the 3rd ACM International Conference on Web Search and Data Mining, 2010, pp. 191-200.Applicant
- Cooper, et al., “An Evaluation of Machine-Learning Methods for Predicting Pneumonia Mortality” Artificial Intelligence in Medicine, vol. 9, Oct. 14, 1997, pp. 107-138.Applicant
- Kingston, et al., “Towards a Financial Fraud Ontology: A Legal Modelling Approach”, Artificial Intelligence and Law, (2004) 12 : DOI 10.1007/s10506-0005-4163-0, Springer 2006, pp. 419-446.Applicant
- Kotsiantis, et al., “Efficiency of Machine Learning Teghniques in Bankrupty Prediction”, 2nd International Conference on Enterprise Systems and Accounting, Jul. 11-12, 2005, Thessaloniki, Greece, pp. 39-49.Applicant
- Final Office Action dated Aug. 24, 2020 for U.S. Appl. No. 15/495,549, “Heuristic Identity Authentication Engine”, Flowers, 17 pages.Applicant
- Final Office Action dated Aug. 24, 2020 for U.S. Appl. No. 15/495,724, “Financial Literacy Mentoring Assistant Engine”, Flowers, 13 pages.Applicant
- Non Final Office Action dated Sep. 4, 2020 for U.S. Appl. No. 15/495,743, “Heuristic Sales Agent Training Assistant”, Flowers, 8 pages.Applicant
- Final Office Action dated Sep. 24, 2020 for U.S. Appl. No. 15/495,716, “Process Re-Design Targeting Engine”, Flowers, 32 pages.Applicant
- Zask, “Finding Financial Fraudsters: Quantitative and Behavioural Finance Approaches”, Journal of Securities Operations & Custody, vol. 6, No. 4, Mar. 10, 2014, pp. 308-324.Applicant
- Bishop, “Pattern Recognition and Machine Learning”, Springer Science, 2006, 758 pages.Applicant
- Jaroslav, et. al., “Internal Model of Commercial Bank as an Instrument for Measuring Credit Risk of the Borrower in Relation to Financial Performance (Credit Scoring and Bankruptcy Models)”, Journal of Competitiveness, Iss. 4, 2011, pp. 104-120.Applicant
- Final Office Action dated Jan. 22, 2020 for U.S. Appl. No. 15/495,743 “Heuristic Sales Agent Training Assistant” Flowers, 9 pages.Applicant
- Final Office Action dated Jan. 7, 2020 for U.S. Appl. No. 15/495,699 “Book of Business Impact Assessment Engine” Flowers, 26 pages.Applicant
- Office Action for U.S. Appl. No. 15/495,603, dated Dec. 9, 2019, Flowers,“Heuristic Money Laundering Detection Engine”, 20 Pages.Applicant
- U.S. Appl. No. 15/495,549, Heuristic Identity Authentication Engine, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,594, “Natural Language Virtual Assistant”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,603, “Heuristic Money Laundering Detection Engine”, Flowers et al., Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,621, “Heuristic Credit Risk Assessment Engine”, Flowers et al., Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,648, “Heuristic Document Verification and Real Time Deposit Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,659, “Heuristic Account Fraud Detection Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,678, “Natural Language Troubleshooting Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,693, “Cross Selling Recommendation Engine”, Flowers et al. filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,699, “Book of Business Impact Assessment Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,716, “Process Re-Design Targeting Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,724, “Financial Literacy Mentoring Assistant Engine”, Flowers et al., filed Apr. 24, 2017.Applicant
- U.S. Appl. No. 15/495,743, “Heuristic Sales Agent Training Assistant”, Flowers et al., filed Apr. 24, 2017.Applicant
- Final Office Action dated Jan. 13, 2021 for U.S. Appl. No. 15/495,743, “Heuristic Sales Agent Training Assistant”, Flower, 11 pages.Applicant
- Non Final Office Action dated Oct. 30, 2020 for U.S. Appl. No. 15/495,594, “Natural Language Virtual Assistant” Flowers, 28 pages.Applicant
- Final Office Action dated Nov. 5, 2020 for U.S. Appl. No. 15/495,699, “Book of Business Impact Assessment Engine”, Flowers, 22 pages.Applicant
- Final Office Action dated Dec. 23, 2020 for U.S. Appl. No. 15/495,678, “Natural Language Troubleshooting Engine”, Flowers, 15 pages.Applicant