pith. sign in

arxiv: 1706.06681 · v3 · pith:BD2OT4MNnew · submitted 2017-06-20 · 💻 cs.CL · cs.LG

Graph-based Neural Multi-Document Summarization

classification 💻 cs.CL cs.LG
keywords sentencegraphsneuralmulti-documentrelationsummarizationfeaturesgraph
0
0 comments X
read the original abstract

We propose a neural multi-document summarization (MDS) system that incorporates sentence relation graphs. We employ a Graph Convolutional Network (GCN) on the relation graphs, with sentence embeddings obtained from Recurrent Neural Networks as input node features. Through multiple layer-wise propagation, the GCN generates high-level hidden sentence features for salience estimation. We then use a greedy heuristic to extract salient sentences while avoiding redundancy. In our experiments on DUC 2004, we consider three types of sentence relation graphs and demonstrate the advantage of combining sentence relations in graphs with the representation power of deep neural networks. Our model improves upon traditional graph-based extractive approaches and the vanilla GRU sequence model with no graph, and it achieves competitive results against other state-of-the-art multi-document summarization systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Ranking sentences from product description & bullets for better search

    cs.IR 2019-07 unverdicted novelty 4.0

    Two RL-based extractive summarization models rank sentences from product fields by leveraging titles and click-through logs to improve search relevance.