Abstract: A method for performing time constrained queries for event sequence visualization may include receiving an event sequence dataset including event sequences. Each event sequence includes at least two sequentially occurring events. The method further includes generating a forward index having event pattern sets that include pattern occurrence data for each event sequence positioned according to a fixed positional order. The method includes generating a time constraint search structure, such as a B?tree, B+tree, or table, that includes keys and pointer values. The method also includes inserting, into the search structure, a sequence identifier corresponding to each event sequence based on the fixed positional order and time interval data for the at least two sequentially occurring events of each event sequence.

Abstract: A method for performing time constrained queries for event sequence visualization may include receiving an event sequence dataset including event sequences. Each event sequence includes at least two sequentially occurring events. The method further includes generating a forward index having event pattern sets that include pattern occurrence data for each event sequence positioned according to a fixed positional order. The method includes generating a time constraint search structure, such as a B?tree, B+tree, or table, that includes keys and pointer values. The method also includes inserting, into the search structure, a sequence identifier corresponding to each event sequence based on the fixed positional order and time interval data for the at least two sequentially occurring events of each event sequence.

Abstract: A method for performing attribute constrained queries for event sequence visualization may include receiving an event sequence dataset including event sequences. The method further includes determining singleton events in the dataset, where each singleton event is associated with an attribute. The method also includes generating event pattern sets corresponding to different distinct singleton events and that maintain a fixed positional order for each event sequence. The event pattern sets include pattern occurrence data for each event sequence positioned according to the fixed positional order. The method also includes identifying the fixed positional order maintained by each event pattern set, and generating an attribute constraint search structure, such as a B-tree, B+tree, or table, that includes keys and pointer values.

Abstract: A method for generating an inverted search index for event sequence visualization may include determining, from an event sequence dataset containing event sequences and events, event pair combinations based on identified unique singleton events. The method may further include establishing a positional ordering for each singleton event and each event pair combination and generating a respective event sequence set for each event sequence. The method may also include determining whether each unique singleton event and each event pair combination exists or does not exist within each event sequence, and populating, for each respective event sequence set and according to the positional ordering, data indicative of whether each unique singleton event and each event pair combination exists or does not exist within the event sequence for the respective event sequence set. The method may also include generating the inverted search index including each respective event sequence set for each event sequence.

Abstract: A method for reducing noise for event sequence visualization according to an embodiment includes identifying patterns of events from an event sequence dataset, wherein the event sequence dataset includes data for a plurality of event sequences, and wherein each event sequence of the plurality of events sequences includes at least one event, encoding each event sequence of the plurality of event sequences into a respective vector embedding based on the identified patterns of events to generate a plurality of vectors, executing a clustering algorithm on the plurality of vectors to generate a plurality of clusters, assigning each event sequence of the plurality of event sequences to a respective cluster of the plurality of clusters, generating a reduced dataset based on the assignment of the plurality of event sequences to the plurality of clusters, and building a data structure for event sequence visualization based on the reduced dataset.

Abstract: A method for filtering a Trie data structure for real-time bot flow visualization according to an embodiment includes receiving data associated with the Trie data structure, wherein the Trie data structure includes data for a plurality of contact center bot flows of an organization, and wherein each bot flow of the plurality of contact center bot flows includes at least one event, receiving a user selection associated with filtering the Trie data structure for modified visualization of the Trie data structure, performing a search of the Trie data structure to identify events of the Trie data structure to be deleted, deleting the identified events to generate an updated Trie data structure, updating event attributes of remaining events of the updated Trie data structure in response to deleting the identified events, and providing the updated Trie data structure for real-time bot flow visualization.

Abstract: A method for providing efficient trie data structure processing according to an embodiment includes splitting, based on organization identifiers and sequence identifiers, a data frame indicative of a set of events associated with customer interactions with automated agents of a contact center to produce a set of multiple partitions, and producing a set of multiple trie data structures, including generating a trie data structure for each partition. Each trie data structure represents aggregate counts of a corresponding subset of event sequences associated with a corresponding organization. The method also includes merging multiple trie data structures of the set of trie data structures to produce a combined organization trie data structure and storing the combined organization trie data structure to enable generation of a visualization of the combined organization trie data structure.

Abstract: A method for efficiently encoding a trie data structure for transmission according to an embodiment includes receiving an application programming interface (API) request pertaining to the trie data structure that is indicative of flows of customer interactions with automated agents of a contact center, obtaining the trie data structure in which each of multiple nodes has an associated prefix key that defines a path from a root to the corresponding node, and encoding the nodes in a transmission format having a dictionary data structure. The nodes in the transmission format do not have the prefix key that defines the path from the root to the corresponding node. The method also includes transmitting a response to the API request based on the trie data structure encoded in the transmission format.

Abstract: A method for filtering a Trie data structure for real-time bot flow visualization according to an embodiment includes receiving data associated with the Trie data structure, wherein the Trie data structure includes data for a plurality of contact center bot flows of an organization, and wherein each bot flow of the plurality of contact center bot flows includes at least one event, receiving a user selection associated with filtering the Trie data structure for modified visualization of the Trie data structure, performing a search of the Trie data structure to identify events of the Trie data structure to be deleted, deleting the identified events to generate an updated Trie data structure, updating event attributes of remaining events of the updated Trie data structure in response to deleting the identified events, and providing the updated Trie data structure for real-time bot flow visualization.

Abstract: A method of determining operational advantages associated with prospective use by a contact center of a predictive routing model. The operational advantages may include quantifying an expected lift in a target metric. The method includes: receiving an operational dataset associated with a time period of operation for the contact center; providing the predictive routing model configured to predict a score for the target metric for a given agent for a given interaction based on agent characteristic data associated with the given agent and interaction data associated with the given interaction; and, using the received predictive routing model, operational dataset, and agent characteristic data, computing the expected lift in the target metric assuming use of the predictive routing model during the time period. The algorithm used to compute the lift in the target metric is based on individual agent occupancy levels.

Abstract: A method that includes the steps of: generating, via a training data process, training data samples from respective journey data samples, the journey data samples comprising a customer journey represented by a sequence of events, values associated with respective event attributes, and journey outcome; and training a machine learning model using the training data samples. The training data process includes generating a vector embedding for each of the events included within the journey data samples that captures the value for each of the event attributes by: dividing the list of event into low and high cardinality groups via a cardinality threshold; for the low cardinality groups, categorically encoding the values according to a total number of unique values appearing therein; for the high cardinality groups: clustering the values and categorically encoding the values according to the group it resides in.

Abstract: A method for operationally transitioning between a first and second model in a contact center. The method includes defining a transition window and a pre-transition window. The method includes, during the pre-transition window, using the first model to determine first outputs and, therefrom, determining first output probability distributions and using, in real-time, the first outputs operationally in relation to pre-transition customers.

Abstract: A system and method are presented relating to emotion-based action recommendations. The present invention may include a recommender engine that analyzes several pieces of information and using artificial intelligence derived models, provides a course of action for a contact center agent and the probability and estimations behind the recommendation as a justification. System inputs include cost of the item or service being troubleshooted, estimated costs for different resolutions, cost of each escalation level of the interaction, history of previous interactions, agent costs, history of the current interaction, acoustic events and sentiment or primary detected emotions of the customer's transcript. The recommended course of action, rationale, and authorization can be provided as output. The system may record whether the agent followed the recommendation to improve further recommendations.

Abstract: A system and method are presented relating to emotion-based action recommendations. The present invention may include a recommender engine that analyzes several pieces of information and using artificial intelligence derived models, provides a course of action for a contact center agent and the probability and estimations behind the recommendation as a justification. System inputs include cost of the item or service being troubleshooted, estimated costs for different resolutions, cost of each escalation level of the interaction, history of previous interactions, agent costs, history of the current interaction, acoustic events and sentiment or primary detected emotions of the customer's transcript. The recommended course of action, rationale, and authorization can be provided as output. The system may record whether the agent followed the recommendation to improve further recommendations.

Abstract: A system and method for engaging in an automated dialog with a user. A processor retrieves a preset dialog flow that includes various blocks directing the dialog with the user. The processor provides a prompt to the user based on a current block of the dialog flow, receives an action from the user in response to the prompt, and retrieves a classification/decision tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow. Each of the nodes represents a user intent. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is further identified based on the selected node, and a response is output in response to the identified target block.

Abstract: A method for engaging in an automated dialog with a user that includes: retrieving a preset dialog flow that includes various blocks directing the dialog with the user; providing a prompt to the user based on a current block of the dialog flow; receiving an action from the user in response to the prompt; and retrieving a classification tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow representing user intents. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is identified based on the selected node, and a response is output in response to the identified target block.

Abstract: A method for engaging in an automated dialog with a user that includes: retrieving a preset dialog flow that includes various blocks directing the dialog with the user; providing a prompt to the user based on a current block of the dialog flow; receiving an action from the user in response to the prompt; and retrieving a classification tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow representing user intents. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is identified based on the selected node, and a response is output in response to the identified target block.

Abstract: A system and method for engaging in an automated dialog with a user. A processor retrieves a preset dialog flow that includes various blocks directing the dialog with the user. The processor provides a prompt to the user based on a current block of the dialog flow, receives an action from the user in response to the prompt, and retrieves a classification/decision tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow. Each of the nodes represents a user intent. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is further identified based on the selected node, and a response is output in response to the identified target block.

Abstract: A system and method for engaging in an automated dialog with a user. A processor retrieves a preset dialog flow that includes various blocks directing the dialog with the user. The processor provides a prompt to the user based on a current block of the dialog flow, receives an action from the user in response to the prompt, and retrieves a classification/decision tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow. Each of the nodes represents a user intent. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is further identified based on the selected node, and a response is output in response to the identified target block.

Abstract: A system and method for engaging in an automated dialog with a user. A processor retrieves a preset dialog flow that includes various blocks directing the dialog with the user. The processor provides a prompt to the user based on a current block of the dialog flow, receives an action from the user in response to the prompt, and retrieves a classification/decision tree corresponding to the dialog flow. The classification tree has a plurality of nodes mapped to the blocks of the dialog flow. Each of the nodes represents a user intent. The processor computes a probability for each of the nodes based on the action from the user. A particular one of the nodes is then selected based on the computed probabilities. A target block of the dialog flow is further identified based on the selected node, and a response is output in response to the identified target block.