Learning with fuzzy hypergraphs: a topical approach to query-oriented text summarization

DOI10.1016/J.INS.2019.05.020MaRDI QIDQ2215059zbMATH OpenOpenAlexFDO

Authors Hadrien Van Lierde, Tommy W. S. Chow

Publication date 10 December 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.09445

zbMATH Keywords

automatic text summarizationfuzzy graphshierarchical Dirichlet processpersonalized PageRankprobabilistic topic modelssubmodular set functions

Mathematics Subject Classification ID

Hypergraphs (05C65) Fractional graph theory, fuzzy graph theory (05C72) Natural language processing (68T50)

Abstract: Existing graph-based methods for extractive document summarization represent sentences of a corpus as the nodes of a graph or a hypergraph in which edges depict relationships of lexical similarity between sentences. Such approaches fail to capture semantic similarities between sentences when they express a similar information but have few words in common and are thus lexically dissimilar. To overcome this issue, we propose to extract semantic similarities based on topical representations of sentences. Inspired by the Hierarchical Dirichlet Process, we propose a probabilistic topic model in order to infer topic distributions of sentences. As each topic defines a semantic connection among a group of sentences with a certain degree of membership for each sentence, we propose a fuzzy hypergraph model in which nodes are sentences and fuzzy hyperedges are topics. To produce an informative summary, we extract a set of sentences from the corpus by simultaneously maximizing their relevance to a user-defined query, their centrality in the fuzzy hypergraph and their coverage of topics present in the corpus. We formulate a polynomial time algorithm building on the theory of submodular functions to solve the associated optimization problem. A thorough comparative analysis with other graph-based summarization systems is included in the paper. Our obtained results show the superiority of our method in terms of content coverage of the summaries.

Recommendations

• Automatic document summarization by sentence extraction
• Multi-document summarization based on sentence cluster using non-negative matrix factorization
• Automatic text summarization using latent semantic analysis
• scientific article; zbMATH DE number 2079784
• Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization

Cites work

• 10.1162/jmlr.2003.3.4-5.993
• Data Mining and Knowledge Discovery Handbook
• Fuzzy graphs and fuzzy hypergraphs
• Scikit-learn: machine learning in Python
• Tractability. Practical approaches to hard problems

Cited in

(8)

• Micro-review synthesis for multi-entity summarization
• Subtopic-based multimodality ranking for topic-focused multidocument summarization
• scientific article; zbMATH DE number 1977813 (Why is no real title available?)
• scientific article; zbMATH DE number 2079784 (Why is no real title available?)
• scientific article; zbMATH DE number 2088054 (Why is no real title available?)
• Extractive text summarization using topological features
• Determining the membership degree by fuzzy hypergraphs
• Enhancing multi-document summarization using concepts

Describes a project that uses

Uses Software

• SummaRuNNer
• TextRank
• Scikit

This page was built for publication: Learning with fuzzy hypergraphs: a topical approach to query-oriented text summarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215059)