DocumentCode
1802484
Title
Algebraic reduction in automatic text summarization – the state of the art
Author
Batcha, Nowshath Kadhar ; Zaki, Ahmed M.
Author_Institution
Dept. of Comput. Sci., Int. Islamic Univ., Malaysia
fYear
2010
fDate
11-12 May 2010
Firstpage
1
Lastpage
6
Abstract
Various kinds of information that is available on a topic electronically has abundantly increased over the past years. It has led the information highway to a situation called “information overload” problem. Automatic text summarization technique mainly addresses this issue by the extraction of a shortened version of information from texts written about the same topic. Several algebraic reduction methods are used to identify and extract the semantically important texts in a document to summarize it automatically. This paper attempts to provide a background study of the various classical methods proposed by researchers for automatic text summarization. Special focus is given to the most widely used algebraic methods called Singular Value Decomposition (SVD) and Non-negative Matrix Factorization (NMF). This work sheds more light on the application of SVD and NMF techniques on automatic text summarization. Attention is also devoted in this work to analyze the advantages and disadvantages of each approach.
Keywords
knowledge acquisition; singular value decomposition; text analysis; NMF; SVD; algebraic reduction; automatic text summarization; information overload problem; nonnegative matrix factorization; singular value decomposition; Computers; Feature extraction; Matrix decomposition; Noise; Pragmatics; Semantics; Singular value decomposition; Algebraic Reduction; Non-negative Matrix Factorization (NMF); Singular Value Decomposition (SVD); Text Summarization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Engineering (ICCCE), 2010 International Conference on
Conference_Location
Kuala Lumpur
Print_ISBN
978-1-4244-6233-9
Type
conf
DOI
10.1109/ICCCE.2010.5556770
Filename
5556770
Link To Document