Ticket embedding based on multi-dimensional IT data
An approach is provided that trains an artificial intelligence (AI) system, such as a neural network, to process IT ticket data. The approach receives IT tickets from various ticket sources. Ticket vectors corresponding to each of the IT tickets are computed. An analysis is performed using the ticket vectors and a node vector that corresponds to a network topology. The analysis is performed using a corpus of IT ticket data. An IT ticket model used by the AI system is trained based on the analysis. Responses are provided to requestors of the AI system using the trained IT ticket model.
1 . A computer-implemented method, implemented by an information handling system that includes a processor and a memory, the method comprising:
receiving a plurality of information technology (IT) tickets from one or more ticket sources;
calculating a topology graph comprising an edge weight of nodes, wherein the calculating comprises randomly discovering a relationship among connected nodes, and generating sampled series data describing a topology structure of a network, and wherein the edge weight is a sum of frequency of a ticket appearing in two adjacent nodes, based on one or more input parameters;
pre-processing the plurality of IT tickets using Doc2Vec to embed descriptive information of the IT tickets to generate a word-level vector;
using self-attention learning, merging the word-level vectors, outputting a weighted vector as a hidden input layer to train a neural network, until a loss gap between a softmax function and the hidden input layer is below a defined threshold; and
based on the loss gap between the softmax function and the hidden input layer being below the defined threshold, providing by a trained model, responses to one or more requestors of an artificial intelligence (AI) system using the trained IT ticket model.
2 . The method of claim 1 , wherein each of the ticket vectors includes the ticket vector and a side information vector, the method further comprising: gathering a set of side information corresponding to each of the IT tickets; and processing the gathered side information into the side information vector.
3 . The method of claim 2 wherein the side information includes at least one data item selected from the group consisting of a ticket comment, a ticket work note, a server location, a geographic location, and a customer identifier.
4 . The method of claim 2 further comprising:
selecting the ticket vector, the node vector, and the side information vector corresponding to a selected IT ticket; and
merging the selected ticket vector, the selected node vector, and the selected side information vector, the merging resulting in a set of hidden layer data that is utilized to train a neural network in the AI system.
5 . The method of claim 4 further comprising:
performing a self-attention process on the selected ticket vector, the selected node vector, and the selected side information vector, the self-attention process resulting in a weighted vector utilized to train the neural network.
6 . The method of claim 5 further comprising:
calculating a difference between a result of a softmax function performed on the weighted vector and the set of hidden layer data; and
repeatedly performing the self-attention process and the calculating until the difference is below a given threshold.
7 . The method of claim 1 further comprising:
generating the node vector by randomly traversing through a selected plurality of nodes from a set of sampled series data that describes a topology structure of a network;
calculating a weight between the selected plurality of nodes; and
utilizing a sampling strategy to describe a frequency of transitions between the selected plurality of nodes.
8 . An information handling system comprising:
one or more processors;
a memory coupled to at least one of the processors;
a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions comprising:
receiving a plurality of information technology (IT) tickets from one or more ticket sources;
calculating a topology graph comprising an edge weight of nodes, wherein the calculating comprises randomly discovering a relationship among connected nodes, and generating sampled series data describing a topology structure of a network, and wherein the edge weight is a sum of frequency of a ticket appearing in two adjacent nodes, based on one or more input parameters;
pre-processing the plurality of IT tickets using Doc2Vec to embed descriptive information of the IT tickets to generate a word-level vector;
using self-attention learning, merging the word-level vectors, outputting a weighted vector as a hidden input layer to train a neural network, until a loss gap between a softmax function and the hidden input layer is below a defined threshold; and
based on the loss gap between the softmax function and the hidden input layer being below the defined threshold, providing by a trained model, responses to one or more requestors of an artificial intelligence (AI) system using the trained IT ticket model.
9 . The information handling system of claim 8 , wherein each of the ticket vectors includes the ticket vector and a side information vector, wherein the actions further comprise:
gathering a set of side information corresponding to each of the IT tickets; and
processing the gathered side information into the side information vector.
10 . The information handling system of claim 9 wherein the side information includes at least one data item selected from the group consisting of a ticket comment, a ticket work note, a server location, a geographic location, and a customer identifier.
11 . The information handling system of claim 9 wherein the actions further comprise:
selecting the ticket vector, the node vector, and the side information vector corresponding to a selected IT ticket; and
merging the selected ticket vector, the selected node vector, and the selected side information vector, the merging resulting in a set of hidden layer data that is utilized to train a neural network in the AI system.
12 . The information handling system of claim 11 wherein the actions further comprise:
performing a self-attention process on the selected ticket vector, the selected node vector, and the selected side information vector, the self-attention process resulting in a weighted vector utilized to train the neural network.
13 . The information handling system of claim 12 wherein the actions further comprise:
calculating a difference between a result of a softmax function performed on the weighted vector and the set of hidden layer data; and
repeatedly performing the self-attention process and the calculating until the difference is below a given threshold.
14 . The information handling system of claim 8 wherein the actions further comprise:
generating the node vector by randomly traversing through a selected plurality of nodes from a set of sampled series data that describes a topology structure of a network;
calculating a weight between the selected plurality of nodes; and
utilizing a sampling strategy to describe a frequency of transitions between the selected plurality of nodes.
15 . A computer program product stored in a computer readable storage medium, comprising computer program code that, when executed by an information handling system, performs actions comprising:
receiving a plurality of information technology (IT) tickets from one or more ticket sources;
calculating a topology graph comprising an edge weight of nodes, wherein the calculating comprises randomly discovering a relationship among connected nodes, and generating sampled series data describing a topology structure of a network, and wherein the edge weight is a sum of frequency of a ticket appearing in two adjacent nodes, based on one or more input parameters;
pre-processing the plurality of IT tickets using Doc2Vec to embed descriptive information of the IT tickets to generate a word-level vector;
using self-attention learning, merging the word-level vectors, outputting a weighted vector as a hidden input layer to train a neural network, until a loss gap between a softmax function and the hidden input layer is below a defined threshold; and
based on the loss gap between the softmax function and the hidden input layer being below the defined threshold, providing by a trained model, responses to one or more requestors of an artificial intelligence (AI) system using the trained IT ticket model.
16 . The computer program product of claim 15 , wherein each of the ticket vectors includes the ticket vector and a side information vector, wherein the actions further comprise:
gathering a set of side information corresponding to each of the IT tickets; and
processing the gathered side information into the side information vector.
17 . The computer program product of claim 16 wherein the side information includes at least one data item selected from the group consisting of a ticket comment, a ticket work note, a server location, a geographic location, and a customer identifier.
18 . The computer program product of claim 16 wherein the actions further comprise:
selecting the ticket vector, the node vector, and the side information vector corresponding to a selected IT ticket; and
merging the selected ticket vector, the selected node vector, and the selected side information vector, the merging resulting in a set of hidden layer data that is utilized to train a neural network in the AI system.
19 . The computer program product of claim 18 wherein the actions further comprise:
performing a self-attention process on the selected ticket vector, the selected node vector, and the selected side information vector, the self-attention process resulting in a weighted vector utilized to train the neural network.
20 . The computer program product of claim 15 wherein the actions further comprise:
generating the node vector by randomly traversing through a selected plurality of nodes from a set of sampled series data that describes a topology structure of a network;
calculating a weight between the selected plurality of nodes; and
utilizing a sampling strategy to describe a frequency of transitions between the selected plurality of nodes.