Automatic Summarization as a Combinatorial Optimization Problem
نویسندگان
چکیده
منابع مشابه
Biogeography-Based Optimization Algorithm for Automatic Extractive Text Summarization
Given the increasing number of documents, sites, online sources, and the users’ desire to quickly access information, automatic textual summarization has caught the attention of many researchers in this field. Researchers have presented different methods for text summarization as well as a useful summary of those texts including relevant document sentences. This study select...
متن کاملA survey on Automatic Text Summarization
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 information, is a major undertaking and requires an automatic mechanism to aid with the extant repository of informa...
متن کاملGraph matching as a combinatorial optimization problem with constraints
Let us introduce some notations. We will call GM = (VM , EM ) the model graph and GD = (VD, ED) the data graph which contains the image segments that have to be matched against GM , where Vi is the set of vertices and Ei is the set of edges of graph Gi (i = M,D). In inexact graph matching problems GD is assumed to contain more segments than GM , as that is the case when generated from an over-s...
متن کاملEfficient inference in Bayes networks as a combinatorial optimization problem
A number of exact algorithms have been developed to perform probabilistic inference in Bayesian belief networks in recent years. The techniques used in these algorithms are closely related to network structures and some of them are not easy to understand and implement. In this paper, we consider the problem from the combinatorial optimization point of view and state that e cient probabilistic i...
متن کاملDeep Learning as a Mixed Convex-Combinatorial Optimization Problem
As neural networks grow deeper and wider, learning networks with hard-threshold activations is becoming increasingly important, both for network quantization, which can drastically reduce time and energy requirements, and for creating large integrated systems of deep networks, which may have non-differentiable components and must avoid vanishing and exploding gradients for effective learning. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2009
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.24.223