Nikita Gautam

Nikita Gautam

Auto-generated profile, based on publicly available information

Nikita Gautam

Kansas State University,Department of Computer Science,Manhattan,Kansas,USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2025
Verified
Book Chapter
Closed access
PDF file
SNSanaz Saki Norouzi
Sanaz Saki Norouzi
ABAdrita Barua
Adrita Barua
ACAntrea Christou
Antrea Christou
NGNikita Gautam
Nikita Gautam
AEAndrew Eells
Andrew Eells
CSCogan Shimizu
Cogan Shimizu
Knowledge graphs (KGs) are increasingly utilized for data integration, representation, and visualization. While KG population is critical, it is often costly, especially when data must be extracted from unstructured text in natural language, which presents challenges, such as ambiguity and complex interpretations. Large Language Models (LLMs) offer promising capabilities for such tasks, excelling in natural language understanding and content generation. However, their tendency to “hallucinate” can produce inaccurate outputs. Despite these limitations, LLMs offer rapid and scalable processing of natural language data, and with prompt engineering and fine-tuning, they can approximate human-level performance in extracting and structuring data for KGs. This study investigates LLM effectiveness for the KG population, focusing on the Enslaved.org Hub Ontology. In this paper, we report that compared to the ground truth, LLM’s can extract ≈90% of triples, when provided a modular ontology as guidance in the prompts.

30 April 2023
Verified
Conference Paper
Open access
NGNikita Gautam
Nikita Gautam
DSDavid Shumway
David Shumway
MKMegan Kowalcyk
Megan Kowalcyk
SKSarthak Khanal
Sarthak Khanal
DCDoina Caragea
Doina Caragea
SDSamuel Dorevitch
Samuel Dorevitch
A knowledge graph focusing on water quality in relation to health risks posed by water activities (such as diving or swimming) is not currently available. To address this limitation, we first use existing resources to construct a knowledge graph relevant to water quality and health risks using KNowledge Acquisition and Representation Methodology (KNARM). Subsequently, we explore knowledge graph completion approaches for maintaining and updating the graph. Specifically, we manually identify a set of domain-specific UMLS concepts and use them to extract a graph of approximately 75,000 semantic triples from the Semantic MEDLINE database (which contains head-relation-tail triples extracted from PubMed). Using the resulting knowledge graph, we experiment with the KG-BERT approach for graph completion by employing pre-trained BERT/RoBERTa models and also models fine-tuned on a collection of water quality and health risks abstracts retrieved from the Web of Science. Experimental results show that KG-BERT with BERT/RoBERTa models fine-tuned on a domain-specific corpus improves the performance of KG-BERT with pre-trained models. Furthermore, KG-BERT gives better results than several translational distance or semantic matching baseline models.

15 May 2025
Verified
Journal Article
Open access
PDF file
KGKhushboo Gupta
Khushboo Gupta
NGNikita Gautam
Nikita Gautam
TSTiberiu Sosea
Tiberiu Sosea
DCDoina Caragea
Doina Caragea
Cornelia CarageaCornelia Caragea
Cornelia Caragea
Despite advancements in semi-supervised learning (SSL) techniques that can be used when labeled data is limited, many SSL approaches still face challenges related to miscalibration. Calibration is crucial for ensuring the accuracy, reliability, and robustness of uncertainty estimates. In this work, we analyze the calibration performance of various SSL methods in the disaster response domain. Our results show that traditional self-training (ST) and mixup-based SSL methods often suffer from high Expected Calibration Error (ECE) despite achieving competitive F1 scores. In contrast, a newly introduced approach in the disaster domain, AUM-ST-Mixup, significantly improves calibration, achieving the lowest ECE across all settings. This improvement suggests that incorporating uncertainty-awareselection via Area Under the Margin (AUM) alongside mixup regularization enhances both predictive performance and model confidence alignment. Our findings highlight the importance of calibration-aware SSL methods, paving the way for more trustworthy model predictions in low-resource settings.

2 July 2026
Verified
Book Chapter
Closed access
NGNikita Gautam
Nikita Gautam
GDGeorge Durrett
George Durrett
DCDoina Caragea
Doina Caragea
HBHeather Bailey
Heather Bailey

14 June 2026
Verified
Book Chapter
Closed access
NGNikita Gautam
Nikita Gautam
DCDoina Caragea
Doina Caragea
Ignacio Antonio CiampittiIgnacio Antonio Ciampitti
Ignacio Antonio Ciampitti
FGFederico Gomez
Federico Gomez

9 October 2025
Verified
Conference Paper
Closed access
NGNikita Gautam
Nikita Gautam
BPBipin Paudel
Bipin Paudel
DCDoina Caragea
Doina Caragea
CCCornelia Caragea
Cornelia Caragea
Relation extraction is an important task for understanding relationships between entities, building knowledge graphs, and facilitating knowledge discovery. Pre-trained models can be fine-tuned for relation extraction if a substantial amount of labeled data is available. However, acquiring extensive labeled data is generally challenging. Semi-supervised techniques for low-resource relation extraction, such as self-training, offer a promising solution by leveraging both limited labeled data and vast unlabeled data to mitigate this challenge. Traditional selftraining methods use a teacher-student framework, where a student is iteratively trained with pseudo-labels generated by the teacher. This may lead to noisy pseudo-labels and impact performance. To address this limitation, we introduce a new model called RE-AUM-LLM that generates high-quality pseudolabels using self-training combined with Area Under the Margin (AUM) and Large Language Models (LLMs), such as Llama 3.1. Experimental results on two benchmark datasets show that the proposed approach achieves state-of-the-art results for lowresource relation extraction by comparison with several strong baselines. We will make the code publicly available to enable reproducibility and further research in this area.