最大被覆問題とその変種による文書要約モデル
スポンサーリンク
概要
- 論文の詳細を見る
We discuss text summarization in terms of maximum coverage problem and its variant. To solve the optimization problem, we applied some decoding algorithms including the ones never used in this summarization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-and-bound method. We conduct comparative experiments. On the basis of the experimental results, we also augment the summarization model so that it takes into account the relevance to the document cluster. Through experiments, we showed that the augmented model is at least comparable to the best-performing method of DUC'04.
- 一般社団法人 人工知能学会の論文
一般社団法人 人工知能学会 | 論文
- ２段階ＧＡ "Ｓｏｌｉｄ ＥＭＯ'' によるレンズ系設計
- 平均的に予算非負なダブルオークションプロトコル
- The Effect of the Present Strategy Considering the Multiplexing of Consumer Communication Space
- 新技術が持つ特長に注目した技術調査支援ツール
- 最大被覆問題とその変種による文書要約モデル