Online IT ticket automation recommendation using hierarchical multi-armed bandit algorithms Conference

Wang, Q, Li, T, Iyengar, SS et al. (2018). Online IT ticket automation recommendation using hierarchical multi-armed bandit algorithms . 657-665. 10.1137/1.9781611975321.74

cited authors

  • Wang, Q; Li, T; Iyengar, SS; Shwartz, L; Grabarnik, GY

authors

abstract

  • The increasing complexity of IT environments urgently requires the use of analytical approaches and automated problem resolution for more efficient delivery of IT services. In this paper, we model the automation recommendation procedure of IT automation services as a contextual bandit problem with dependent arms, where the arms are in the form of hierarchies. Intuitively, different automations in IT automation services, designed to automatically solve the corresponding ticket problems, can be organized into a hierarchy by domain experts according to the types of ticket problems. We introduce a novel hierarchical multi-armed bandit algorithms leveraging the hierarchies, which can match the coarse-to-fine feature space of arms. Empirical experiments on a real large-scale ticket dataset have demonstrated substantial improvements over the conventional bandit algorithms. In addition, a case study of dealing with the cold-start problem is conducted to clearly show the merits of our proposed algorithms.

publication date

  • January 1, 2018

Digital Object Identifier (DOI)

start page

  • 657

end page

  • 665