# pSum-SaDE: A Modifiedp-Median Problem and Self-Adaptive Differential Evolution Algorithm for Text Summarization

Authors: Rasim M. Alguliev; Ramiz M. Aliguliyev; Chingiz A. Mehdiyev
Journal: Applied Computational Intelligence and Soft Computing
 (2011)

---

## Abstract

Extractive multidocument summarization is modeled as a modifiedp-median problem. The problem is formulated with taking into account four basic requirements, namely, relevance, information coverage, diversity, and length limit that should satisfy summaries. To solve the optimization problem a self-adaptive differential evolution algorithm is created. Differential evolution has been proven to be an efficient and robust algorithm for many real optimization problems. However, it still may converge toward local optimum solutions, need to manually adjust the parameters, and finding the best values for the control parameters is a consuming task. In the paper is proposed a self-adaptive scaling factor in original DE to increase the exploration and exploitation ability. This paper has found that self-adaptive differential evolution can efficiently find the best solution in comparison with the canonical differential evolution. We implemented our model on multi-document summarization task. Experiments have shown that the proposed model is competitive on the DUC2006 dataset.


---

## Body

## 1. Introduction

Automatic document summarization has drawn increasing attention in the past with rapid growth of the Internet and electronic government. The explosion of electronic documents has led to information overload, implying that finding and using information efficiently and effectively has become a pressingly practical problem. The information overload can be reduced by text summarization together with conventional search engines to efficiently access the relevance of retrieved documents. Automatic document summarization aims to condense the original text into its essential content and to assist in filtering and selection of necessary information [1].Depending on the number of documents to be summarized, the summary can be a single document or a multidocument. Single-document summarization can only condense one document into a shorter representation, whereas multidocument summarization can condense a set of documents into a summary. Multidocument summarization can be considered as an extension of single-document summarization and used for precisely describing the information contained in a cluster of documents and facilitate users to understand the document cluster. Since it combines and integrates the information across documents, it performs knowledge synthesis and knowledge discovery and can be used for knowledge acquisition [2].There are two approaches for document summarization: supervised and unsupervised [3]. The supervised approaches treat document summarization as a classification and the task formalize as identifying whether a sentence should be included in the summary or not. However, they require training samples. The unsupervised methods usually utilize clustering algorithms to score the sentences in the documents by combining a set of predefined features [4–6].The summarization task can also be categorized as either generic or query oriented. A query-oriented summary presents the information that is more relevant to the given queries, while a generic summary gives an overall sense of the document’s content [7, 8].In this paper, we focus on the unsupervised generic text summarization, which generates a summary by extracting salient sentences in given document(s). We represent generic text summarization as a modifiedp-median problem. One of the advantages of this approach is that it directly discovers key sentences in the given collection and covers the main content of the original source(s). Another advantage of our model is that it can reduce redundancy in the summary. In this paper, a self-adaptive differential evolution (DE) algorithm is created to solve the optimization problem. The performance of the proposed approach is tested on the DUC2006 dataset and is compared with baseline systems. The effectiveness of the proposed approach is demonstrated.The rest of this paper is organized as follows. Section2 gives brief review of related work. Formulation of sentence selection problem for text summarization is introduced in Section 3. Section 4 describes a modified DE algorithm to solve the optimization problem. The numerical experiments and results are given in Section 5. Finally, we conclude our paper in Section 6.


## 2. Related Work

Generally, document summarization methods can be divided into two categories: abstractive and extractive [4, 9]. Extractive summarization is a simple but robust method for text summarization and it involves assigning saliency scores to some textual units of the documents and extracting those with highest scores. Abstraction can be described as reading and understanding the text to recognize its content, which is then compiled in a concise text. In general, an abstract can be described as summary comprising concepts/ideas taken from the source that are then reinterpreted and presented in a different form, whilst an extract is a summary consisting of units of text taken from the source and presented verbatim [10].Many approaches have been proposed for document summarization based on the diversity. The pioneer work for diversity-based document summarization is MMR (Maximal Marginal Relevance); it was introduced by Carbonell and Goldstein [11]. The method MMR summarizes document by calculating the cosine similarity between a given query and a document and the cosine similarity between the currently selective sentence and the previously selected sentence. MMI (Maximal Marginal Importance) [12] is also a diversity-based text summarization method for summary generation. It depends on the extraction of the most important sentences from the original text. Most features (i.e., sentence centrality; title feature; word sentence score; keyword feature; similarity to first sentence) used in this method are combined in a linear combination to show the importance of the sentence. CollabSum [13] reduces redundancy by discarding the highly overlapping sentences with already extracted highly ranked sentences.Clustering has become an increasingly important topic with explosion of information available via the Internet and electronic government services. It is an important tool in text mining and knowledge discovery. Its ability to automatically group similar textual objects together enables one to discover hidden similarity and key concepts, as well as to summarize a large amount of text into a small number of groups [14]. In [15], the clustering is used as an effective tool for finding the diversity among the sentences. This work firstly clusters the sentences and uses the obtained sentence clusters to generate a summary. The paper [16] proposes a query-based multidocument summarization method, using NNM semantic features and the clustering method. The works [17–19] use the NGD-based sentence similarity measure to cluster sentences, so that related sentences can be joined together in a briefer representation of the original text. Recently, a new language model, factorization with given bases (FGB) [20], is proposed for document clustering and summarization by making use of both word-document matrix and word-sentence matrix.Ouyang et al. [21] apply a machine learning approach to topic-based summarization by regarding sentence scoring as a regression problem. The regression function is learned from the Support Vector Regression (SVR) model, which is the regression type of Support Vector Machine (SVM) and is capable of building state-of-art optimum approximation functions. It provides a way of combining the features automatically and effectively. To save the costly manual annotation time and effort, they construct training data automatically from the document sets where the reference summaries generated by human have been provided. The paper [22] investigates the problem of multi-topic-based query-oriented summarization. Authors of this work formalize the major tasks and propose a probabilistic approach to solve the tasks. They study two strategies for simultaneously modeling document contents and the query information and present four methods to score sentences in the documents based on the learned topic models. HierSum [23] is a generative summarization method based on topic models, which uses sentences as an additional level. Using an approximation for inference, sentences are greedily added to a summary so long as they decrease Kullback-Leibler divergence. Ranking plays an important role in information retrieval and natural language processing applications. The main contributions of the work [24] are threefold: (1) presents a “rank-learn-combine” unsupervised ensemble-ranking framework, namely, interactive ranking (iRANK); (2) explores two ranking refinement strategies that either utilize the feedback as an additional ranking feature or to ensure rank consistency during refinement; (3) proposes two new sentence-ranking algorithms based on iRANK for query-focused summarization. An approach, proposed in [25], for producing a summary consists of three steps. First, it associates sentences and queries with a representation in the latent topic space of a PLSA model by estimating their mixing proportions. It then computes several sentence-level features based on the similarity of sentence and query distributions over latent topics. Finally, it combines individual feature scores linearly into an overall sentence score to create a ranking, which we use to select sentences for the summary. Hybrid hierarchical summarizer, HybHSum [26], is based on a hybrid learning approach to extract sentences for generating summary. It discovers hidden topic distributions of sentences in a given document cluster along with provided summary sentences based on hierarchical Latent Dirichlet Allocation (LDA), which is a generalization of LDA. Contributions of this work are as follows: (1) construction of hierarchical probabilistic model designed to discover the topic structures of all sentences; (2) representation of sentences by metafeatures to characterize their candidacy for inclusion in summary text; (3) implementation of a feasible inference method based on a regression model to enable scoring of sentences in test document clusters without retraining.With the publishing of work [27], an optimization approach began to be applied actively in extractive document summarization. It is directly connected with character of the extractive summarization; in other words, identification of informative sentences in documents by the nature is an optimization problem. Takamura and Okumura [28] represented text summarization as maximum coverage problem with knapsack constraint. McDonald [29] formalized text summarization as a knapsack problem and obtained the global solution and its approximate solutions. Wang et al. [30] proposed a Bayesian sentence-based topic model (BSTM) for multidocument summarization by making use of both the word-document and word-sentence associations. The BSTM models the probability distributions of selecting sentences given topics and provides a principled way for the summarization task. Tao et al. [31] have designed word-based and sentence-based association networks and proposed word and sentence weighting approaches based on how much cooccurrence information they contain and applied to text summarization. In [32], text summarization formalized as a budgeted median problem. This model covers the whole document cluster through sentence assignment, since in this model one of the selected sentences as much as possible represents every sentence. An advantage of this method is that it can incorporate asymmetric relations between sentences in a natural manner. Huang et al. [33] consider document summarization as a multiobjective optimization problem. In particular, they formulate four objective functions, namely, content coverage, relevancy, redundancy, and text coherence. They measure the possible summaries based on the identified core terms and main topics (i.e., a cluster of semantically or statistically related core terms).


## 3. Problem Statement and Its Mathematical Formulation

### 3.1. Problem Statement

In this section, we present our approach towards all of the four aspects of summarization as follows.(1)
Relevancy. A good summary should contain the most important information, that is, selected sentences should be relevant to the main content of the source.(2)
Content Coverage. A summary should contain every important aspect of the document. By considering coverage, the information loss in summarization can be minimized.(3)
Diversity. A good summary should be concise and contain as few redundant sentences as possible, that is, two sentences providing similar information should not be both present in the summary. In practice, enforcing diversity in summarization can effectively reduce redundancy among the sentences.(4)
Length. A summary should be bounded in length.Optimizing all four properties jointly is a challenging task and is an example of a global summarization problem. That is why the inclusion of relevant sentences relies not only on properties of the sentences themselves, but also on properties of every other sentence in the summary [33]. Our goal is to choose from a set of documents a subset of sentences so that the created summary has satisfied the above four aspects. In our study, this goal has been reached with modifying of the p-median problem.To apply ap-median problem to sentence-extraction-based document summarization, each sentence in a document collection should be presented as a point in Euclidean space and defined a measure to calculate a similarity between points (sentences).


### 3.2. Sentence Representation and Similarity Measure

Let a document collection be decomposed into a set of sentencesD={s1,s2,…,sn}, where n is the number of sentences, si denotes ith sentence in D. For calculation of similarity between textual units, each of them should be presented as a vector. The vector space model is the most known representation scheme for textual units. The vector space model represents textual units by counting terms or sequence of terms. Let T={t1,t2,…,tm} represent all the distinct terms occurring in the collection, where m is the number of different terms.Vector Space Model
The standard vector space model (hereinafter referred to as VSM) is a model for representing text in a vector space based on the bag of words approach. It was first presented as a model for Information Retrieval (IR) in [34]. In VSM, text units of a corpus are represented by vectors. Traditionally a whole document is used as a text unit, but any other text unit like paragraphs or sentences can be used just as well. Each dimension of a vector corresponds to a term that is present in the corpus. A term might be, for example, a single word, N-gram, or a phrase. If a term occurs in a sentence, the value of that dimension is nonzero. Values can be binary (1→ term is present in the sentence, 0→ term is not present in the sentence), frequencies of terms in the sentence, or term weights [35].Term Weighting
The idea behind term weighting is to assign a weight to represent the importance of a term. The raw frequency of a term only states how often a term occurs in a document without measuring the importance of that term within the sentence or within the whole collection. Different weighting schemes are available. The most common and popular one is the tf-isf weighting scheme. It combines local and global weighting of a term.Local Term Weighting (tf)
It measures the importance of a term within a sentence:(1)tfik=freqik,
where freqik is the frequency of term tk in sentence si. This formula assigns a higher weight to terms that occur often in a sentence.Global Term Weighting (isf)
The inverse sentence frequency (isf) measures the importance of a term within the sentence collection:(2)isfik=log⁡⁡(nnk).
Here n is the number of all sentences in the collection, and nk is the number of sentences that term tk occurs in sentence si. A term that occurs in every sentence of the collection gets a lower isf value. This reflects the fact that it is not as significant for the distinction between sentences as terms that occur rarely throughout the sentence collection. The isf factor has been introduced to improve the discriminating power of terms in the traditional IR.
This results in the tf-isf weighting scheme:(3)wik=tfik×isfk=tfik×log⁡⁡(nnk),
where the weight wik of a term tk in a sentence si is defined by the product of the local weight of term tk in sentence si and the global weight of term tk.Similarity Calculation
A very popular similarity measure is the cosine similarity. The cosine similarity uses the weighting terms representation of the sentences. According to the VSM the sentencesi represented as a weighting vector of the terms, si=[wi1,wi2,…,wim], where wik is the weight of the term tk in the sentence si. This measure is based on the angle α between two vectors in the VSM. The closer the vectors are to each other the more similar are the sentences. The calculation of an angle between two vectors si=[wi1,wi2,…,wim] and sj=[wj1,wj2,…,wjm] can be derived from the Euclidean dot product:
(4)(si,sj)=|si|⋅|sj|⋅cos⁡⁡α.This states that the product of two vectors is given by the product of their norms (in spatial terms, the length of the vector) multiplied by the cosine of the angleα between them. Given (4) the cosine similarity is therefore(5)sim(si,sj)=cos⁡⁡α=(si,sj)|si|⋅|sj|=∑k=1mwikwjk∑k=1mwik2⋅∑k=1mwjk2,i,j=1,2,…,n.


### 3.3. Mathematical Formulation of Problem

First, we introduce the following variables and notations:(i)
(6)yj={1,if sentencesjis selected as median,0,otherwise,(ii)
(7)xij={1,if sentencesiis allocated to median,sj0,otherwise,(iii)
O=(o1,o2,…,om) is the center of collection D={s1,s2,…,sn}, which kth component ok is defined as:
(8)ok=(1n)∑i=1nwik,k=1,2,…,m,(iv)
li is the length (in words or bytes) of sentence si,(v)
L is the length of summary.We attempt to find a subset of the setD={s1,s2,…,sn} that covers the main content of the document collection while reducing the redundancy in the summary. If we let S⊂D be the set of sentences constituting a summary, then the similarity between the set of sentences and the summary is going to be sim(S,D), which we would like to maximize. As already mentioned above, the offered model is based on the p-median problem. This approach is used to detect the topics of documents. Detection of topics helps to cover as much as possible themes from the documents. After topics detection to form a summary from each group should be selected such sentences that would be relevant to corresponding topic. For this purpose the informative sentences from each group, that is, median sentences, are selected. On the other hand, the summary length should not exceed the given limit. In our statement, it is supposed that the summary will be created by median sentences then at a choice of sentence as median, it is necessary to meet a condition that the sum of length of the selected median sentences will not exceed the given summary length. From [36] we know that the centre is the basic point carrying the main content of sentence collection. Therefore relevance of the summary will be defined as an affinity measure between them and the centre O of all set of sentences, sim(S,O).Under the notations and statements above, text summarization task, we formalize as follows:maximize(9)f(x,y)=sim(⊕j=1nsjyj,O)+∑i=1n∑j=1nsim(si,sj)xij-∑i=1n-1∑j=i+1nsim(si,sj)yiyj,
subject to(10)∑j=1nxij=1,∀i=1,2,…,n,(11)xij≤yj,∀i,j=1,2,…,n,(12)∑j=1nyjlj≤L,(13)yj∈{0,1},∀j=1,2,…,n,(14)xij∈{0,1},∀i,j=1,2,…,n,
where S=⊕j=1nsjyj is the summary and ⊕ is the concatenation operation. Sentence concatenation is the operation of joining two sentences end to end.The objective function (9) balances the relevance, content coverage, and diversity in the summary. The first term aims to evaluate the relevancy of the summary. Higher value of the term corresponds to higher relevancy of the summary. The second term aims to evaluate the content coverage of the summary. The high value of the term provides that sentences be well grouped in topics. As said above the summary should not contain multiple sentences that convey the same information. Since, in our formulation, it is supposed that the summary will be formed of medians then at choosing of sentences as a median, it is necessary to meet a condition that similarity between them was minimum. This requirement will be provided by the third term. Lower value of the term corresponds to higher diversity in the summary. Constraint (10) ensures that each sentence should be associated with one and only one median, while constraints (11) restrict sentences to be assigned to open medians. Constraint (12) implies that the length constraint of summary cannot be violated. Finally, constraints (13) and (14) refer to integrality constraints.As seen, the ranges of the three terms in (9) are very different. For example, the range of the first term is [0,1], whereas those of the second and third ones are [0,n] and [0,n(n-1)/2], respectively. Therefore, in (9) we normalize the second and third terms so that their ranges were also [0,1]. Thus, we get the following objective function:(9′)f(x,y)=sim(⊕j=1nsjyj,O)+1n∑i=1n∑j=1nsim(si,sj)xij-2n(n-1)∑i=1n-1∑j=i+1nsim(si,sj)yiyj.Now, our objective is to find the binary assignmentsY=[yj] and X=[xij] with the high relevancy, best content coverage, and less redundancy such that the summary length is at most L.


## 3.1. Problem Statement

In this section, we present our approach towards all of the four aspects of summarization as follows.(1)
Relevancy. A good summary should contain the most important information, that is, selected sentences should be relevant to the main content of the source.(2)
Content Coverage. A summary should contain every important aspect of the document. By considering coverage, the information loss in summarization can be minimized.(3)
Diversity. A good summary should be concise and contain as few redundant sentences as possible, that is, two sentences providing similar information should not be both present in the summary. In practice, enforcing diversity in summarization can effectively reduce redundancy among the sentences.(4)
Length. A summary should be bounded in length.Optimizing all four properties jointly is a challenging task and is an example of a global summarization problem. That is why the inclusion of relevant sentences relies not only on properties of the sentences themselves, but also on properties of every other sentence in the summary [33]. Our goal is to choose from a set of documents a subset of sentences so that the created summary has satisfied the above four aspects. In our study, this goal has been reached with modifying of the p-median problem.To apply ap-median problem to sentence-extraction-based document summarization, each sentence in a document collection should be presented as a point in Euclidean space and defined a measure to calculate a similarity between points (sentences).


## 3.2. Sentence Representation and Similarity Measure

Let a document collection be decomposed into a set of sentencesD={s1,s2,…,sn}, where n is the number of sentences, si denotes ith sentence in D. For calculation of similarity between textual units, each of them should be presented as a vector. The vector space model is the most known representation scheme for textual units. The vector space model represents textual units by counting terms or sequence of terms. Let T={t1,t2,…,tm} represent all the distinct terms occurring in the collection, where m is the number of different terms.Vector Space Model
The standard vector space model (hereinafter referred to as VSM) is a model for representing text in a vector space based on the bag of words approach. It was first presented as a model for Information Retrieval (IR) in [34]. In VSM, text units of a corpus are represented by vectors. Traditionally a whole document is used as a text unit, but any other text unit like paragraphs or sentences can be used just as well. Each dimension of a vector corresponds to a term that is present in the corpus. A term might be, for example, a single word, N-gram, or a phrase. If a term occurs in a sentence, the value of that dimension is nonzero. Values can be binary (1→ term is present in the sentence, 0→ term is not present in the sentence), frequencies of terms in the sentence, or term weights [35].Term Weighting
The idea behind term weighting is to assign a weight to represent the importance of a term. The raw frequency of a term only states how often a term occurs in a document without measuring the importance of that term within the sentence or within the whole collection. Different weighting schemes are available. The most common and popular one is the tf-isf weighting scheme. It combines local and global weighting of a term.Local Term Weighting (tf)
It measures the importance of a term within a sentence:(1)tfik=freqik,
where freqik is the frequency of term tk in sentence si. This formula assigns a higher weight to terms that occur often in a sentence.Global Term Weighting (isf)
The inverse sentence frequency (isf) measures the importance of a term within the sentence collection:(2)isfik=log⁡⁡(nnk).
Here n is the number of all sentences in the collection, and nk is the number of sentences that term tk occurs in sentence si. A term that occurs in every sentence of the collection gets a lower isf value. This reflects the fact that it is not as significant for the distinction between sentences as terms that occur rarely throughout the sentence collection. The isf factor has been introduced to improve the discriminating power of terms in the traditional IR.
This results in the tf-isf weighting scheme:(3)wik=tfik×isfk=tfik×log⁡⁡(nnk),
where the weight wik of a term tk in a sentence si is defined by the product of the local weight of term tk in sentence si and the global weight of term tk.Similarity Calculation
A very popular similarity measure is the cosine similarity. The cosine similarity uses the weighting terms representation of the sentences. According to the VSM the sentencesi represented as a weighting vector of the terms, si=[wi1,wi2,…,wim], where wik is the weight of the term tk in the sentence si. This measure is based on the angle α between two vectors in the VSM. The closer the vectors are to each other the more similar are the sentences. The calculation of an angle between two vectors si=[wi1,wi2,…,wim] and sj=[wj1,wj2,…,wjm] can be derived from the Euclidean dot product:
(4)(si,sj)=|si|⋅|sj|⋅cos⁡⁡α.This states that the product of two vectors is given by the product of their norms (in spatial terms, the length of the vector) multiplied by the cosine of the angleα between them. Given (4) the cosine similarity is therefore(5)sim(si,sj)=cos⁡⁡α=(si,sj)|si|⋅|sj|=∑k=1mwikwjk∑k=1mwik2⋅∑k=1mwjk2,i,j=1,2,…,n.


## 3.3. Mathematical Formulation of Problem

First, we introduce the following variables and notations:(i)
(6)yj={1,if sentencesjis selected as median,0,otherwise,(ii)
(7)xij={1,if sentencesiis allocated to median,sj0,otherwise,(iii)
O=(o1,o2,…,om) is the center of collection D={s1,s2,…,sn}, which kth component ok is defined as:
(8)ok=(1n)∑i=1nwik,k=1,2,…,m,(iv)
li is the length (in words or bytes) of sentence si,(v)
L is the length of summary.We attempt to find a subset of the setD={s1,s2,…,sn} that covers the main content of the document collection while reducing the redundancy in the summary. If we let S⊂D be the set of sentences constituting a summary, then the similarity between the set of sentences and the summary is going to be sim(S,D), which we would like to maximize. As already mentioned above, the offered model is based on the p-median problem. This approach is used to detect the topics of documents. Detection of topics helps to cover as much as possible themes from the documents. After topics detection to form a summary from each group should be selected such sentences that would be relevant to corresponding topic. For this purpose the informative sentences from each group, that is, median sentences, are selected. On the other hand, the summary length should not exceed the given limit. In our statement, it is supposed that the summary will be created by median sentences then at a choice of sentence as median, it is necessary to meet a condition that the sum of length of the selected median sentences will not exceed the given summary length. From [36] we know that the centre is the basic point carrying the main content of sentence collection. Therefore relevance of the summary will be defined as an affinity measure between them and the centre O of all set of sentences, sim(S,O).Under the notations and statements above, text summarization task, we formalize as follows:maximize(9)f(x,y)=sim(⊕j=1nsjyj,O)+∑i=1n∑j=1nsim(si,sj)xij-∑i=1n-1∑j=i+1nsim(si,sj)yiyj,
subject to(10)∑j=1nxij=1,∀i=1,2,…,n,(11)xij≤yj,∀i,j=1,2,…,n,(12)∑j=1nyjlj≤L,(13)yj∈{0,1},∀j=1,2,…,n,(14)xij∈{0,1},∀i,j=1,2,…,n,
where S=⊕j=1nsjyj is the summary and ⊕ is the concatenation operation. Sentence concatenation is the operation of joining two sentences end to end.The objective function (9) balances the relevance, content coverage, and diversity in the summary. The first term aims to evaluate the relevancy of the summary. Higher value of the term corresponds to higher relevancy of the summary. The second term aims to evaluate the content coverage of the summary. The high value of the term provides that sentences be well grouped in topics. As said above the summary should not contain multiple sentences that convey the same information. Since, in our formulation, it is supposed that the summary will be formed of medians then at choosing of sentences as a median, it is necessary to meet a condition that similarity between them was minimum. This requirement will be provided by the third term. Lower value of the term corresponds to higher diversity in the summary. Constraint (10) ensures that each sentence should be associated with one and only one median, while constraints (11) restrict sentences to be assigned to open medians. Constraint (12) implies that the length constraint of summary cannot be violated. Finally, constraints (13) and (14) refer to integrality constraints.As seen, the ranges of the three terms in (9) are very different. For example, the range of the first term is [0,1], whereas those of the second and third ones are [0,n] and [0,n(n-1)/2], respectively. Therefore, in (9) we normalize the second and third terms so that their ranges were also [0,1]. Thus, we get the following objective function:(9′)f(x,y)=sim(⊕j=1nsjyj,O)+1n∑i=1n∑j=1nsim(si,sj)xij-2n(n-1)∑i=1n-1∑j=i+1nsim(si,sj)yiyj.Now, our objective is to find the binary assignmentsY=[yj] and X=[xij] with the high relevancy, best content coverage, and less redundancy such that the summary length is at most L.


## 4. Self-Adaptive Differential Evolution Algorithm

DE proposed by Storn and Price [37] is a fast and simple technique, which performs well on a wide variety of problems [38–40]. DE is a population-based stochastic search technique like genetic algorithm using the three operators: crossover, mutation, and selection. The main difference in constructing better solutions is that genetic algorithms rely on crossover while DE relies on mutation operation. This main operation is based on the differences of randomly sampled pairs of solutions in the population. The algorithm uses mutation operation as a search mechanism and selection operation to direct the search toward the prospective regions in the search space.The basic idea which DE scheme is based on is to generate new trial vector. When mutation is implemented, several differential vectors obtained from the difference of several randomly chosen parameter vectors are added to the target vector to generate a mutant vector. Then, a trial vector is produced by crossover recombining the obtained mutant vector with the target vector. Finally, if the trial vector yields better fitness value than the target vector, replace the target vector with the trial vector [37–40].In this section, a self-adaptive DE (SaDE) algorithm is created to solve the optimization problem (9′)–(14). The main steps of the SaDE algorithm are described below.


### 4.1. Initialization of the Parameter Vectors

DE searches for a global optimum point ann-dimensional real parameter space. It begins with a randomly initiated population of NP n-dimensional real-valued parameter vectors. Each vector forms a candidate solution to the multidimensional optimization problem. We shall denote subsequent generations in DE by t=0,1,…,tmax. Since the parameter vectors are likely to be changed over different generations, we adopt the following notation for representing the pth vector of the population at the current t generation: Xp(t)=[xp,1(t),xp,2(t),…,xp,n(t)], where xp,i(t) is the ith component of the pth vector in the population, i=1,2,…,n, p=1,2,…,NP [38].For each parameter of the problem, there may be a certain range within which the value of the parameter should be restricted, often because parameters are related to physical components or measures that have natural bounds. The initial population (att=0) should cover the entire search space as much as possible by uniformly randomizing the initial individuals within the search space constrained by the prescribed minimum and maximum parameter bounds Xmin=[x1min,…,xnmin] and Xmax=[x1max,…,xnmax]. For example, the initial value of the ith component of the pth individual Xp(t) at generation t=0 is generated by [38](15)xp,i(0)=ximin⁡+(ximax⁡-ximin⁡)⋅randp,i,
where randp,i is a uniformly distributed random number lying between 0 and 1 and is instantiated independently for each component i∈{1,2,…,n} of the pth vector.


### 4.2. Mutation with Self-Adaptive Scaling Factor

After initialization, DE employs the mutation operation to produce a mutant vector with respect to each individual, so-called target vector, in the current generation. For each target vector,Xp(t), at generation t, its associated mutant vector Yp(t) can be generated by following strategy:(16)Yp(t)=Xp1(t)+F⋅(Xp2(t)-Xp3(t)),
where Xp1(t), Xp2(t), and Xp3(t) are randomly chosen individuals from the same generation with p≠p1≠p2≠p3 and the F is a scaling factor which is a positive constant. The scaling factor F is used to effect the amplification of the difference vector, Xp2(t)-Xp3(t). A general setting for this factor is F∈[0,2]. However, Storn and Price [37] suggest F∈[0.5,1] as such a setting may result in good optimization effectiveness.The scaling factorF that is set by the user is generally a key factor affecting the DE’s performance. Choosing suitable value of F is difficult for DE, which is usually problem dependent. Therefore, since introduction, a large body of research has been done to study the performance of DE and to improve its performance. In recent years, many approaches are attempted to improve the performance of DE by variable scaling factor [37–41]. The scaling factor is critical for the performance of DE, which balances global exploration and local exploitation abilities of the population. A large mutation factor facilitates exploration, but it takes the population long time to converge. Conversely, a small scaling factor makes the population fast converge, but it sometimes leads to local optimal. Hence, the adaptive and self-adaptive DE algorithms are proposed in the literature [38–41]. Furthermore, introducing the same scaling factor for all individuals, by ignoring the differences among individuals’ performances, is not a precise model. In fact, during the search every individual dynamically changes its position, so every individual locates in a complex environment and faces a different situation. Therefore, every individual may have different tradeoffs between global and local search abilities.Motivated by what is previously mentioned in this section, the scaling factor is dynamically adapted for every individual by introducing a measure called affinity index, which characterizes the nearness of personal solution of individuals to the global solution of population at thetth iteration. Based on this index, every individual could decide how to adjust the values of scaling factor. For this purpose, the mutation strategy is given by(17)Yp(t)=Xp(t)+Fp(t)⋅(Xp1(t)-Xp2(t)).To calculate the scaling factor forpth target vector in tth iteration, denoted by Fp(t) in (17), first the affinity index (AI) is defined as follows:(18)AIp(t)=fit(Xp(t))-fit(Xworst(t))fit(Xbest(t))-fit(Xworst(t)),
where Xbest(t) and Xworst(t) represent the best and worst solution of the population at the iteration t, fit(Xbest(t))=maxp∈{1,…,NP}{fit(Xp(t))} and fit(Xworst(t))=minp∈{1,…,NP}{fit(Xp(t))}, and fit(·) is the fitness function.It can be concluded that a smallAIp(t) means that the pth individual is far away from the global best solution and it needs a strong global exploration, therefore a large perturbation. On the other hand, a big AIp(t) means that pth individual has a high nearness to the global solution, and so it needs a strong local exploitation, therefore a small perturbation [38, 40]. Hence, the value of scaling factor for every target individual in tth iteration is dynamically adapted with the following formula:(19)Fp(t)=11+tanh⁡(2⋅AIp(t)),
where tanh(z) is the hyperbolic tangent function:(20)tanh(z)=exp⁡(z)-exp⁡(-z)exp⁡(z)+exp⁡(-z).Under the assumption and definitions above, it can be concluded that0.5<Fp(t)≤1. Figure 1 depicts the variation of scaling factor (F) versus affinity index (AI(t)).Figure 1
Scaling factor (F) versus affinity index (AI(t)).According to (18) and (19), during the search, the individuals get different values of AIp(t) and then scaling factor depending on their fitness. While the fitness of an individual is far away from the fitness of the global best, AIp(t) for this individual has a small value and the value of scaling factor will be large resulting in strong global search abilities and locate the promising search areas. Meanwhile, when the fitness of an individual achieves near the global best, AIp(t) for this individual has a big value and scaling factor will be set small, depending on the neighbor of its best fitness to the global best value, to facilitate a finer local explorations and so accelerate convergence.


### 4.3. Crossover

To enhance the potential diversity of the population, a crossover operation comes into play after generating the mutant vector through mutation. The mutant vector mixes its components with the target vectorXp(t) under this operation to form the trial vector Zp(t). The DE family of algorithms can use two kinds of crossover methods—exponential (or two-point modulo) and binomial (or uniform) [37, 38]. In this paper we focus on the widely used binomial crossover that is performed on each of the n variables whenever a randomly generated number between 0 and 1 is less than or equal to the CR value. In this case, the number of parameters inherited from the mutant vector has a (nearly) binomial distribution. The scheme may be outlined as(21)zp,i(t)={yp,i(t),ifrandp,i≤CRori=irand,xp,i(t),otherwise,
where yp,i(t) and zp,i(t) are the ith-dimensional components of the vectors Yp(t) and Zp(t), respectively; CR is the predefined crossover probability which is usually set to a fixed value in (0,1) or changes dynamically within (0,1); irand is a number randomly selected from the index set {1,2,…,n} and used to ensure that the trial vector Zp(t) is different from the original solution Xp(t). The crossover rate CR controls the recombination of target vector and mutant vector to generate trial vector.If the values of some parameters of a newly generated trial vector exceed the corresponding upper and lower bounds, then all the components of the trial vector are checked whether they violate the boundary constraints. If theith component zp,i(t) of the mutant vector Zp(t) violates the boundary constraint (15), zp,i(t) is reflected back from the violated boundary constraint as follows:(22)zp,i(t)={2ximin⁡-zp,i(t),ifzp,i(t)<ximin⁡,2ximax⁡-zp,i(t),ifzp,i(t)>ximax⁡,zp,i(t),otherwise.


### 4.4. Selection

The next step of the algorithm calls for selection to determine whether the target or the trial vector survives to the next generation, that is, att=t+1. Then the objective function values of all trial vectors are evaluated. After that, a selection operation is performed. The DE algorithm uses a greedy selection. The selection operator chooses between the target and corresponding trial vectors. A member of the next generation becomes the fittest vector, that is, vector with the better fitness value. For example, if we have a maximization problem, the selection operation can be expressed as follows:
(23)Xp(t+1)={Zp(t),iff(Zp(t))≥f(Xp(t)),Xp(t),otherwise.Therefore, if the trial vector yields an equal or better value of the objective function, it replaces the corresponding target vector in the next generation; otherwise the target is retained in the population. Hence, the population either gets better (with respect to the maximization of the objective function) or remains the same in fitness status, but never deteriorates.


### 4.5. Binarization

Binary DE is the modified version of DE, which operates in binary search spaces. In the binary DE, the real value of genes is converted to the binary space by the rule [42](24)xp,i(t+1)={1,ifrandp,i<sigm(xp,i(t+1)),0,otherwise,
where, as before, randp,i is a uniformly distributed random number lying between 0 and 1, which is instantiated independently for each ith component of the pth parameter vector. sigm(z) is the sigmoid function:(25)sigm(z)=11+exp⁡(-z).The motivation to use the sigmoid function (25) is to map interval [ximin,ximax] for each i∈{1,2,…,n} into the interval (0,1), which is equivalent to the interval of a probability function. After such transformation from the real-coded representation (15) we obtain the binary-coded representation, xp,i(t)∈{0,1}, where the xp,i(t)=1 indicates that the ith sentence is selected to be included to the summary, otherwise, the ith sentence will not be selected. For example, the individual Xp(t)=[1,0,0,1,1] represents a candidate solution that first, fourth, and fifth sentences are selected to be included to the summary.


### 4.6. Constraint Handling

When population initialization, mutation, crossover, and binarization have been implemented, the new generated solution may not satisfy the constraint (12). The most popular constraint handling strategy at present is penalty method, which often uses function to convert a constrained problem into an unconstraint one [43]. Therefore, this strategy is very convenient to handle the constraints for evolutionary algorithm by punishing the infeasible solution during the selection procedure to ensure the feasible ones are favored. However, this strategy has some drawbacks and the main one is the requirement of multiple runs for the fine-tuning of penalty factors, which would increase the computational time and degrade the efficiency of the algorithm. In order to overcome the drawbacks of penalty method and handle the constraints of problem effectively, the following heuristic procedure is produced for all NP solutions in the population to resolve the constraint (12).Constraint is handled by using a suitable fitness function, which depends on the current population. Solutions in a population are assigned fitness so that feasible solutions are emphasized more than infeasible solutions. The following three criteria are satisfied during the handling process.(i)
Any feasible solution wins over any infeasible solution.(ii)
Two feasible solutions are compared only based on their objective function values.(iii)
Two infeasible solutions are compared based on the amount of constraint violation.


### 4.7. Stopping Criterion

Mutation, crossover and selection continue until some stopping criterion is satisfied. If the predefined maximum iteration number is reached, then the DE algorithm is terminated and outputs the best solution obtained by DE as the result. Otherwise, it is continued to carry out individual’s position updates process (mutation, crossover, and selection process).


### 4.8. Parameter Settings of SaDE Algorithm

The crucial parameters that affect the performance of DE are the population size (NP), crossover rate (CR), and the scaling parameter (F). In the proposed SaDE algorithm the population size, NP=50, is maintained constant throughout the evolution process. This is a heuristic choice. For example, the value of NP can be increased for obtaining the global solution with higher probability. However, the higher the value of NP is, the higher the number of fitness evaluation is. The crossover rate controls which and how many components are mutated in each element of the current population. The crossover rate CR is a probability of mixing between trial and target vectors. A large CR often speeds up convergence. However, from a certain value upwards, the convergence speed may decrease or the population may converge prematurely. In [40], a good choice for CR is said to be between 0.3 and 0.9. Therefore we ran self-adaptive DE for CR=0.9,0.8,0.7,0.6,0.5,0.4, and 0.3. The best results presented for DE are obtained for CR=0.9. Other parameters are set as tmax=1000, ximin=-5, and ximax=5 for all i∈{1,2,…,n}.


### 4.9. Framework of the SaDE Algorithm

The pseudocode of the proposed SaDE algorithm can be summarized as follows.Step 1 (initial population).
Using the rule (15) create an initial population.Step 2 (binarization).
Transform real-coded individuals to binary-coded individuals using (24).Step 3 (select best and worst individuals).
Select the individuals with current best and worst solution.Step 4 (generate trial vector).
Generate trial vector of the target vector using the mutation (17)–(20) and crossover (21) operators.Step 5 (check the boundary constraints).
Check the boundary constraints (15) for the components of the trial vector using (22).Step 6 (binarization).
Transform real-coded trial vector to binary-coded trial vector using (24).Step 7 (constraint handling).
Handle the constraint (12) using the strategy described in Section 4.6.Step 8 (selection).
If a trial vector is better than its target vector is, then replace the target vector by trial vector in the next generation.Step 9 (stopping criterion).
Repeat Steps2–8 until a user-specified maximum number tmax of fitness calculation is reached.Step 10 (output).
Report the summary obtained by the best individual as the final solution at maximum number of fitness calculation.


## 4.1. Initialization of the Parameter Vectors

DE searches for a global optimum point ann-dimensional real parameter space. It begins with a randomly initiated population of NP n-dimensional real-valued parameter vectors. Each vector forms a candidate solution to the multidimensional optimization problem. We shall denote subsequent generations in DE by t=0,1,…,tmax. Since the parameter vectors are likely to be changed over different generations, we adopt the following notation for representing the pth vector of the population at the current t generation: Xp(t)=[xp,1(t),xp,2(t),…,xp,n(t)], where xp,i(t) is the ith component of the pth vector in the population, i=1,2,…,n, p=1,2,…,NP [38].For each parameter of the problem, there may be a certain range within which the value of the parameter should be restricted, often because parameters are related to physical components or measures that have natural bounds. The initial population (att=0) should cover the entire search space as much as possible by uniformly randomizing the initial individuals within the search space constrained by the prescribed minimum and maximum parameter bounds Xmin=[x1min,…,xnmin] and Xmax=[x1max,…,xnmax]. For example, the initial value of the ith component of the pth individual Xp(t) at generation t=0 is generated by [38](15)xp,i(0)=ximin⁡+(ximax⁡-ximin⁡)⋅randp,i,
where randp,i is a uniformly distributed random number lying between 0 and 1 and is instantiated independently for each component i∈{1,2,…,n} of the pth vector.


## 4.2. Mutation with Self-Adaptive Scaling Factor

After initialization, DE employs the mutation operation to produce a mutant vector with respect to each individual, so-called target vector, in the current generation. For each target vector,Xp(t), at generation t, its associated mutant vector Yp(t) can be generated by following strategy:(16)Yp(t)=Xp1(t)+F⋅(Xp2(t)-Xp3(t)),
where Xp1(t), Xp2(t), and Xp3(t) are randomly chosen individuals from the same generation with p≠p1≠p2≠p3 and the F is a scaling factor which is a positive constant. The scaling factor F is used to effect the amplification of the difference vector, Xp2(t)-Xp3(t). A general setting for this factor is F∈[0,2]. However, Storn and Price [37] suggest F∈[0.5,1] as such a setting may result in good optimization effectiveness.The scaling factorF that is set by the user is generally a key factor affecting the DE’s performance. Choosing suitable value of F is difficult for DE, which is usually problem dependent. Therefore, since introduction, a large body of research has been done to study the performance of DE and to improve its performance. In recent years, many approaches are attempted to improve the performance of DE by variable scaling factor [37–41]. The scaling factor is critical for the performance of DE, which balances global exploration and local exploitation abilities of the population. A large mutation factor facilitates exploration, but it takes the population long time to converge. Conversely, a small scaling factor makes the population fast converge, but it sometimes leads to local optimal. Hence, the adaptive and self-adaptive DE algorithms are proposed in the literature [38–41]. Furthermore, introducing the same scaling factor for all individuals, by ignoring the differences among individuals’ performances, is not a precise model. In fact, during the search every individual dynamically changes its position, so every individual locates in a complex environment and faces a different situation. Therefore, every individual may have different tradeoffs between global and local search abilities.Motivated by what is previously mentioned in this section, the scaling factor is dynamically adapted for every individual by introducing a measure called affinity index, which characterizes the nearness of personal solution of individuals to the global solution of population at thetth iteration. Based on this index, every individual could decide how to adjust the values of scaling factor. For this purpose, the mutation strategy is given by(17)Yp(t)=Xp(t)+Fp(t)⋅(Xp1(t)-Xp2(t)).To calculate the scaling factor forpth target vector in tth iteration, denoted by Fp(t) in (17), first the affinity index (AI) is defined as follows:(18)AIp(t)=fit(Xp(t))-fit(Xworst(t))fit(Xbest(t))-fit(Xworst(t)),
where Xbest(t) and Xworst(t) represent the best and worst solution of the population at the iteration t, fit(Xbest(t))=maxp∈{1,…,NP}{fit(Xp(t))} and fit(Xworst(t))=minp∈{1,…,NP}{fit(Xp(t))}, and fit(·) is the fitness function.It can be concluded that a smallAIp(t) means that the pth individual is far away from the global best solution and it needs a strong global exploration, therefore a large perturbation. On the other hand, a big AIp(t) means that pth individual has a high nearness to the global solution, and so it needs a strong local exploitation, therefore a small perturbation [38, 40]. Hence, the value of scaling factor for every target individual in tth iteration is dynamically adapted with the following formula:(19)Fp(t)=11+tanh⁡(2⋅AIp(t)),
where tanh(z) is the hyperbolic tangent function:(20)tanh(z)=exp⁡(z)-exp⁡(-z)exp⁡(z)+exp⁡(-z).Under the assumption and definitions above, it can be concluded that0.5<Fp(t)≤1. Figure 1 depicts the variation of scaling factor (F) versus affinity index (AI(t)).Figure 1
Scaling factor (F) versus affinity index (AI(t)).According to (18) and (19), during the search, the individuals get different values of AIp(t) and then scaling factor depending on their fitness. While the fitness of an individual is far away from the fitness of the global best, AIp(t) for this individual has a small value and the value of scaling factor will be large resulting in strong global search abilities and locate the promising search areas. Meanwhile, when the fitness of an individual achieves near the global best, AIp(t) for this individual has a big value and scaling factor will be set small, depending on the neighbor of its best fitness to the global best value, to facilitate a finer local explorations and so accelerate convergence.


## 4.3. Crossover

To enhance the potential diversity of the population, a crossover operation comes into play after generating the mutant vector through mutation. The mutant vector mixes its components with the target vectorXp(t) under this operation to form the trial vector Zp(t). The DE family of algorithms can use two kinds of crossover methods—exponential (or two-point modulo) and binomial (or uniform) [37, 38]. In this paper we focus on the widely used binomial crossover that is performed on each of the n variables whenever a randomly generated number between 0 and 1 is less than or equal to the CR value. In this case, the number of parameters inherited from the mutant vector has a (nearly) binomial distribution. The scheme may be outlined as(21)zp,i(t)={yp,i(t),ifrandp,i≤CRori=irand,xp,i(t),otherwise,
where yp,i(t) and zp,i(t) are the ith-dimensional components of the vectors Yp(t) and Zp(t), respectively; CR is the predefined crossover probability which is usually set to a fixed value in (0,1) or changes dynamically within (0,1); irand is a number randomly selected from the index set {1,2,…,n} and used to ensure that the trial vector Zp(t) is different from the original solution Xp(t). The crossover rate CR controls the recombination of target vector and mutant vector to generate trial vector.If the values of some parameters of a newly generated trial vector exceed the corresponding upper and lower bounds, then all the components of the trial vector are checked whether they violate the boundary constraints. If theith component zp,i(t) of the mutant vector Zp(t) violates the boundary constraint (15), zp,i(t) is reflected back from the violated boundary constraint as follows:(22)zp,i(t)={2ximin⁡-zp,i(t),ifzp,i(t)<ximin⁡,2ximax⁡-zp,i(t),ifzp,i(t)>ximax⁡,zp,i(t),otherwise.


## 4.4. Selection

The next step of the algorithm calls for selection to determine whether the target or the trial vector survives to the next generation, that is, att=t+1. Then the objective function values of all trial vectors are evaluated. After that, a selection operation is performed. The DE algorithm uses a greedy selection. The selection operator chooses between the target and corresponding trial vectors. A member of the next generation becomes the fittest vector, that is, vector with the better fitness value. For example, if we have a maximization problem, the selection operation can be expressed as follows:
(23)Xp(t+1)={Zp(t),iff(Zp(t))≥f(Xp(t)),Xp(t),otherwise.Therefore, if the trial vector yields an equal or better value of the objective function, it replaces the corresponding target vector in the next generation; otherwise the target is retained in the population. Hence, the population either gets better (with respect to the maximization of the objective function) or remains the same in fitness status, but never deteriorates.


## 4.5. Binarization

Binary DE is the modified version of DE, which operates in binary search spaces. In the binary DE, the real value of genes is converted to the binary space by the rule [42](24)xp,i(t+1)={1,ifrandp,i<sigm(xp,i(t+1)),0,otherwise,
where, as before, randp,i is a uniformly distributed random number lying between 0 and 1, which is instantiated independently for each ith component of the pth parameter vector. sigm(z) is the sigmoid function:(25)sigm(z)=11+exp⁡(-z).The motivation to use the sigmoid function (25) is to map interval [ximin,ximax] for each i∈{1,2,…,n} into the interval (0,1), which is equivalent to the interval of a probability function. After such transformation from the real-coded representation (15) we obtain the binary-coded representation, xp,i(t)∈{0,1}, where the xp,i(t)=1 indicates that the ith sentence is selected to be included to the summary, otherwise, the ith sentence will not be selected. For example, the individual Xp(t)=[1,0,0,1,1] represents a candidate solution that first, fourth, and fifth sentences are selected to be included to the summary.


## 4.6. Constraint Handling

When population initialization, mutation, crossover, and binarization have been implemented, the new generated solution may not satisfy the constraint (12). The most popular constraint handling strategy at present is penalty method, which often uses function to convert a constrained problem into an unconstraint one [43]. Therefore, this strategy is very convenient to handle the constraints for evolutionary algorithm by punishing the infeasible solution during the selection procedure to ensure the feasible ones are favored. However, this strategy has some drawbacks and the main one is the requirement of multiple runs for the fine-tuning of penalty factors, which would increase the computational time and degrade the efficiency of the algorithm. In order to overcome the drawbacks of penalty method and handle the constraints of problem effectively, the following heuristic procedure is produced for all NP solutions in the population to resolve the constraint (12).Constraint is handled by using a suitable fitness function, which depends on the current population. Solutions in a population are assigned fitness so that feasible solutions are emphasized more than infeasible solutions. The following three criteria are satisfied during the handling process.(i)
Any feasible solution wins over any infeasible solution.(ii)
Two feasible solutions are compared only based on their objective function values.(iii)
Two infeasible solutions are compared based on the amount of constraint violation.


## 4.7. Stopping Criterion

Mutation, crossover and selection continue until some stopping criterion is satisfied. If the predefined maximum iteration number is reached, then the DE algorithm is terminated and outputs the best solution obtained by DE as the result. Otherwise, it is continued to carry out individual’s position updates process (mutation, crossover, and selection process).


## 4.8. Parameter Settings of SaDE Algorithm

The crucial parameters that affect the performance of DE are the population size (NP), crossover rate (CR), and the scaling parameter (F). In the proposed SaDE algorithm the population size, NP=50, is maintained constant throughout the evolution process. This is a heuristic choice. For example, the value of NP can be increased for obtaining the global solution with higher probability. However, the higher the value of NP is, the higher the number of fitness evaluation is. The crossover rate controls which and how many components are mutated in each element of the current population. The crossover rate CR is a probability of mixing between trial and target vectors. A large CR often speeds up convergence. However, from a certain value upwards, the convergence speed may decrease or the population may converge prematurely. In [40], a good choice for CR is said to be between 0.3 and 0.9. Therefore we ran self-adaptive DE for CR=0.9,0.8,0.7,0.6,0.5,0.4, and 0.3. The best results presented for DE are obtained for CR=0.9. Other parameters are set as tmax=1000, ximin=-5, and ximax=5 for all i∈{1,2,…,n}.


## 4.9. Framework of the SaDE Algorithm

The pseudocode of the proposed SaDE algorithm can be summarized as follows.Step 1 (initial population).
Using the rule (15) create an initial population.Step 2 (binarization).
Transform real-coded individuals to binary-coded individuals using (24).Step 3 (select best and worst individuals).
Select the individuals with current best and worst solution.Step 4 (generate trial vector).
Generate trial vector of the target vector using the mutation (17)–(20) and crossover (21) operators.Step 5 (check the boundary constraints).
Check the boundary constraints (15) for the components of the trial vector using (22).Step 6 (binarization).
Transform real-coded trial vector to binary-coded trial vector using (24).Step 7 (constraint handling).
Handle the constraint (12) using the strategy described in Section 4.6.Step 8 (selection).
If a trial vector is better than its target vector is, then replace the target vector by trial vector in the next generation.Step 9 (stopping criterion).
Repeat Steps2–8 until a user-specified maximum number tmax of fitness calculation is reached.Step 10 (output).
Report the summary obtained by the best individual as the final solution at maximum number of fitness calculation.


## 5. Experimental Results

### 5.1. Dataset

We take the DUC 2006 data set as the evaluation corpora [44]. DUC 2006 provides 50 document sets for evaluation. Each document set includes a fixed number—25 documents. For each topic, four human summarizers are asked to provide a 250-word summary of the topic from the 25 related documents for automatic evaluation. All documents are preprocessed by removing stop words [45] and conducting stemming [46].


### 5.2. Evaluation Metrics

A well-recognized automatic evaluation toolkit ROUGE [47] is used in evaluation. It includes five measures, which automatically determine the quality of a machine-generated summary by comparing it to ideal summaries created by humans: ROUGE-N, ROUGE-L, ROUGE-W, ROUGE-S, and ROUGE-SU. These measures evaluate the quality of the summarization by counting the number of overlapping units, such as N-grams, between the generated summary by a method and a set of reference summaries.The ROUGE-N measure compares N-grams of two summaries and counts the number of matches:(26)ROUGE-N=∑S∈Summref∑N-gram∈SCountmatch(N-gram)∑S∈Summref∑N-gram∈SCount(N-gram),
where N stands for the length of the N-gram, Countmatch(N-gram) is the maximum number of N-grams co-occurring in candidate summary and the set of reference-summaries. Count(N-gram) is the number of N-grams in the reference summaries.ROUGE-L computes the ratio between the length of the summaries’ longest common subsequence (LCS) and the length of the reference summary:(27)PLCS(R,S)=LCS(R,S)|S|,RLCS(R,S)=LCS(R,S)|R|,FLCS(R,S)=(1+β2)PLCS(R,S)RLCS(R,S)β2PLCS(R,S)+RLCS(R,S),
where |R| and |S| are the length of the reference R and candidate S sentence summaries, respectively. LCS(R,S) is the length of an LCS of R and S. PLCS(R,S) is the precision of LCS(R,S), RLCS(R,S) is the recall of LCS(R,S), and β=PLCS(R,S)/RLCS(R,S).Lin [47] implemented two extensions to ROUGE-N: skip-bigram cooccurrence (ROUGE-S) and skip-bigram cooccurrence averaged with unigram cooccurrence (ROUGE-SU). The way ROUGE-S is calculated is identical to that of ROUGE-2, except that skip bigrams are defined as subsequences rather than the regular definition of bigrams as substrings. Skip-bigram (skip bigram is any pair of words in their sentence order, allowing for arbitrary gaps) cooccurrence statistics, ROUGE-S, measure the similarity of a pair of summaries based on how many skip bigrams they have in common:(28)PSKIP2(R,S)=SKIP2(R,S)C(|S|,2),RSKIP2(R,S)=SKIP2(R,S)C(|R|,2),FSKIP2(R,S)=(1+β2)PSKIP2(R,S)RSKIP2(R,S)β2PSKIP2(R,S)+RSKIP2(R,S),
where SKIP2(R,S) is the number of skip-bigram matches between R and S, β is the relative importance of PSKIP2(R,S) and RSKIP2(R,S), PSKIP2(R,S) being the precision of SKIP2(R,S) and RSKIP2(R,S) the recall of SKIP2(R,S). C(·,·) is the combination function.One potential problem for ROUGE-S is that it does not give any credit to a candidate sentence if the sentence does not have any word pair co-occurring with its references. To accommodate this, ROUGE-S is extended with the addition of unigram as counting unit. The extended version is called ROUGE-SU that is a weighted average between ROUGE-S and ROUGE-1.


### 5.3. Performance Evaluation

In this section, we empirically compare the systems using ROUGE-1, ROUGE-2, and ROUGE-SU4 metrics. ROUGE-SU4 is an extended version of ROUGE-2 that allows word-level gaps of maximum length 4 between the bigram tokens. These metrics were computed by comparing automatically generated summaries against the model summaries. We implement the following most widely used document summarization methods as the baseline systems to compare with our method: LEX [33], TMR + TF [22], HybHSum [26], PLSA-JS [25], iRANK [24], HierSum [23], and SVR [21]. Table 1 provides the ROUGE scores of the methods. The results reported here are averaged over 20 runs. In Table 1 through pSum-SaDE our method is denoted.Table 1
ROUGE scores of the methods.
MethodsROUGE-1ROUGE-2ROUGE-SU4pSum-SaDE0.44160.09940.1592LEX0.40300.09130.1449TMR + TF0.40630.09130.1504HybHSum0.43000.09100.1510PLSA-JS0.43280.09700.1557iRANK0.40320.09120.1450HierSum0.40100.08600.1430SVR0.40180.09260.1485From the results reported in Table1, we have the following observations: (1) the method pSum-SaDE outperforms all other methods and its results are close to results of the method PLSA-JS; (2) HierSum has the worst performance; (3) the results of LEX and iRANK are similar.Table2 demonstrates the improvements of the method pSum-SaDE in all ROUGE scores. We clearly observe that our method achieves the highest ROUGE scores and outperforms all the other systems. For comparison we have used the relative improvement ((ourmethod-othermethods)/othermethods)×100. We also observe that among other methods the PLSA-JS shows the best results compared to other methods. Compared with the method PLSA-JS the method pSum-SaDE improves the performance by 2.03%, 2.47%, and 2.25% in terms ROUGE-1, ROUGE-2, and ROUGE-SU4 metrics, respectively.Table 2
Comparison pSum-SaDE with other methods.
MethodsImprovement of the method pSum-SaDE, %ROUGE-1ROUGE-2ROUGE-SU4LEX9.588.879.87TMR + TF8.698.875.85HybHSum2.709.235.43PLSA-JS2.032.472.25iRANK9.528.999.79HierSum10.1215.5811.33SVR9.917.347.21Average7.518.777.39We further compared our results with the three best participant systems [22] in DUC 2006. Table 3 shows the comparison results. We see that our proposed method outperforms the three systems. We need note that our method does not make use of any external information, while the systems usually (heavily) depend on some external knowledge, for example, System 15 employs WordNet for discovering semantic similarity between words and System 24 employs linguistic features such as named entity, linguistic patterns, and semantic similarity between words.Table 3
Comparison with the three best systems on DUC 2006.
MethodROUGE-1ROUGE-2ROUGE-SU4pSum-SaDE0.44160.09940.1592System240.41060.09510.1549System150.40200.09030.1468System120.40400.08900.1469


### 5.4. Comparison with Canonical DE Algorithm

This section demonstrates the feasibility of the SaDE-based document summarization. The results are compared to the results obtained from canonical DE. In SaDE and canonical DE the parameter CR does not change during search process which is equal toCR=0.6. In canonical DE algorithm, the mutation strategy is defined by (16), whose parameter F does not change during search process. In our experiment, the scaling factor F is set to 0.5. To perform a fair comparison, the same computational effort is used in both of canonical DE and SaDE. That is, the maximum generation, population size, and searching range of the parameters in DE are the same as those in adaptive DE. In addition, notice that random number generator is initialized with the same seed values. The maximum generation, the population size, and the maximum number of iterations are set to 20, 50, and 1000, respectively.Table4 shows the worst, mean, best, and standard deviation of ROUGE results during 20 runs for each algorithm DE and SaDE. From Table 4, it is obvious that the worst results obtained by adaptive DE are even better than the best results obtained by DE.Table 4
Comparison pSum-SaDE with pSum-DE.
AlgorithmWorstMeanBestStdvROUGE-1SaDE0.43990.44160.44281.13e− 04DE0.43660.43780.43881.45e − 04ROUGE-2SaDE0.09870.09940.10111.11e − 04DE0.09550.09670.09751.47e − 04ROUGE-SU4SaDE0.15840.15920.16051.01e − 04DE0.15370.15640.15751.36e − 04


### 5.5. Comparison of Runtime of the Methods

In this section, CPU runtimes of the seven tested methods are compared. All the methods were implemented in the Delphi 7 language. The algorithms were run on a Server running Windows Vista with two dual-core Intel Xeon CPU (4 GHz) processors and 4 GB memory. Table5 shows the comparison in terms of time spent by each method. Last column shows the ranks of the method on their time spent. From the experimental results, we clearly observe that (1) LEX method performs slowly; (2) the methods iRANK, HierSum, and HybHSum, and the methods PLSA-JS and SVR spend almost equal time; (3) our methods pSum-DE and pSum-SaDE take the first and second places, respectively.Table 5
Comparison of the methods on time spent.
MethodsTime (min)RankpSum-DE42.71pSum-SaDE44.22TMR + TF51.33PLSA-JS54.44SVR56.65iRANK62.76HierSum63.17HybHSum64.98LEX67.69


### 5.6. Statistical Significance Test

To judge the statistical significance of the summarization results, a nonparametric statistical significance test called Wilcoxon’s rank sum test for independent samples [48] has been conducted at the 5% significance level. Nine groups, corresponding to the nine methods ((1) pSum-SaDE, (2) pSum-DE, (3) LEX, (4) TMR + TF, (5) HybHSum, (6) PLSA-JS, (7) iRANK, (8) HierSum, (9) SVR), have been created for each data set. Two groups are compared at a time one corresponding to pSum-SaDE method and the other corresponding to some other method considered in this paper. Each group consists of the ROUGE scores for the data sets produced by 20 consecutive runs of the corresponding method. The median values, 95% CI, and standard error (stdr.) of ROUGE scores of each group for all the data sets are shown in Table 6.Table 6
Median values, 95% CI, and standard error of ROUGE scores over 20 consecutive runs of methods.
MethodsROUGE-1ROUGE-2ROUGE-SU4Median95% CIStdr.Median95% CIStdr.Median95% CIStdr.pSum-SaDE0.4422[0.4417, 0.4426]2.2e – 40.0992[0.0990, 0.0994]7.8e − 50.1596[0.1591, 0.1598]1.7e − 4pSum-DE0.4387[0.4383, 0.4394]2.5e – 40.0974[0.0971, 0.0976]1.1e − 40.1570[0.1564, 0.1575]2.6e − 4LEX0.4040[0.4022, 0.4057]8.3e – 40.0915[0.0910, 0.0919]2.3e − 40.1457[0.1448, 0.1465]4.1e − 4TMR + TF0.4059[0.4048, 0.4067]4.4e – 40.0921[0.0911, 0.0922]2.7e − 40.1515[0.1508, 0.1520]3.0e − 4HybHSum0.4306[0.4299, 0.4310]2.6e – 40.0916[0.0908, 0.0916]2.1e − 40.1514[0.1508, 0.1518]2.6e − 4PLSA-JS0.4330[0.4327, 0.4341]3.2e – 40.0975[0.0970, 0.0981]2.6e − 40.1557[0.1549, 0.1565]4.0e − 4iRANK0.4019[0.4014, 0.4046]7.8e – 40.0915[0.0912, 0.0920]2.0e − 40.1447[0.1446, 0.1458]2.9e − 4HierSum0.4016[0.4006, 0.4023]4.2e – 40.0889[0.0877, 0.0894]4.1e − 40.1441[0.1427, 0.1442]3.5e − 4SVR0.4024[0.4008, 0.4030]5.1e – 40.0922[0.0915, 0.0941]6.1e − 40.1491[0.1483, 0.1497]3.4e − 4As is evident from Table6, the median values of ROUGE-1, ROUGE-2, and ROUGE-SU4 scores for pSum-SaDE are better than those for the other methods. To establish that this goodness is statistically significant, Table 7 reports the P values produced by Wilcoxon’s rank sum test for comparison of two groups (one group corresponding to pSum-SaDE and another group corresponding to some other algorithm) at a time [49]. As a null hypothesis, it is assumed that there are no significant differences between the median values of two groups, whereas the alternative hypothesis is that there is significant difference in the median values of the two groups. It is clear from the table that P values are much less than 0.05 (5% significance level). This is strong evidence against the null hypothesis, indicating that the better median values of the performance metrics produced by pSum-SaDE are statistically significant and have not occurred by chance. Similar results are obtained for all other data sets and for all other methods compared to pSum-SaDE method, establishing the significant superiority of the proposed technique.Table 7
P values produced by Wilcoxon’s rank sum test by comparing pSum-SaDE with other methods.
MetricP values (comparing medians of pSum-SaDE with other methods)pSum-DELEXTMR + TFHybHSumPLSA-JSiRANKHierSumSVRROUGE-1<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001ROUGE-2<0.0001<0.0001<0.0001<0.00010.0002<0.0001<0.0001<0.0001ROUGE-SU4<0.0001<0.0001<0.0001<0.00010.0001<0.0001<0.0001<0.0001The superiority of pSum-SaDE method is also evident from Figure2 that provides the range of solutions obtained by the different methods [49].Change of ROUGE-1, ROUGE-2, and ROUGE-SU4 for different summarization methods.
(a)(b)(c)


## 5.1. Dataset

We take the DUC 2006 data set as the evaluation corpora [44]. DUC 2006 provides 50 document sets for evaluation. Each document set includes a fixed number—25 documents. For each topic, four human summarizers are asked to provide a 250-word summary of the topic from the 25 related documents for automatic evaluation. All documents are preprocessed by removing stop words [45] and conducting stemming [46].


## 5.2. Evaluation Metrics

A well-recognized automatic evaluation toolkit ROUGE [47] is used in evaluation. It includes five measures, which automatically determine the quality of a machine-generated summary by comparing it to ideal summaries created by humans: ROUGE-N, ROUGE-L, ROUGE-W, ROUGE-S, and ROUGE-SU. These measures evaluate the quality of the summarization by counting the number of overlapping units, such as N-grams, between the generated summary by a method and a set of reference summaries.The ROUGE-N measure compares N-grams of two summaries and counts the number of matches:(26)ROUGE-N=∑S∈Summref∑N-gram∈SCountmatch(N-gram)∑S∈Summref∑N-gram∈SCount(N-gram),
where N stands for the length of the N-gram, Countmatch(N-gram) is the maximum number of N-grams co-occurring in candidate summary and the set of reference-summaries. Count(N-gram) is the number of N-grams in the reference summaries.ROUGE-L computes the ratio between the length of the summaries’ longest common subsequence (LCS) and the length of the reference summary:(27)PLCS(R,S)=LCS(R,S)|S|,RLCS(R,S)=LCS(R,S)|R|,FLCS(R,S)=(1+β2)PLCS(R,S)RLCS(R,S)β2PLCS(R,S)+RLCS(R,S),
where |R| and |S| are the length of the reference R and candidate S sentence summaries, respectively. LCS(R,S) is the length of an LCS of R and S. PLCS(R,S) is the precision of LCS(R,S), RLCS(R,S) is the recall of LCS(R,S), and β=PLCS(R,S)/RLCS(R,S).Lin [47] implemented two extensions to ROUGE-N: skip-bigram cooccurrence (ROUGE-S) and skip-bigram cooccurrence averaged with unigram cooccurrence (ROUGE-SU). The way ROUGE-S is calculated is identical to that of ROUGE-2, except that skip bigrams are defined as subsequences rather than the regular definition of bigrams as substrings. Skip-bigram (skip bigram is any pair of words in their sentence order, allowing for arbitrary gaps) cooccurrence statistics, ROUGE-S, measure the similarity of a pair of summaries based on how many skip bigrams they have in common:(28)PSKIP2(R,S)=SKIP2(R,S)C(|S|,2),RSKIP2(R,S)=SKIP2(R,S)C(|R|,2),FSKIP2(R,S)=(1+β2)PSKIP2(R,S)RSKIP2(R,S)β2PSKIP2(R,S)+RSKIP2(R,S),
where SKIP2(R,S) is the number of skip-bigram matches between R and S, β is the relative importance of PSKIP2(R,S) and RSKIP2(R,S), PSKIP2(R,S) being the precision of SKIP2(R,S) and RSKIP2(R,S) the recall of SKIP2(R,S). C(·,·) is the combination function.One potential problem for ROUGE-S is that it does not give any credit to a candidate sentence if the sentence does not have any word pair co-occurring with its references. To accommodate this, ROUGE-S is extended with the addition of unigram as counting unit. The extended version is called ROUGE-SU that is a weighted average between ROUGE-S and ROUGE-1.


## 5.3. Performance Evaluation

In this section, we empirically compare the systems using ROUGE-1, ROUGE-2, and ROUGE-SU4 metrics. ROUGE-SU4 is an extended version of ROUGE-2 that allows word-level gaps of maximum length 4 between the bigram tokens. These metrics were computed by comparing automatically generated summaries against the model summaries. We implement the following most widely used document summarization methods as the baseline systems to compare with our method: LEX [33], TMR + TF [22], HybHSum [26], PLSA-JS [25], iRANK [24], HierSum [23], and SVR [21]. Table 1 provides the ROUGE scores of the methods. The results reported here are averaged over 20 runs. In Table 1 through pSum-SaDE our method is denoted.Table 1
ROUGE scores of the methods.
MethodsROUGE-1ROUGE-2ROUGE-SU4pSum-SaDE0.44160.09940.1592LEX0.40300.09130.1449TMR + TF0.40630.09130.1504HybHSum0.43000.09100.1510PLSA-JS0.43280.09700.1557iRANK0.40320.09120.1450HierSum0.40100.08600.1430SVR0.40180.09260.1485From the results reported in Table1, we have the following observations: (1) the method pSum-SaDE outperforms all other methods and its results are close to results of the method PLSA-JS; (2) HierSum has the worst performance; (3) the results of LEX and iRANK are similar.Table2 demonstrates the improvements of the method pSum-SaDE in all ROUGE scores. We clearly observe that our method achieves the highest ROUGE scores and outperforms all the other systems. For comparison we have used the relative improvement ((ourmethod-othermethods)/othermethods)×100. We also observe that among other methods the PLSA-JS shows the best results compared to other methods. Compared with the method PLSA-JS the method pSum-SaDE improves the performance by 2.03%, 2.47%, and 2.25% in terms ROUGE-1, ROUGE-2, and ROUGE-SU4 metrics, respectively.Table 2
Comparison pSum-SaDE with other methods.
MethodsImprovement of the method pSum-SaDE, %ROUGE-1ROUGE-2ROUGE-SU4LEX9.588.879.87TMR + TF8.698.875.85HybHSum2.709.235.43PLSA-JS2.032.472.25iRANK9.528.999.79HierSum10.1215.5811.33SVR9.917.347.21Average7.518.777.39We further compared our results with the three best participant systems [22] in DUC 2006. Table 3 shows the comparison results. We see that our proposed method outperforms the three systems. We need note that our method does not make use of any external information, while the systems usually (heavily) depend on some external knowledge, for example, System 15 employs WordNet for discovering semantic similarity between words and System 24 employs linguistic features such as named entity, linguistic patterns, and semantic similarity between words.Table 3
Comparison with the three best systems on DUC 2006.
MethodROUGE-1ROUGE-2ROUGE-SU4pSum-SaDE0.44160.09940.1592System240.41060.09510.1549System150.40200.09030.1468System120.40400.08900.1469


## 5.4. Comparison with Canonical DE Algorithm

This section demonstrates the feasibility of the SaDE-based document summarization. The results are compared to the results obtained from canonical DE. In SaDE and canonical DE the parameter CR does not change during search process which is equal toCR=0.6. In canonical DE algorithm, the mutation strategy is defined by (16), whose parameter F does not change during search process. In our experiment, the scaling factor F is set to 0.5. To perform a fair comparison, the same computational effort is used in both of canonical DE and SaDE. That is, the maximum generation, population size, and searching range of the parameters in DE are the same as those in adaptive DE. In addition, notice that random number generator is initialized with the same seed values. The maximum generation, the population size, and the maximum number of iterations are set to 20, 50, and 1000, respectively.Table4 shows the worst, mean, best, and standard deviation of ROUGE results during 20 runs for each algorithm DE and SaDE. From Table 4, it is obvious that the worst results obtained by adaptive DE are even better than the best results obtained by DE.Table 4
Comparison pSum-SaDE with pSum-DE.
AlgorithmWorstMeanBestStdvROUGE-1SaDE0.43990.44160.44281.13e− 04DE0.43660.43780.43881.45e − 04ROUGE-2SaDE0.09870.09940.10111.11e − 04DE0.09550.09670.09751.47e − 04ROUGE-SU4SaDE0.15840.15920.16051.01e − 04DE0.15370.15640.15751.36e − 04


## 5.5. Comparison of Runtime of the Methods

In this section, CPU runtimes of the seven tested methods are compared. All the methods were implemented in the Delphi 7 language. The algorithms were run on a Server running Windows Vista with two dual-core Intel Xeon CPU (4 GHz) processors and 4 GB memory. Table5 shows the comparison in terms of time spent by each method. Last column shows the ranks of the method on their time spent. From the experimental results, we clearly observe that (1) LEX method performs slowly; (2) the methods iRANK, HierSum, and HybHSum, and the methods PLSA-JS and SVR spend almost equal time; (3) our methods pSum-DE and pSum-SaDE take the first and second places, respectively.Table 5
Comparison of the methods on time spent.
MethodsTime (min)RankpSum-DE42.71pSum-SaDE44.22TMR + TF51.33PLSA-JS54.44SVR56.65iRANK62.76HierSum63.17HybHSum64.98LEX67.69


## 5.6. Statistical Significance Test

To judge the statistical significance of the summarization results, a nonparametric statistical significance test called Wilcoxon’s rank sum test for independent samples [48] has been conducted at the 5% significance level. Nine groups, corresponding to the nine methods ((1) pSum-SaDE, (2) pSum-DE, (3) LEX, (4) TMR + TF, (5) HybHSum, (6) PLSA-JS, (7) iRANK, (8) HierSum, (9) SVR), have been created for each data set. Two groups are compared at a time one corresponding to pSum-SaDE method and the other corresponding to some other method considered in this paper. Each group consists of the ROUGE scores for the data sets produced by 20 consecutive runs of the corresponding method. The median values, 95% CI, and standard error (stdr.) of ROUGE scores of each group for all the data sets are shown in Table 6.Table 6
Median values, 95% CI, and standard error of ROUGE scores over 20 consecutive runs of methods.
MethodsROUGE-1ROUGE-2ROUGE-SU4Median95% CIStdr.Median95% CIStdr.Median95% CIStdr.pSum-SaDE0.4422[0.4417, 0.4426]2.2e – 40.0992[0.0990, 0.0994]7.8e − 50.1596[0.1591, 0.1598]1.7e − 4pSum-DE0.4387[0.4383, 0.4394]2.5e – 40.0974[0.0971, 0.0976]1.1e − 40.1570[0.1564, 0.1575]2.6e − 4LEX0.4040[0.4022, 0.4057]8.3e – 40.0915[0.0910, 0.0919]2.3e − 40.1457[0.1448, 0.1465]4.1e − 4TMR + TF0.4059[0.4048, 0.4067]4.4e – 40.0921[0.0911, 0.0922]2.7e − 40.1515[0.1508, 0.1520]3.0e − 4HybHSum0.4306[0.4299, 0.4310]2.6e – 40.0916[0.0908, 0.0916]2.1e − 40.1514[0.1508, 0.1518]2.6e − 4PLSA-JS0.4330[0.4327, 0.4341]3.2e – 40.0975[0.0970, 0.0981]2.6e − 40.1557[0.1549, 0.1565]4.0e − 4iRANK0.4019[0.4014, 0.4046]7.8e – 40.0915[0.0912, 0.0920]2.0e − 40.1447[0.1446, 0.1458]2.9e − 4HierSum0.4016[0.4006, 0.4023]4.2e – 40.0889[0.0877, 0.0894]4.1e − 40.1441[0.1427, 0.1442]3.5e − 4SVR0.4024[0.4008, 0.4030]5.1e – 40.0922[0.0915, 0.0941]6.1e − 40.1491[0.1483, 0.1497]3.4e − 4As is evident from Table6, the median values of ROUGE-1, ROUGE-2, and ROUGE-SU4 scores for pSum-SaDE are better than those for the other methods. To establish that this goodness is statistically significant, Table 7 reports the P values produced by Wilcoxon’s rank sum test for comparison of two groups (one group corresponding to pSum-SaDE and another group corresponding to some other algorithm) at a time [49]. As a null hypothesis, it is assumed that there are no significant differences between the median values of two groups, whereas the alternative hypothesis is that there is significant difference in the median values of the two groups. It is clear from the table that P values are much less than 0.05 (5% significance level). This is strong evidence against the null hypothesis, indicating that the better median values of the performance metrics produced by pSum-SaDE are statistically significant and have not occurred by chance. Similar results are obtained for all other data sets and for all other methods compared to pSum-SaDE method, establishing the significant superiority of the proposed technique.Table 7
P values produced by Wilcoxon’s rank sum test by comparing pSum-SaDE with other methods.
MetricP values (comparing medians of pSum-SaDE with other methods)pSum-DELEXTMR + TFHybHSumPLSA-JSiRANKHierSumSVRROUGE-1<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001<0.0001ROUGE-2<0.0001<0.0001<0.0001<0.00010.0002<0.0001<0.0001<0.0001ROUGE-SU4<0.0001<0.0001<0.0001<0.00010.0001<0.0001<0.0001<0.0001The superiority of pSum-SaDE method is also evident from Figure2 that provides the range of solutions obtained by the different methods [49].Change of ROUGE-1, ROUGE-2, and ROUGE-SU4 for different summarization methods.
(a)(b)(c)


## 6. Conclusion and Future Work

The main contributions of the paper are the following.(i)
The paper presents a document summarization model which extracts salient sentences from given documents while reducing redundant information in the summaries with the coverage of latent topics of document collection.(ii)
Document summarization is formalized as a modifiedp-median problem that takes into account four basic requirements, namely, relevance, information coverage, diversity, and length limit that should satisfy summaries.(iii)
To solve the modifiedp-median problem a self-adaptive differential evolution algorithm is created. In particular, in the paper is proposed a self-adaptive scaling factor in original DE to increase the exploration and exploitation ability.(iv)
This paper has found that self-adaptive differential evolution can efficiently find the best solution in comparison with the canonical differential evolution. Experimental results on DUC 2006 dataset have shown that our optimization approach compares well to several summarization methods.There are several possible directions of future research. One of them involves replacement of the SaDE algorithm in pSum-SaDE with a better global search method, such as particle swarm optimization. Another direction of future research is related to the different combination of the three terms, namely, relevancy, coverage, and redundancy terms in objective function (9′).



---

*Source: 351498-2011-11-30.xml*