Abstractive Summarization of Large Document Collections Using GPT

• URL: http://arxiv.org/abs/2310.05690v1
• Date: Mon, 9 Oct 2023 13:06:21 GMT
• Title: Abstractive Summarization of Large Document Collections Using GPT
• Authors: Sengjie Liu, Christopher G. Healey
• Abstract summary: This paper proposes a method of abstractive summarization designed to scale to document collections instead of individual documents. Our approach applies a combination of semantic clustering, document size reduction within topic clusters, semantic chunking of a cluster's documents, GPT-based summarization and concatenation, and a combined sentiment and text visualization of each topic to support exploratory data analysis.
• Score: 1.8130068086063336
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper proposes a method of abstractive summarization designed to scale to document collections instead of individual documents. Our approach applies a combination of semantic clustering, document size reduction within topic clusters, semantic chunking of a cluster's documents, GPT-based summarization and concatenation, and a combined sentiment and text visualization of each topic to support exploratory data analysis. Statistical comparison of our results to existing state-of-the-art systems BART, BRIO, PEGASUS, and MoCa using ROGUE summary scores showed statistically equivalent performance with BART and PEGASUS on the CNN/Daily Mail test dataset, and with BART on the Gigaword test dataset. This finding is promising since we view document collection summarization as more challenging than individual document summarization. We conclude with a discussion of how issues of scale are

Related papers

• JADS: A Framework for Self-supervised Joint Aspect Discovery and Summarization [3.992091862806936]
  Our solution integrates topic discovery and summarization into a single step. Given text data, our Joint Aspect Discovery and Summarization algorithm (JADS) discovers aspects from the input. Our proposed method achieves higher semantic alignment with ground truth and is factual.
  arXiv  Detail & Related papers  (2024-05-28T23:01:57Z)
• Vietnamese multi-document summary using subgraph selection approach -- VLSP 2022 AbMuSu Shared Task [0.0]
  Document summarization is a task to generate afluent, condensed summary for a document. In this paper, we focus on transforming the extractive MDS problem into subgraph selection. Experiments have been implemented on the Vietnamese dataset published in VLSP Evaluation Campaign 2022.
  arXiv  Detail & Related papers  (2023-06-26T16:34:02Z)
• Large-Scale Multi-Document Summarization with Information Extraction and Compression [31.601707033466766]
  We develop an abstractive summarization framework independent of labeled data for multiple heterogeneous documents. Our framework processes documents telling different stories instead of documents on the same topic. Our experiments demonstrate that our framework outperforms current state-of-the-art methods in this more generic setting.
  arXiv  Detail & Related papers  (2022-05-01T19:49:15Z)
• Unsupervised Summarization with Customized Granularities [76.26899748972423]
  We propose the first unsupervised multi-granularity summarization framework, GranuSum. By inputting different numbers of events, GranuSum is capable of producing multi-granular summaries in an unsupervised manner.
  arXiv  Detail & Related papers  (2022-01-29T05:56:35Z)
• Modeling Endorsement for Multi-Document Abstractive Summarization [10.166639983949887]
  A crucial difference between single- and multi-document summarization is how salient content manifests itself in the document(s) In this paper, we model the cross-document endorsement effect and its utilization in multiple document summarization. Our method generates a synopsis from each document, which serves as an endorser to identify salient content from other documents.
  arXiv  Detail & Related papers  (2021-10-15T03:55:42Z)
• AgreeSum: Agreement-Oriented Multi-Document Summarization [3.4743618614284113]
  Given a cluster of articles, the goal is to provide abstractive summaries that represent information common and faithful to all input articles. We create a dataset for AgreeSum, and provide annotations on articlesummary entailment relations for a subset of the clusters in the dataset.
  arXiv  Detail & Related papers  (2021-06-04T06:17:49Z)
• Text Summarization with Latent Queries [60.468323530248945]
  We introduce LaQSum, the first unified text summarization system that learns Latent Queries from documents for abstractive summarization with any existing query forms. Under a deep generative framework, our system jointly optimize a latent query model and a conditional language model, allowing users to plug-and-play queries of any type at test time. Our system robustly outperforms strong comparison systems across summarization benchmarks with different query types, document settings, and target domains.
  arXiv  Detail & Related papers  (2021-05-31T21:14:58Z)
• Relation Clustering in Narrative Knowledge Graphs [71.98234178455398]
  relational sentences in the original text are embedded (with SBERT) and clustered in order to merge together semantically similar relations. Preliminary tests show that such clustering might successfully detect similar relations, and provide a valuable preprocessing for semi-supervised approaches.
  arXiv  Detail & Related papers  (2020-11-27T10:43:04Z)
• SummPip: Unsupervised Multi-Document Summarization with Sentence Graph Compression [61.97200991151141]
  SummPip is an unsupervised method for multi-document summarization. We convert the original documents to a sentence graph, taking both linguistic and deep representation into account. We then apply spectral clustering to obtain multiple clusters of sentences, and finally compress each cluster to generate the final summary.
  arXiv  Detail & Related papers  (2020-07-17T13:01:15Z)
• Leveraging Graph to Improve Abstractive Multi-Document Summarization [50.62418656177642]
  We develop a neural abstractive multi-document summarization (MDS) model which can leverage well-known graph representations of documents. Our model utilizes graphs to encode documents in order to capture cross-document relations, which is crucial to summarizing long documents. Our model can also take advantage of graphs to guide the summary generation process, which is beneficial for generating coherent and concise summaries.
  arXiv  Detail & Related papers  (2020-05-20T13:39:47Z)
• Extractive Summarization as Text Matching [123.09816729675838]
  This paper creates a paradigm shift with regard to the way we build neural extractive summarization systems. We formulate the extractive summarization task as a semantic text matching problem. We have driven the state-of-the-art extractive result on CNN/DailyMail to a new level (44.41 in ROUGE-1)
  arXiv  Detail & Related papers  (2020-04-19T08:27:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.