Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karan Bhukar

dblp:294/9958 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0009-7639-1670ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Information extraction and text analysis · 41% Question answering and dialogue systems · 41% Language models and text generation · 18%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software maintenance and evolution
log analysis
1.012026
Scalable and Efficient Large-Scale Log Analysis with LLMs: An IT Software Support Case Study · AAAI 2026
Natural language and speech › Information extraction and text analysis › dialogue analysis
conversation analysis
0.712023
End-to-End Deep Reinforcement Learning for Conversation Disentanglement · AAAI 2023
Natural language and speech › Question answering and dialogue systems › multi-party dialogue
dialogue disentanglement
0.712023
End-to-End Deep Reinforcement Learning for Conversation Disentanglement · AAAI 2023
Natural language and speech › Language models and text generation
large language model
0.312026
Scalable and Efficient Large-Scale Log Analysis with LLMs: An IT Software Support Case Study · AAAI 2026

Methods — techniques the papers use, named apart from their topics

retrieval-augmented generation · 2.0LLM inference on CPU · 2.0reward shaping · 0.7reinforcement learning · 0.7
YearPublicationVenuePosition
2026 Scalable and Efficient Large-Scale Log Analysis with LLMs: An IT Software Support Case Study
abstract
IT environments typically have logging mechanisms to monitor system health and detect issues. However, the huge volume of generated logs makes manual inspection impractical, highlighting the importance of automated log analysis in IT Software Support. In this paper, we propose a log analytics tool that leverages Large Language Models (LLMs) for log data processing and issue diagnosis, enabling the generation of automated insights and summaries. We further present a novel approach for efficiently running LLMs on CPUs to process massive log volumes in minimal time without compromising output quality. We share the insights and lessons learned from deployment of the tool - in production since March 2024 - scaled across 70 software products, processing over 2000 tickets for issue diagnosis, achieving a time savings of 300+ man hours and an estimated $15,444 per month in manpower costs compared to the traditional practices.
Pranjal Gupta, Karan Bhukar, Seema Nagar, Prateeti Mohapatra, Debanjana Kar
AAAI2
2023 Learning Representations on Logs for AIOps
abstract
AI for IT Operations (AIOps) is a powerful platform that Site Reliability Engineers (SREs) use to automate and streamline operational workflows with minimal human intervention. Automated log analysis is a critical task in AIOps as it provides key insights for SREs to identify and address ongoing faults. Tasks such as log format detection, log classification, and log parsing are key components of automated log analysis. Most of these tasks require supervised learning; however, there are multiple challenges due to limited labeled log data and the diverse nature of log data. Large Language Models (LLMs) such as BERT and GPT3 are trained using self-supervision on a vast amount of unlabeled data. These models provide generalized representations that can be effectively used for various downstream tasks with limited labeled data. Motivated by the success of LLMs in specific domains like science and biology, this paper introduces a LLM for log data which is trained on public and proprietary log data. Results of our experiments demonstrate that the proposed LLM outperforms existing models on multiple downstream tasks. In summary, AIOps powered by LLMs offers an efficient and effective solution for automating log analysis tasks and enabling SREs to focus on higher-level tasks. Our proposed LLM, trained on public and proprietary log data, offers superior performance on multiple downstream tasks, making it a valuable addition to the AIOps platform.
Pranjal Gupta, Debanjana Kar, Karan Bhukar, Pooja Aggarwal, Prateeti Mohapatra
CLOUD4
2023 End-to-End Deep Reinforcement Learning for Conversation Disentanglement
abstract
Collaborative Communication platforms (e.g., Slack) support multi-party conversations which contain a large number of messages on shared channels. Multiple conversations intermingle within these messages. The task of conversation disentanglement is to cluster these intermingled messages into conversations. Existing approaches are trained using loss functions that optimize only local decisions, i.e. predicting reply-to links for each message and thereby creating clusters of conversations. In this work, we propose an end-to-end reinforcement learning (RL) approach that directly optimizes a global metric. We observe that using existing global metrics such as variation of information and adjusted rand index as a reward for the RL agent deteriorates its performance. This behaviour is because these metrics completely ignore the reply-to links between messages (local decisions) during reward computation. Therefore, we propose a novel thread-level reward function that captures the global metric without ignoring the local decisions. Through experiments on the Ubuntu IRC dataset, we demonstrate that the proposed RL model improves the performance on both link-level and conversation-level metrics.
Karan Bhukar, Dinesh Raghu
AAAI1