PMCN: combining pdf-modified similarity and complex network in multi-document summarization

Abstract

This study combines the concept of degree centrality in complex network with the Term Frequency * Proportional Document Frequency (TF*PDF) algorithm; the combined method, called TF-PDF, constructs relationship networks among sentences for writing news summaries. The TF-PDF method is a multi-document summarization extension of the ideas of Bun and Ishizuka (2002), who first published the TF*PDF algorithm for detecting hot topics. In their TF*PDF algorithm, Bun and Ishizuka defined the publisher of a news item as its channel. If the PDF weight of a term is higher than the weights of other terms, then the term is hotter than the other terms. However, this study attempts to develop summaries for news items. Because the TF*PDF algorithm summarizes daily news, TF-PDF replaces the concept of “channel” with “the date of the news event,” and uses the resulting chronicle ordering for a multi-document summarization algorithm, of which the F-measure scores were 0.042 and 0.051 higher than LexRank for the famous d30001t and d30003t tasks, respectively.

URL: http://ijkcdt.net/xml/21159/21159.pdf