Summarization of Document using Feature Selection Method: TF-IDF

In NLP, text summarization is the technique of condensing information from huge texts to smaller one.The phases in the summarization process includes reading the texts, normalizing the data, removing stop words, stemming, morphological analysis, and producing the summary.It falls under the extractive, abstractive, and hybrid categories.For the suggested Indian Language text summarization, extractive text summarization is being used.One method for extractive text summarization is PageRank.Each sentence in the document functions as a vertex on a graph, which is the basis of how it functions.Each node's initial score is determined by the number of words in the sentence, and the edges between nodes are determined by the cosine similarity of the sentences preprocessing, feature extraction, and graph building are the three main processes in PageRank technique.For a better understanding of the context, one of the simple things to take is feature extraction.We employ a specific way to apply weights to specific terms in our document before modeling them once the initial text has been cleaned and normalized.TF-IDF (Term Frequency-Inverse Document Frequency) is used for CNN dataset which produces better summary as compared to bag of words.Precision, recall and f score is calculated for generated summary and tf idf delivers best result.

Authors

Institutions

Publication Details

Journal
International Journal of Computer Applications
Published
2025-01-22
DOI
https://doi.org/10.5120/icaidsc202409
Citations
1
Primary Topic
Advanced Text Analysis Techniques
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Summarization of Document using Feature Selection Method: TF-IDF

Jyotirmayee Rautaray, Pranati Mishra, Dipankar Jena
1 citations
International Journal of Computer Applications
Advanced Text Analysis Techniques
2.48
article

Summarization of Document using Feature Selection Method: TF-IDF

Jyotirmayee Rautaray, Pranati Mishra, Dipankar Jena
article en
1 citations

Abstract

In NLP, text summarization is the technique of condensing information from huge texts to smaller one.The phases in the summarization process includes reading the texts, normalizing the data, removing stop words, stemming, morphological analysis, and producing the summary.It falls under the extractive, abstractive, and hybrid categories.For the suggested Indian Language text summarization, extractive text summarization is being used.One method for extractive text summarization is PageRank.Each sentence in the document functions as a vertex on a graph, which is the basis of how it functions.Each node's initial score is determined by the number of words in the sentence, and the edges between nodes are determined by the cosine similarity of the sentences preprocessing, feature extraction, and graph building are the three main processes in PageRank technique.For a better understanding of the context, one of the simple things to take is feature extraction.We employ a specific way to apply weights to specific terms in our document before modeling them once the initial text has been cleaned and normalized.TF-IDF (Term Frequency-Inverse Document Frequency) is used for CNN dataset which produces better summary as compared to bag of words.Precision, recall and f score is calculated for generated summary and tf idf delivers best result.

International Journal of Computer ApplicationsVol. ICAIDSC2023(1)
Odisha University of Agriculture and Technology (IN)
Openalex Percentile: Top 12%
Advanced Text Analysis Techniques
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.