Classifying the Unstructured IT Service Desk Tickets Using Ensemble of Classifiers

• URL: http://arxiv.org/abs/2103.15822v1
• Date: Tue, 30 Mar 2021 04:35:51 GMT
• Title: Classifying the Unstructured IT Service Desk Tickets Using Ensemble of Classifiers
• Authors: Ramya C, Paramesh S.P, Dr. Shreedhara K S
• Abstract summary: Manual classification of IT service desk tickets may result in routing of the tickets to the wrong resolution group. Traditional machine learning algorithms can be used to automatically classify the IT service desk tickets. The performance of the traditional classifier systems can be further improved by using various ensemble of classification techniques.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Manual classification of IT service desk tickets may result in routing of the tickets to the wrong resolution group. Incorrect assignment of IT service desk tickets leads to reassignment of tickets, unnecessary resource utilization and delays the resolution time. Traditional machine learning algorithms can be used to automatically classify the IT service desk tickets. Service desk ticket classifier models can be trained by mining the historical unstructured ticket description and the corresponding label. The model can then be used to classify the new service desk ticket based on the ticket description. The performance of the traditional classifier systems can be further improved by using various ensemble of classification techniques. This paper brings out the three most popular ensemble methods ie, Bagging, Boosting and Voting ensemble for combining the predictions from different models to further improve the accuracy of the ticket classifier system. The performance of the ensemble classifier system is checked against the individual base classifiers using various performance metrics. Ensemble of classifiers performed well in comparison with the corresponding base classifiers. The advantages of building such an automated ticket classifier systems are simplified user interface, faster resolution time, improved productivity, customer satisfaction and growth in business. The real world service desk ticket data from a large enterprise IT infrastructure is used for our research purpose.

Related papers

• TickIt: Leveraging Large Language Models for Automated Ticket Escalation [13.95803287903968]
  This paper introduces TickIt, an innovative online ticket escalation framework powered by Large Language Models. By deploying TickIt in ByteDance's cloud service platform Volcano Engine, we validate its efficacy and practicality.
  arXiv  Detail & Related papers  (2025-04-11T12:06:47Z)
• Towards Model-Driven Dashboard Generation for Systems-of-Systems [52.251635013691256]
  This paper describes a model-driven technology-agnostic approach that can automatically transform a simple list of dashboard models into a dashboard model. Dashboard customization can be efficiently obtained by solely modifying the abstract model representation.
  arXiv  Detail & Related papers  (2024-02-23T10:55:18Z)
• Learning Fair Ranking Policies via Differentiable Optimization of Ordered Weighted Averages [55.04219793298687]
  This paper shows how efficiently-solvable fair ranking models can be integrated into the training loop of Learning to Rank. In particular, this paper is the first to show how to backpropagate through constrained optimizations of OWA objectives, enabling their use in integrated prediction and decision models.
  arXiv  Detail & Related papers  (2024-02-07T20:53:53Z)
• CLASSify: A Web-Based Tool for Machine Learning [0.0]
  This article presents an automated tool for machine learning classification problems to simplify the process of training models and producing results while providing informative visualizations and insights into the data. We present CLASSify, an open-source tool for solving classification problems without the need for knowledge of machine learning.
  arXiv  Detail & Related papers  (2023-10-05T15:51:36Z)
• Multi-output Headed Ensembles for Product Item Classification [0.9053163124987533]
  We propose a deep learning based classification model framework for e-commerce catalogs. We show improvements against robust industry standard baseline models. We also propose a novel way to evaluate model performance using user sessions.
  arXiv  Detail & Related papers  (2023-07-29T01:23:36Z)
• Ticket-BERT: Labeling Incident Management Tickets with Language Models [1.6556358263455926]
  Ticket- BERT trains a simple yet robust language model for labeling tickets using proposed ticket datasets. We further encapsulate Ticket-BERT with an active learning cycle and deploy it on the Microsoft IcM system.
  arXiv  Detail & Related papers  (2023-06-30T19:48:25Z)
• ProTeCt: Prompt Tuning for Taxonomic Open Set Classification [59.59442518849203]
  Few-shot adaptation methods do not fare well in the taxonomic open set (TOS) setting. We propose a prompt tuning technique that calibrates the hierarchical consistency of model predictions. A new Prompt Tuning for Hierarchical Consistency (ProTeCt) technique is then proposed to calibrate classification across label set granularities.
  arXiv  Detail & Related papers  (2023-06-04T02:55:25Z)
• AutoCl : A Visual Interactive System for Automatic Deep Learning Classifier Recommendation Based on Models Performance [0.0]
  We introduce AutoCl, a visual interactive recommender system aimed at helping non-experts to adopt an appropriate deep learning (DL) classifier. We compare features of AutoCl against several recent AutoML systems and show that it helps non-experts better in choosing DL classifier.
  arXiv  Detail & Related papers  (2022-02-24T07:02:37Z)
• Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification [94.55805516167369]
  We propose a new approach for binary classification from m U-sets for $mge2$. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
  arXiv  Detail & Related papers  (2021-02-01T07:36:38Z)
• Meta Learning for Few-Shot One-class Classification [0.0]
  We formulate the learning of meaningful features for one-class classification as a meta-learning problem. To learn these representations, we require only multiclass data from similar tasks. We validate our approach by adapting few-shot classification datasets to the few-shot one-class classification scenario.
  arXiv  Detail & Related papers  (2020-09-11T11:35:28Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)
• Federated Learning with Only Positive Labels [71.63836379169315]
  We propose a generic framework for training with only positive labels, namely Federated Averaging with Spreadout (FedAwS) We show, both theoretically and empirically, that FedAwS can almost match the performance of conventional learning where users have access to negative labels.
  arXiv  Detail & Related papers  (2020-04-21T23:35:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.