paper-with-me

홈 › Papers

Wikipedia Current Events Summarization using Particle Swarm Optimization

2021-12-01 · ICON 2021 12 · Santosh Kumar Mishra, Darsh Kaushik, Sriparna Saha, Pushpak Bhattacharyya

This paper proposes a method to summarize news events from multiple sources. We pose event summarization as a clustering-based optimization problem and solve it using particle swarm optimization. The proposed methodology uses the search capability of particle swarm optimization, detecting the number of clusters automatically. Experiments are conducted with the Wikipedia Current Events Portal dataset and evaluated using the well-known ROUGE-1, ROUGE-2, and ROUGE-L scores. The obtained results show the efficacy of the proposed methodology over the state-of-the-art methods. It attained improvement of 33.42%, 81.75%, and 57.58% in terms of ROUGE-1, ROUGE-2, and ROUGE-L, respectively.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

A Large-Scale Multi-Document Summarization Dataset from the Wikipedia Current Events Portal

2020-05-20 · ACL 2020 6 · Demian Gholipour Ghalandari, Chris Hokamp, Nghia The Pham, John Glover 외

Multi-document summarization (MDS) aims to compress the content in large document collections into short summaries and has important applications in story clustering for newsfeeds, presentation of search results, and tim…

ArticlesClusteringDocument SummarizationMulti-Document Summarization

An improved clustering-based multi-swarm PSO using local diversification and topology information

2025-11-14 · Yves Matanga, Yanxia Sun, Zenghui Wang arxiv

Multi-swarm particle optimisation algorithms are gaining popularity due to their ability to locate multiple optimum points concurrently. In this family of algorithms, clustering-based multi-swarm algorithms are among the…

A Novel Multi-Objective Velocity-Free Boolean Particle Swarm Optimization

2022-10-12 · Wei Quan, Denise Gorse

This paper extends boolean particle swarm optimization to a multi-objective setting, to our knowledge for the first time in the literature. Our proposed new boolean algorithm, MBOnvPSO, is notably simplified by the omiss…

DiversityPosition

A theoretical guideline for designing an effective adaptive particle swarm

2018-02-13 · Mohammad Reza Bonyadi

In this paper we theoretically investigate underlying assumptions that have been used for designing adaptive particle swarm optimization algorithms in the past years. We relate these assumptions to the movement patterns …

AMPSO: Artificial Multi-Swarm Particle Swarm Optimization

2020-04-16 · Haohao Zhou, Zhi-Hui Zhan, Zhi-Xin Yang, Xiangzhi Wei

In this paper we propose a novel artificial multi-swarm PSO which consists of an exploration swarm, an artificial exploitation swarm and an artificial convergence swarm. The exploration swarm is a set of equal-sized sub-…

Diversity