Affinity-Preserving Random Walk for Multi-Document Summarization
Multi-document summarization provides users with a short text that summarizes the information in a set of related documents. This paper introduces affinity-preserving random walk to the summarization task, which preserves the affinity relations of sentences by an absorbing random walk model. Meanwhile, we put forward adjustable affinity-preserving random walk to enforce the diversity constraint of summarization in the random walk process. The ROUGE evaluations on DUC 2003 topic-focused summarization task and DUC 2004 generic summarization task show the good performance of our method, which has the best ROUGE-2 recall among the graph-based ranking methods.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityDocument SummarizationMulti-Document SummarizationText SummarizationSimilar Papers 제목 키워드 기반
SPARK: Stochastic Propagation via Affinity-guided Random walK for training-free unsupervised segmentation
We argue that existing training-free segmentation methods rely on an implicit and limiting assumption, that segmentation is a spectral graph partitioning problem over diffusion-derived affinities. Such approaches, based …
Semantic Segmentationgraph partitioningAffinity Graph Connectivity in Convex Clustering
We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understa…
Deep Group-shuffling Random Walk for Person Re-identification
Person re-identification aims at finding a person of interest in an image gallery by comparing the probe image of this person with all the gallery images. It is generally treated as a retrieval problem, where the affinit…
Person Re-IdentificationRetrievalNERVE: Neighbourhood & Entropy-guided Random-walk for training free open-Vocabulary sEgmentation
Despite recent advances in Open-Vocabulary Semantic Segmentation (OVSS), existing training-free methods face several limitations: use of computationally expensive affinity refinement strategies, ineffective fusion of tra…
Semantic SegmentationVision Transformer based Random Walk for Group Re-Identification
Group re-identification (re-ID) aims to match groups with the same people under different cameras, mainly involves the challenges of group members and layout changes well. Most existing methods usually use the k-nearest …
Depth EstimationMonocular Depth Estimation