BiDETS: Binary Differential Evolutionary based Text Summarization

In extraction-based automatic text summarization (ATS) applications, feature scoring is the cornerstone of the summarization process since it is used for selecting the candidate summary sentences. Handling all features equally leads to generating disqualified summaries. Feature Weighting (FW) is an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advanced computer science & applications 2021, Vol.12 (1)
Hauptverfasser: Aljahdali, Hani Moetque, Hamza, Ahmed, Abuobieda, Albaraa
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title International journal of advanced computer science & applications
container_volume 12
creator Aljahdali, Hani Moetque
Hamza, Ahmed
Abuobieda, Albaraa
description In extraction-based automatic text summarization (ATS) applications, feature scoring is the cornerstone of the summarization process since it is used for selecting the candidate summary sentences. Handling all features equally leads to generating disqualified summaries. Feature Weighting (FW) is an important approach used to weight the scores of the features based on their presence importance in the current context. Therefore, some of the ATS researchers have proposed evolutionary-based machine learning methods, such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), to extract superior weights to their assigned features. Then the extracted weights are used to tune the scored-features in order to generate a high qualified summary. In this paper, the Differential Evolution (DE) algorithm was proposed to act as a feature weighting machine learning method for extraction-based ATS problems. In addition to enabling the DE to represent and control the assigned features in binary dimension space, it was modulated into a binary coded format. Simple mathematical calculation features have been selected from various literature and employed in this study. The sentences in the documents are first clustered according to a multi-objective clustering concept. DE approach simultaneously optimizes two objective functions, which are compactness measuring and separating the sentence clusters based on these objectives. In order to automatically detect a number of sentence clusters contained in a document, representative sentences from various clusters are chosen with certain sentence scoring features to produce the summary. The method was tested and trained using DUC2002 dataset to learn the weight of each feature. To create comparative and competitive findings, the proposed DE method was compared with evolutionary methods: PSO and GA. The DE was also compared against the best and worst systems benchmark in DUC 2002. The performance of the BiDETS model is scored with 49% similar to human performance (52%) in ROUGE-1; 26% which is over the human performance (23%) using ROUGE-2; and lastly 45% similar to human performance (48%) using ROUGE-L. These results showed that the proposed method outperformed all other methods in terms of F-measure using the ROUGE evaluation tool.
doi_str_mv 10.14569/IJACSA.2021.0120132
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2655119499</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2655119499</sourcerecordid><originalsourceid>FETCH-LOGICAL-c274t-87dd5705b1b58fd8375a1dc5a064e7dd485cc22461661bc0682b28b61dbf84f53</originalsourceid><addsrcrecordid>eNotkFFLwzAUhYMoOOb-gQ8Fnztz0yRNfeu2TicDHzbBt5C0CWR060xacf56u2735Vw4h3sPH0KPgKdAGc-eV-_5fJNPCSYwxUAwJOQGjQgwHjOW4tthFzHg9OseTULY4X6SjHCRjFA-c4tiu3mJZu6g_ClaOGuNN4fWqToqfpq6a10zOFoFU0Vb89tGm26_V979qbP3gO6sqoOZXHWMPpfFdv4Wrz9eV_N8HZckpW0s0qrq2zANmglbiSRlCqqSKcyp6T0qWFkSQjlwDrrEXBBNhOZQaSuoZckYPV3uHn3z3ZnQyl3T-UP_UhLOGEBGs6xP0Uuq9E0I3lh59K4ve5KA5cBLXnjJMy955ZX8AzqLXNY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2655119499</pqid></control><display><type>article</type><title>BiDETS: Binary Differential Evolutionary based Text Summarization</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Aljahdali, Hani Moetque ; Hamza, Ahmed ; Abuobieda, Albaraa</creator><creatorcontrib>Aljahdali, Hani Moetque ; Hamza, Ahmed ; Abuobieda, Albaraa</creatorcontrib><description>In extraction-based automatic text summarization (ATS) applications, feature scoring is the cornerstone of the summarization process since it is used for selecting the candidate summary sentences. Handling all features equally leads to generating disqualified summaries. Feature Weighting (FW) is an important approach used to weight the scores of the features based on their presence importance in the current context. Therefore, some of the ATS researchers have proposed evolutionary-based machine learning methods, such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), to extract superior weights to their assigned features. Then the extracted weights are used to tune the scored-features in order to generate a high qualified summary. In this paper, the Differential Evolution (DE) algorithm was proposed to act as a feature weighting machine learning method for extraction-based ATS problems. In addition to enabling the DE to represent and control the assigned features in binary dimension space, it was modulated into a binary coded format. Simple mathematical calculation features have been selected from various literature and employed in this study. The sentences in the documents are first clustered according to a multi-objective clustering concept. DE approach simultaneously optimizes two objective functions, which are compactness measuring and separating the sentence clusters based on these objectives. In order to automatically detect a number of sentence clusters contained in a document, representative sentences from various clusters are chosen with certain sentence scoring features to produce the summary. The method was tested and trained using DUC2002 dataset to learn the weight of each feature. To create comparative and competitive findings, the proposed DE method was compared with evolutionary methods: PSO and GA. The DE was also compared against the best and worst systems benchmark in DUC 2002. The performance of the BiDETS model is scored with 49% similar to human performance (52%) in ROUGE-1; 26% which is over the human performance (23%) using ROUGE-2; and lastly 45% similar to human performance (48%) using ROUGE-L. These results showed that the proposed method outperformed all other methods in terms of F-measure using the ROUGE evaluation tool.</description><identifier>ISSN: 2158-107X</identifier><identifier>EISSN: 2156-5570</identifier><identifier>DOI: 10.14569/IJACSA.2021.0120132</identifier><language>eng</language><publisher>West Yorkshire: Science and Information (SAI) Organization Limited</publisher><subject>Clustering ; Documents ; Evolutionary algorithms ; Evolutionary computation ; Feature extraction ; Genetic algorithms ; Human performance ; Machine learning ; Particle swarm optimization ; Weighting</subject><ispartof>International journal of advanced computer science &amp; applications, 2021, Vol.12 (1)</ispartof><rights>2021. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>Aljahdali, Hani Moetque</creatorcontrib><creatorcontrib>Hamza, Ahmed</creatorcontrib><creatorcontrib>Abuobieda, Albaraa</creatorcontrib><title>BiDETS: Binary Differential Evolutionary based Text Summarization</title><title>International journal of advanced computer science &amp; applications</title><description>In extraction-based automatic text summarization (ATS) applications, feature scoring is the cornerstone of the summarization process since it is used for selecting the candidate summary sentences. Handling all features equally leads to generating disqualified summaries. Feature Weighting (FW) is an important approach used to weight the scores of the features based on their presence importance in the current context. Therefore, some of the ATS researchers have proposed evolutionary-based machine learning methods, such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), to extract superior weights to their assigned features. Then the extracted weights are used to tune the scored-features in order to generate a high qualified summary. In this paper, the Differential Evolution (DE) algorithm was proposed to act as a feature weighting machine learning method for extraction-based ATS problems. In addition to enabling the DE to represent and control the assigned features in binary dimension space, it was modulated into a binary coded format. Simple mathematical calculation features have been selected from various literature and employed in this study. The sentences in the documents are first clustered according to a multi-objective clustering concept. DE approach simultaneously optimizes two objective functions, which are compactness measuring and separating the sentence clusters based on these objectives. In order to automatically detect a number of sentence clusters contained in a document, representative sentences from various clusters are chosen with certain sentence scoring features to produce the summary. The method was tested and trained using DUC2002 dataset to learn the weight of each feature. To create comparative and competitive findings, the proposed DE method was compared with evolutionary methods: PSO and GA. The DE was also compared against the best and worst systems benchmark in DUC 2002. The performance of the BiDETS model is scored with 49% similar to human performance (52%) in ROUGE-1; 26% which is over the human performance (23%) using ROUGE-2; and lastly 45% similar to human performance (48%) using ROUGE-L. These results showed that the proposed method outperformed all other methods in terms of F-measure using the ROUGE evaluation tool.</description><subject>Clustering</subject><subject>Documents</subject><subject>Evolutionary algorithms</subject><subject>Evolutionary computation</subject><subject>Feature extraction</subject><subject>Genetic algorithms</subject><subject>Human performance</subject><subject>Machine learning</subject><subject>Particle swarm optimization</subject><subject>Weighting</subject><issn>2158-107X</issn><issn>2156-5570</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNotkFFLwzAUhYMoOOb-gQ8Fnztz0yRNfeu2TicDHzbBt5C0CWR060xacf56u2735Vw4h3sPH0KPgKdAGc-eV-_5fJNPCSYwxUAwJOQGjQgwHjOW4tthFzHg9OseTULY4X6SjHCRjFA-c4tiu3mJZu6g_ClaOGuNN4fWqToqfpq6a10zOFoFU0Vb89tGm26_V979qbP3gO6sqoOZXHWMPpfFdv4Wrz9eV_N8HZckpW0s0qrq2zANmglbiSRlCqqSKcyp6T0qWFkSQjlwDrrEXBBNhOZQaSuoZckYPV3uHn3z3ZnQyl3T-UP_UhLOGEBGs6xP0Uuq9E0I3lh59K4ve5KA5cBLXnjJMy955ZX8AzqLXNY</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Aljahdali, Hani Moetque</creator><creator>Hamza, Ahmed</creator><creator>Abuobieda, Albaraa</creator><general>Science and Information (SAI) Organization Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7XB</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>2021</creationdate><title>BiDETS: Binary Differential Evolutionary based Text Summarization</title><author>Aljahdali, Hani Moetque ; Hamza, Ahmed ; Abuobieda, Albaraa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c274t-87dd5705b1b58fd8375a1dc5a064e7dd485cc22461661bc0682b28b61dbf84f53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Clustering</topic><topic>Documents</topic><topic>Evolutionary algorithms</topic><topic>Evolutionary computation</topic><topic>Feature extraction</topic><topic>Genetic algorithms</topic><topic>Human performance</topic><topic>Machine learning</topic><topic>Particle swarm optimization</topic><topic>Weighting</topic><toplevel>online_resources</toplevel><creatorcontrib>Aljahdali, Hani Moetque</creatorcontrib><creatorcontrib>Hamza, Ahmed</creatorcontrib><creatorcontrib>Abuobieda, Albaraa</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of advanced computer science &amp; applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aljahdali, Hani Moetque</au><au>Hamza, Ahmed</au><au>Abuobieda, Albaraa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>BiDETS: Binary Differential Evolutionary based Text Summarization</atitle><jtitle>International journal of advanced computer science &amp; applications</jtitle><date>2021</date><risdate>2021</risdate><volume>12</volume><issue>1</issue><issn>2158-107X</issn><eissn>2156-5570</eissn><abstract>In extraction-based automatic text summarization (ATS) applications, feature scoring is the cornerstone of the summarization process since it is used for selecting the candidate summary sentences. Handling all features equally leads to generating disqualified summaries. Feature Weighting (FW) is an important approach used to weight the scores of the features based on their presence importance in the current context. Therefore, some of the ATS researchers have proposed evolutionary-based machine learning methods, such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), to extract superior weights to their assigned features. Then the extracted weights are used to tune the scored-features in order to generate a high qualified summary. In this paper, the Differential Evolution (DE) algorithm was proposed to act as a feature weighting machine learning method for extraction-based ATS problems. In addition to enabling the DE to represent and control the assigned features in binary dimension space, it was modulated into a binary coded format. Simple mathematical calculation features have been selected from various literature and employed in this study. The sentences in the documents are first clustered according to a multi-objective clustering concept. DE approach simultaneously optimizes two objective functions, which are compactness measuring and separating the sentence clusters based on these objectives. In order to automatically detect a number of sentence clusters contained in a document, representative sentences from various clusters are chosen with certain sentence scoring features to produce the summary. The method was tested and trained using DUC2002 dataset to learn the weight of each feature. To create comparative and competitive findings, the proposed DE method was compared with evolutionary methods: PSO and GA. The DE was also compared against the best and worst systems benchmark in DUC 2002. The performance of the BiDETS model is scored with 49% similar to human performance (52%) in ROUGE-1; 26% which is over the human performance (23%) using ROUGE-2; and lastly 45% similar to human performance (48%) using ROUGE-L. These results showed that the proposed method outperformed all other methods in terms of F-measure using the ROUGE evaluation tool.</abstract><cop>West Yorkshire</cop><pub>Science and Information (SAI) Organization Limited</pub><doi>10.14569/IJACSA.2021.0120132</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2158-107X
ispartof International journal of advanced computer science & applications, 2021, Vol.12 (1)
issn 2158-107X
2156-5570
language eng
recordid cdi_proquest_journals_2655119499
source Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Clustering
Documents
Evolutionary algorithms
Evolutionary computation
Feature extraction
Genetic algorithms
Human performance
Machine learning
Particle swarm optimization
Weighting
title BiDETS: Binary Differential Evolutionary based Text Summarization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T04%3A17%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=BiDETS:%20Binary%20Differential%20Evolutionary%20based%20Text%20Summarization&rft.jtitle=International%20journal%20of%20advanced%20computer%20science%20&%20applications&rft.au=Aljahdali,%20Hani%20Moetque&rft.date=2021&rft.volume=12&rft.issue=1&rft.issn=2158-107X&rft.eissn=2156-5570&rft_id=info:doi/10.14569/IJACSA.2021.0120132&rft_dat=%3Cproquest_cross%3E2655119499%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2655119499&rft_id=info:pmid/&rfr_iscdi=true