Generalized minimum dominating set and application in automatic text summarization
원문 초록
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 belief-propagation 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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.