• DocumentCode
    3719877
  • Title

    Recommending ticket resolution using feature adaptation

  • Author

    Wubai Zhou;Tao Li;Larisa Shwartz;Genady Ya. Grabarnik

  • Author_Institution
    School of Computing and Information Sciences, Florida International University, Miami, Florida 33199
  • fYear
    2015
  • Firstpage
    15
  • Lastpage
    21
  • Abstract
    In recent years, IT Service Providers have been rapidly introducing automation to their service delivery model. Driven by market pressure to reduce cost and maintain quality of services, they are looking for technologies that will allow rapid progress towards attainment of truly automated service delivery. Software monitoring systems are designed to actively collect and signal event occurrences and, when necessary, automatically generate incident tickets. Repeating events generate similar tickets, which in turn have a vast number of repeated problem resolutions likely to be found in earlier tickets. In our work, we develop techniques to recommend an appropriate resolution for incoming events by making use of similarities between the events and historical resolutions of similar events. The traditional KNN (K Nearest Neighbor) algorithm has been first applied to recommend resolutions for incoming tickets. Massive heterogeneous applications as well as various monitoring software are running on clients´ servers to accomplish required tasks and to monitor system health via different metrics. It leads to generation of correlated tickets that have different symptom descriptions but similar resolutions. Furthermore, change of servers´ environments can also induce similar situations in which ticket descriptions differ before and after change but could have similar resolutions. These correlated tickets cause performance degradation in ticket resolution recommendation. Therefore, we propose using SCL (structural corresponding learning) based feature adaptation to uncover feature mapping in different time intervals. Moreover, to put more insights into the periodic regularities existing in our ticket datasets, we apply our algorithm on tickets grouped by different time interval granularities. Extensive empirical evaluations on real-world ticket data sets demonstrate the effectiveness and efficiency of our proposed methods.
  • Keywords
    "Monitoring","Servers","Vocabulary","Software","Measurement","Training","Electronic mail"
  • Publisher
    ieee
  • Conference_Titel
    Network and Service Management (CNSM), 2015 11th International Conference on
  • Type

    conf

  • DOI
    10.1109/CNSM.2015.7367333
  • Filename
    7367333