Abstract: A computer-implemented method for generating and deploying a reinforced learning model to train a chatbot. The method includes selecting a plurality of conversations, wherein each conversation includes an agent and a user. The method includes identifying, in each of the conversations, a set of turns and on or more topics. The method further includes associating one or more topics to each turn of the set of turns. The method includes, generating a conversation flow for each conversation, wherein the conversation flow identifies a sequence of the topics. The method includes applying an outcome score to each conversation. The method includes creating a reinforced learning (RL) model, wherein the RL model includes a Markov is based on the conversation flow of each conversation and the outcome score of each conversation. The method includes deploying the RL model, wherein the deploying includes sending the RL model to a chatbot.

Abstract: Embodiments of the invention include method, systems and computer program products for document vectorization. Aspects include receiving, by a processor, a plurality of documents each having a plurality of word. The processor utilizing a vector embeddings engine generates a vector to represent each of the plurality of words in the plurality of documents. An image representation for each document in the plurality of documents is created and a word probability for each of the plurality of words in the plurality of documents is generated. A position for each word probability is determined in the image based on the vector associated with each word and a compression operation on the images is performed to produce a compact representation for the plurality of documents.

Abstract: A computer-implemented method for generating and deploying a reinforced learning model to train a chatbot. The method includes selecting a plurality of conversations, wherein each conversation includes an agent and a user. The method includes identifying, in each of the conversations, a set of turns and on or more topics. The method further includes associating one or more topics to each turn of the set of turns. The method includes, generating a conversation flow for each conversation, wherein the conversation flow identifies a sequence of the topics. The method includes applying an outcome score to each conversation. The method includes creating a reinforced learning (RL) model, wherein the RL model includes a Markov is based on the conversation flow of each conversation and the outcome score of each conversation. The method includes deploying the RL model, wherein the deploying includes sending the RL model to a chatbot.

Abstract: Embodiments for providing rare topic detection using hierarchical topic modeling by a processor. A hierarchical topic model may be learned from one or more data sources. One or more dominant words in a selected cluster may be iteratively removed using the hierarchical topic model. The dominant words may relate to one or more primary topics of the cluster. The learned hierarchical topic model may be seeded with one or more words, n-grams, phrases, text snippets, or a combination thereof to evolve the hierarchical topic model and the removed domain words are reinstated upon completion of the seeding.

Abstract: A parse tree corresponding to a portion of narrative text is constructed. The parse tree includes a data structure representing a syntactic structure of the portion of narrative text as a set of tokens according to a grammar. Using a token in the parse tree as a focus word, a context window comprising a set of words within a specified distance from the focus word is generated, the distance determined according to a number of links of the parse tree separating the focus word and a context word in the set of words. A weight is generated for the focus word and the context word. Using the weight, a first vector representation of a first word is generated, the first word being within a second portion of narrative text.

Abstract: Various embodiments are provided for managing queuing policies in a computing environment. Data packets may be classified into one of a plurality of queues based on information extracted from one or more multipath data flows. The data packets in the plurality of queues may be scheduled and sent according to one or more multipath data flows.

Abstract: A parse tree corresponding to a portion of narrative text is constructed. The parse tree includes a data structure representing a syntactic structure of the portion of narrative text as a set of tokens according to a grammar. Using a token in the parse tree as a focus word, a context window comprising a set of words within a specified distance from the focus word is generated, the distance determined according to a number of links of the parse tree separating the focus word and a context word in the set of words. A weight is generated for the focus word and the context word. Using the weight, a first vector representation of a first word is generated, the first word being within a second portion of narrative text.

Abstract: Various embodiments are provided for managing queuing policies in a computing environment. Data packets may be classified into one of a plurality of queues based on information extracted from one or more multipath data flows. The data packets in the plurality of queues may be scheduled and sent according to one or more multipath data flows.

Abstract: Embodiments of the invention include method, systems and computer program products for document vectorization. Aspects include receiving, by a processor, a plurality of documents each having a plurality of word. The processor utilizing a vector embeddings engine generates a vector to represent each of the plurality of words in the plurality of documents. An image representation for each document in the plurality of documents is created and a word probability for each of the plurality of words in the plurality of documents is generated. A position for each word probability is determined in the image based on the vector associated with each word and a compression operation on the images is performed to produce a compact representation for the plurality of documents.