ویراساینس.
سند علمی

Generalized minimum dominating set and application in automatic text summarization

Yi-Zhi Xu, Hai-Jun Zhou

چکیده

For a graph formed by vertices and weighted edges, a generalized minimum dominating set (MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each outside vertex to vertices in this set is equal to or larger than certain threshold value. This generalized MDS problem reduces to the conventional MDS problem in the limiting case of all the edge weights being equal to the threshold value. We treat the generalized MDS problem in the present paper by a replica-symmetric spin glass theory and derive a set of beliefpropagation equations. As a practical application we consider the problem of extracting a set of sentences that best summarize a given input text document. We carry out a preliminary test of the statistical physics-inspired method to this automatic text summarization problem.

اسناد مشابه

  • Generalized minimum dominating set and application in automatic text summarization

    مقاله‌ی دسترسی آزاد۲۰۱۶Journal of Physics: Conference SeriesYi-ZhiXu, Hai-JunZhou

  • From SweSum to ScandSum- Automatic text summarization for the Scandinavian languages

    سند علمی۲۰۰۳Hercules Dalianis

    In automatic text summarization, the most relevant parts of a document are extracted and put together in a non-redundant summary that is shorter than the original document. A more advanced form of summarization is multi-text summarization where several texts are condensed into on

  • Multi-Document Summarization via the Minimum Dominating Set

    سند علمی۲۰۱۰COLINGChao Shen, Tao Li

    Multi-document summarization has been an important problem in information retrieval. It aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set of documents where vertices represent sente

  • Resource Lean and Portable Automatic Text Summarization

    سند علمی۲۰۰۷MARTIN HASSEL

    Today, with digitally stored information available in abundance, even for many minor languages, this information must by some means be filtered and extracted in order to avoid drowning in it. Automatic summarization is one such technique, where a computer summarizes a longer text

  • Extractive Based Automatic Text Summarization

    سند علمی۲۰۱۷JCPSagar M. Patel, Vipul K. Dabhi, Harshad B. Prajapati

    Automatic text summarization is the process of reducing the text content and retaining the important points of the document. Generally, there are two approaches for automatic text summarization: Extractive and Abstractive. The process of extractive based text summarization can be

  • A survey on Automatic Text Summarization

    مقاله۲۰۱۹Journal of Artificial Intelligence and Data MiningN. Nazari, M. A. Mahdavi

    Text summarization endeavors to produce a summary version of a text, while maintaining the original ideas. The textual content on the web, in particular, is growing at an exponential rate. The ability to decipher through such massive amount of data, in order to extract the useful