Divya S

Divya S


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
18 November 2024 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
DSDivya S
Divya S
SNSripriya N.
Sripriya N.
AJAndrew Jeyabose
Andrew Jeyabose
Manuel MazzaraManuel Mazzara
Manuel Mazzara
With the exponential proliferation of digital documents, there arises a pressing need for automated document summarization (ADS). Summarization, a compression technique, condenses a source document into concise sentences that encapsulate its salient information for summary generation. A primary challenge lies in crafting a dependable summary, contingent upon both extracted features and human-established parameters. This article introduces an intelligent methodology that seamlessly integrates extractive and abstractive techniques to ensure heightened relevance between the input document and its summary. Initially, input sentences undergo transformation into representations utilizing BERT, subsequently transposed into a symmetric matrix based on their similarity. Semantically congruent sentences are then extracted from this matrix to construct an extractive summary. The transformer model integrates an objective function highly symmetric and invariant under unitary transformation for language generation. This model refines the extracted informative sentences and generates an abstractive summary akin to manually crafted summaries. Employing this hybrid summarization technique on the CNN/DailyMail dataset and DUC2004, we evaluate its efficacy using ROUGE metrics. Results demonstrate the superiority of our proposed technique over conventional summarization methods.

24 May 2026
Verified
Book Chapter
Closed access
PDF file
KSK. B. Sundharakumar
K. B. Sundharakumar
SDS. Dhivya
S. Dhivya
SMS. Mohanavalli
S. Mohanavalli
NSN. Sripriya
N. Sripriya
DSDivya S
Divya S

6 May 2021
Verified
Book Chapter
Closed access
PDF file
DSDivya S
Divya S
RRR. Raghavi
R. Raghavi
NSN. Sripriya
N. Sripriya
SMS. Mohanavalli
S. Mohanavalli
SPS. Poornima
S. Poornima

29 May 2023
Verified
Book Chapter
Closed access
PDF file
DSDivya S
Divya S
NSN. Sripriya
N. Sripriya
DEDaphne Evangelin
Daphne Evangelin
GSG. Saai Sindhoora
G. Saai Sindhoora

27 February 2026 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
DSDivya S
Divya S
SNSripriya N.
Sripriya N.
The rapid growth of web documents has led to the need for automatic document summarization so readers can quickly browse the document for information. The challenge in extractive summarization is extracting the relevant information while ignoring redundant content to generate a precise summary. This article introduces a hybrid clustering algorithm that ignores outliers to eliminate irrelevant content and group similar sentences. The proposed methodology combines the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) and Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) algorithms, with DBSCAN forming densely coupled clusters and BIRCH splitting these massive clusters into sub-clusters. This hybrid approach facilitates effective sentence selection from each cluster and overcomes the limitations found when using DBSCAN and BIRCH individually. This proposed method further addresses the arbitrary decision issues found in hierarchical clustering by carefully tuning the Epsilon (ε) and MinPts parameters of DBSCAN to manage larger datasets. The systematic evaluation of the proposed summarization model using hybrid clustering was performed using the CNN/DailyMail dataset and measured in terms of Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metrics. The model achieved values of 0.429, 0.213, and 0.371 for ROUGE-1, ROUGE-2, and ROUGE-L, respectively. The proposed summarization model outperforms the state-of-the-art unsupervised and supervised automatic text summarization models.