Resolution Recommendation for Event Tickets in Service Management
Authors:
Open Access
- 7 July 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 13 (4) , 954-967
Abstract
In recent years, IT service providers have rapidly achieved an automated service delivery model. 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 this paper, we develop techniques to recommend appropriate resolution for incoming events by making use of similarities between the events and historical resolutions of similar events. Built on the traditional k-nearest neighbor algorithm (KNN), our proposed algorithms take into account false positives often generated by monitoring systems. An additional penalty is incorporated into the algorithms to control the number of misleading resolutions in the recommendation results. Moreover, as the effectiveness of the KNN heavily relies on the underlying similarity measurement, we proposed two other approaches to significantly improve our recommendation with respect to resolution relevance. One approach uses topic-level features to incorporate resolution information into the similarity measurement; the other uses metric learning to learn a more effective similarity measure. Extensive empirical evaluations on three ticket data sets demonstrate the effectiveness and efficiency of our proposed methods.Keywords
Funding Information
- U.S. National Science Foundation (HRD-0833093)
- U.S. National Science Foundation (IIS-1213026)
- U.S. National Science Foundation (CNS-1461926)
This publication has 40 references indexed in Scilit:
- Metric Learning: A SurveyFoundations and Trends in Machine Learning, 2013
- Monere: Monitoring of Service Compositions for Failure Diagnosis2011
- Repair vs. Recomposition for Broken Service Compositions2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- EasyTicketProceedings of the VLDB Endowment, 2008
- Profiling internet backbone traffic2005
- Item-based top-Nrecommendation algorithmsACM Transactions on Information Systems, 2004
- Learning a semantic space from user's relevance feedback for image retrievalIEEE Transactions on Circuits and Systems for Video Technology, 2003
- An Introduction to Kernel and Nearest-Neighbor Nonparametric RegressionThe American Statistician, 1992
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975