İçeriğe geç
akaturk Akademik ölçüm

Makale detayı · 2024 · article

A new multi-document summarisation approach using saplings growing-up optimisation algorithms: Simultaneously optimised coverage and diversity

ISSN0165-5515
YÖKSİS OpenAlex
Yıl2024
Atıf11OpenAlex
Yüzdelik%77,9
FWCI0,891,00 = dünya ortalaması
Scopus (SJR)Q1
WoS (JCR)Q2

Veri kaynağı ayrımı

  • YÖKSİSYÖKSİS makale kaydı
  • YÖKSİS dergi adıJournal of Information Science
  • Katalog eşleşmesi (ISSN)Journal of Information Science
  • OpenAlexOpenAlex zenginleştirmesi (özet, atıf, konular)
  • Semantic Scholaratıf sayısı (OpenAlex ile birleştirilmez)

Özet

OpenAlex İngilizce

Automatic text summarisation is obtaining a subset that accurately represents the main text. A quality summary should contain the maximum amount of information while avoiding redundant information. Redundancy is a severe deficiency that causes unnecessary repetition of information within sentences and should not occur in summarisation studies. Although many optimisation-based text summarisation methods have been proposed in recent years, there exists a lack of research on the simultaneous optimisation of scope and redundancy. In this context, this study presents an approach in which maximum coverage and minimum redundancy, which form the two key features of a rich summary, are modelled as optimisation targets. In optimisation-based text summarisation studies, different conflicting objectives are generally weighted or formulated and transformed into single-objective problems. However, this transformation can directly affect the quality of the solution. In this study, the optimisation goals are met simultaneously without transformation or formulation. In addition, the multi-objective saplings growing-up algorithm (MO-SGuA) is implemented and modified for text summarisation. The presented approach, called Pareto optimal, achieves an optimal solution with simultaneous optimisation. Experimentation with the MO-SGuA method was tested using open-access (document understanding conference; DUC) data sets. Performance success of the MO-SGuA approach was calculated using the recall-oriented understudy for gisting evaluation (ROUGE) metrics and then compared with the competitive practices used in the literature. Testing achieved a 26.6% summarisation result for the ROUGE-2 metric and 65.96% for ROUGE-L, which represents an improvement of 11.17% and 20.54%, respectively. The experimental results showed that good-quality summaries were achieved using the proposed approach.

Konular

Atıflar

OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.

11atıfOpenAlex · cited_by_count (önbellek / veritabanı)

Yerel katalogda bu makaleye atıf yapan 14 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).

  1. 2023 A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithmAtıf 19 · OpenAlex
  2. 2023 A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithmAtıf 19 · OpenAlex
  3. 2023 A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithmAtıf 19 · OpenAlex
  4. 2024 The power of graphs in medicine: Introducing BioGraphSum for effective text summarizationAtıf 8 · OpenAlex
  5. 2023 Müşteri Duyarlılığını Keşfetmek İçin Yapay Zeka Destekli Analiz ile Çevrimiçi Ürün İncelemelerinden Anlamlı Bilgiler Elde EtmeAtıf 6 · OpenAlex
  6. 2023 Müşteri Duyarlılığını Keşfetmek İçin Yapay Zeka Destekli Analiz ile Çevrimiçi Ürün İncelemelerinden Anlamlı Bilgiler Elde EtmeAtıf 6 · OpenAlex
  7. 2025 Enhancing extractive multi-documents summarization with a novel dominating set model for semantic relationship detectionAtıf 2 · OpenAlex
  8. 2025 Enhancing extractive multi-documents summarization with a novel dominating set model for semantic relationship detectionAtıf 2 · OpenAlex
  9. 2025 A hybrid model for extractive summarization: Leveraging graph entropy to improve large language model performanceAtıf 2 · OpenAlex
  10. 2024 Positioning Security Cameras in The Central Transportation Networks of Barcelona With Minimum Cost via The Malatya Minimum Vertex Cover AlgorithmAtıf 1 · OpenAlex

Yazarlar

3
  1. CENGİZ HARK İNÖNÜ ÜNİVERSİTESİ 1
  2. TANER UÇKAN 2
  3. ALİ KARCI 3