Graph-based summarization entails extracting a worthwhile subset of sentences from a collection of textual documents by using a graph-based model to represent the correlations between pairs of document terms. However, since the high-order correlations among multiple terms are disregarded during graph evaluation, the summarization performance could be limited unless integrating ad-hoc language-dependent or semantics-based analysis. This paper presents a novel and general-purpose graph-based summarizer, namely GraphSum (Graph-based Summarizer). It discovers and exploits association rules to represent the correlations among multiple terms that have been neglected by previous approaches. The graph nodes, which represent combinations of two or more terms, are first ranked by means of a PageRank * Corresponding author. Tel.: +39 0110907084 Fax: +39 0110907099. Email addresses: elena.baralis@polito.it (Elena Baralis), luca.cagliero@polito.it (Luca Cagliero), naeem.mahoto@polito.it (Naeem Mahoto), alessandro.fiori@ircc.it (Alessandro Fiori) Preprint submitted to strategy that discriminates between positive and negative term correlations. Then, the produced node ranking is used to drive the sentence selection process. The experiments performed on benchmark and real-life documents demonstrate the effectiveness of the proposed approach compared to many stateof-the-art summarizers.
Baralis et al. REF proposed a novel and general-purpose summarizer, GRAPHSUM, which represents correlations among multiple terms by discovering association rules, and adopts a graph-based ranking and a specified strategy to choose significant sentences for summarization.
GraphSum: Discovering correlations among multiple terms for graph-based summarization
Inf. Sci.
Inf. Sci.
Mathematics Computer Science