Belief Propagation for Maximum Coverage on Weighted Bipartite Graph and Application to Text Summarization
원문 초록
We study text summarization from the viewpoint of maximum coverage problem. In graph theory, the task of text summarization is regarded as maximum coverage problem on bipartite graph with weighted nodes. In recent study, belief-propagation based algorithm for maximum coverage on unweighted graph was proposed using the idea of statistical mechanics. We generalize it to weighted graph for text summarization. Then we apply our algorithm to weighted biregular random graph for verification of maximum coverage performance. We also apply it to bipartite graph representing real document in open text dataset, and check the performance of text summarization. As a result, our algorithm exhibits better performance than greedy-type algorithm in some setting of text summarization.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
APE: Selective Fine-tuning with Acceptance Criteria for Language Model Adaptation
On-the-Fly Adaptive Distillation of Transformer to Dual-State Linear Attention
Improving large language models with concept-aware fine-tuning
Multimodal Survival Modeling in the Age of Foundation Models
A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting
ConTextual: Improving Clinical Text Summarization in LLMs with Context-preserving Token Filtering and Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.