Study on sparseness effects over NMF applied for automatic text summarization

• Main Authors: Batcha, Nowshath Kadhar, Murugesan, Raja Kumar, A. Aziz, Normaziah
• Format: Conference or Workshop Item
• Language: English
• Published: 2012
• Subjects: T Technology (General)
• Online Access: http://irep.iium.edu.my/38875/1/Study_on_sparseness_effects_over_NMF_applied_for_Automatic_Text_Summarization.pdf; http://irep.iium.edu.my/38875/; http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6392576

The significance of Non-negative Matrix Factorization ((NMF) in the field of automatic text summarization is rapidly increasing due to its interpretation and storage capabilities. Interpretation defines the ease at which the structure of high dimensional data can be understood. While, storage capability relates to the extent of data reduction process achieved by NMF. The parametric values that serve as input to the NMF process include initialization method, rank of factorization, sparseness measure and maximum iteration. These inputs are vital to the output produced by NMF. These parameters of NMF were not been considered in the existing literature on Automatic Text Summarization (ATS). This paper sheds light specifically on sparseness of NMF when applied to ATS and the impact it makes to the quality of the summary generated. In this study on NMF algorithm that supports sparseness is treated with various degree of sparsity and its performance impact on text summary generated is compared with other NMF algorithms without sparseness constraints.