TY - GEN
T1 - Tensor term indexing
T2 - ISCIII '09 - 4th International Symposium on Computational Intelligence and Intelligent Informatics
AU - Manna, Sukanya
AU - Petres, Zoltán
AU - Gedeon, Tom
PY - 2009
Y1 - 2009
N2 - In this paper, a new method for text summarization is proposed by using an extended version of the Tensor Term Importance (TTI) model. This method summarizes documents by extracting important sentences from a document. It improves the per document summarization efficiency by incorporating additional information of the whole document set referring to the same topic (or coherent documents). The basic idea of this approach is to represent the whole document set in a uniform form, in the term-sentence-document tensor, and to use higher-order singular value decomposition (HOSVD) to highlight the important terms in each document. Here, we present two different methods of summarization. In the first method, the sentences having the highly weighted terms are extracted as the important sentences representing the document. The important sentences identified by selecting those that contains more from the important terms. The second model uses a so-called super sentence and uses that to extract other sentences having high similarity with it. Unlike in Latent Semantic Analysis (LSA) where SVD is applied for compressing the sparse term-document matrix and defining latent semantic links between terms, in TTI SVD is used to reduce noise and to highlight the important term-document relations in the document. Our evaluation results show that our TTI based methods are more similar to human generated summaries than other automated summarizers which work on single documents at a time.
AB - In this paper, a new method for text summarization is proposed by using an extended version of the Tensor Term Importance (TTI) model. This method summarizes documents by extracting important sentences from a document. It improves the per document summarization efficiency by incorporating additional information of the whole document set referring to the same topic (or coherent documents). The basic idea of this approach is to represent the whole document set in a uniform form, in the term-sentence-document tensor, and to use higher-order singular value decomposition (HOSVD) to highlight the important terms in each document. Here, we present two different methods of summarization. In the first method, the sentences having the highly weighted terms are extracted as the important sentences representing the document. The important sentences identified by selecting those that contains more from the important terms. The second model uses a so-called super sentence and uses that to extract other sentences having high similarity with it. Unlike in Latent Semantic Analysis (LSA) where SVD is applied for compressing the sparse term-document matrix and defining latent semantic links between terms, in TTI SVD is used to reduce noise and to highlight the important term-document relations in the document. Our evaluation results show that our TTI based methods are more similar to human generated summaries than other automated summarizers which work on single documents at a time.
UR - http://www.scopus.com/inward/record.url?scp=72449174243&partnerID=8YFLogxK
U2 - 10.1109/ISCIII.2009.5342266
DO - 10.1109/ISCIII.2009.5342266
M3 - Conference contribution
SN - 9781424453818
T3 - ISCIII '09 - 4th International Symposium on Computational Intelligence and Intelligent Informatics, Proceedings
SP - 135
EP - 141
BT - ISCIII '09 - 4th International Symposium on Computational Intelligence and Intelligent Informatics, Proceedings
Y2 - 21 October 2009 through 25 October 2009
ER -