Ticket-BERT: Labeling Incident Management Tickets with Language Models

• URL: http://arxiv.org/abs/2307.00108v1
• Date: Fri, 30 Jun 2023 19:48:25 GMT
• Title: Ticket-BERT: Labeling Incident Management Tickets with Language Models
• Authors: Zhexiong Liu, Cris Benge, Siduo Jiang
• Abstract summary: 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.
• Score: 1.6556358263455926
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An essential aspect of prioritizing incident tickets for resolution is efficiently labeling tickets with fine-grained categories. However, ticket data is often complex and poses several unique challenges for modern machine learning methods: (1) tickets are created and updated either by machines with pre-defined algorithms or by engineers with domain expertise that share different protocols, (2) tickets receive frequent revisions that update ticket status by modifying all or parts of ticket descriptions, and (3) ticket labeling is time-sensitive and requires knowledge updates and new labels per the rapid software and hardware improvement lifecycle. To handle these issues, we introduce Ticket- BERT which trains a simple yet robust language model for labeling tickets using our proposed ticket datasets. Experiments demonstrate the superiority of Ticket-BERT over baselines and state-of-the-art text classifiers on Azure Cognitive Services. We further encapsulate Ticket-BERT with an active learning cycle and deploy it on the Microsoft IcM system, which enables the model to quickly finetune on newly-collected tickets with a few annotations.

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)
• A Simple Baseline for Predicting Events with Auto-Regressive Tabular Transformers [70.20477771578824]
  Existing approaches to event prediction include time-aware positional embeddings, learned row and field encodings, and oversampling methods for addressing class imbalance. We propose a simple but flexible baseline using standard autoregressive LLM-style transformers with elementary positional embeddings and a causal language modeling objective. Our baseline outperforms existing approaches across popular datasets and can be employed for various use-cases.
  arXiv  Detail & Related papers  (2024-10-14T15:59:16Z)
• TF-CLIP: Learning Text-free CLIP for Video-based Person Re-Identification [60.5843635938469]
  We propose a novel one-stage text-free CLIP-based learning framework named TF-CLIP for video-based person ReID. More specifically, we extract the identity-specific sequence feature as the CLIP-Memory to replace the text feature. Our proposed method shows much better results than other state-of-the-art methods on MARS, LS-VID and iLIDS-VID.
  arXiv  Detail & Related papers  (2023-12-15T09:10:05Z)
• FLIP: Fine-grained Alignment between ID-based Models and Pretrained Language Models for CTR Prediction [49.510163437116645]
  Click-through rate (CTR) prediction plays as a core function module in personalized online services. Traditional ID-based models for CTR prediction take as inputs the one-hot encoded ID features of tabular modality. Pretrained Language Models(PLMs) has given rise to another paradigm, which takes as inputs the sentences of textual modality. We propose to conduct Fine-grained feature-level ALignment between ID-based Models and Pretrained Language Models(FLIP) for CTR prediction.
  arXiv  Detail & Related papers  (2023-10-30T11:25:03Z)
• Substituting Data Annotation with Balanced Updates and Collective Loss in Multi-label Text Classification [19.592985329023733]
  Multi-label text classification (MLTC) is the task of assigning multiple labels to a given text. We study the MLTC problem in annotation-free and scarce-annotation settings in which the magnitude of available supervision signals is linear to the number of labels. Our method follows three steps, (1) mapping input text into a set of preliminary label likelihoods by natural language inference using a pre-trained language model, (2) calculating a signed label dependency graph by label descriptions, and (3) updating the preliminary label likelihoods with message passing along the label dependency graph.
  arXiv  Detail & Related papers  (2023-09-24T04:12:52Z)
• Exploring Structured Semantic Prior for Multi Label Recognition with Incomplete Labels [60.675714333081466]
  Multi-label recognition (MLR) with incomplete labels is very challenging. Recent works strive to explore the image-to-label correspondence in the vision-language model, ie, CLIP, to compensate for insufficient annotations. We advocate remedying the deficiency of label supervision for the MLR with incomplete labels by deriving a structured semantic prior.
  arXiv  Detail & Related papers  (2023-03-23T12:39:20Z)
• Label Semantics for Few Shot Named Entity Recognition [68.01364012546402]
  We study the problem of few shot learning for named entity recognition. We leverage the semantic information in the names of the labels as a way of giving the model additional signal and enriched priors. Our model learns to match the representations of named entities computed by the first encoder with label representations computed by the second encoder.
  arXiv  Detail & Related papers  (2022-03-16T23:21:05Z)
• Hierarchical Character Tagger for Short Text Spelling Error Correction [27.187562419222218]
  We present a Hierarchical Character Tagger model, or HCTagger, for short text spelling error correction. We use a pre-trained language model at the character level as a text encoder, and then predict character-level edits to transform the original text into its error-free form with a much smaller label space. Experiments on two public misspelling correction datasets demonstrate that HCTagger is an accurate and much faster approach than many existing models.
  arXiv  Detail & Related papers  (2021-09-29T08:04:34Z)
• Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization [65.23099004725461]
  We study such a collection of tickets, which is referred to as "winning tickets", in extremely over-parametrized models. We observe that at certain compression ratios, generalization performance of the winning tickets can not only match, but also exceed that of the full model.
  arXiv  Detail & Related papers  (2021-05-25T15:10:05Z)
• Classifying the Unstructured IT Service Desk Tickets Using Ensemble of Classifiers [0.0]
  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.
  arXiv  Detail & Related papers  (2021-03-30T04:35:51Z)
• Research on Fast Text Recognition Method for Financial Ticket Image [5.371241477007343]
  In the financial accounting field, the rapid increase in the number of financial tickets dramatically increases labor costs. This paper first analyzes the different features of 482 kinds of financial tickets, divides all kinds of financial tickets into three categories and proposes different recognition patterns for each category. According to the characteristics of the financial ticket text, in order to obtain higher recognition accuracy, the loss function, Region Proposal Network (RPN) and Non-Maximum Suppression (NMS) are improved.
  arXiv  Detail & Related papers  (2021-01-05T01:42:35Z)
• Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks [82.52404247479359]
  Early-bird (EB) tickets can be identified at the very early training stage. We propose a mask distance metric that can be used to identify EB tickets with low computational overhead.
  arXiv  Detail & Related papers  (2019-09-26T07:43:56Z)

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.