2014
DOI: 10.1016/j.swevo.2013.12.004
|View full text |Cite
|
Sign up to set email alerts
|

Extracting easy to understand summary using differential evolution algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 34 publications
0
7
0
Order By: Relevance
“…No GA length, coverage, informativeness and redundancy Huang et al [28] Yes No -Coverage, significance, redundancy and coherence Aliguliyev [29] No No PSO Clustering Nandhini and Balasundaram [30] No No DE Informative and cohesion Lozano et al [31] No No CHC Greedy Coverage and redundancy reduction Alguliyev et al [13] No No DE Relevance, redundancy and length Mirshojaei and Masoomi [32] No No CSOA -Rautray et al [33] No No DE, PSO Redundant reducing and maximising relevancy Goleman et al [34] No sentences. Here, N is the number of documents and n is the number of sentences, while s i is the ith sentence in S. Set T = {t 1, t 2,,,, t m } represents all terms in S, S i = [wi 1 , wi 2 ,..., wi m ].…”
Section: Work Optimisation Informationmentioning
confidence: 99%
See 2 more Smart Citations
“…No GA length, coverage, informativeness and redundancy Huang et al [28] Yes No -Coverage, significance, redundancy and coherence Aliguliyev [29] No No PSO Clustering Nandhini and Balasundaram [30] No No DE Informative and cohesion Lozano et al [31] No No CHC Greedy Coverage and redundancy reduction Alguliyev et al [13] No No DE Relevance, redundancy and length Mirshojaei and Masoomi [32] No No CSOA -Rautray et al [33] No No DE, PSO Redundant reducing and maximising relevancy Goleman et al [34] No sentences. Here, N is the number of documents and n is the number of sentences, while s i is the ith sentence in S. Set T = {t 1, t 2,,,, t m } represents all terms in S, S i = [wi 1 , wi 2 ,..., wi m ].…”
Section: Work Optimisation Informationmentioning
confidence: 99%
“…Aliguliyev [29] used the PSO algorithm for text clustering to produce a rich summary and proposed a generic, multi-document summarisation method by optimising the similarities of the clusters. Nandhini and Balasundaram [30] used the DE algorithm to create an easy-to-understand textual summary. Lozano et al [31] proposed an algorithm to provide an extractive summation from multiple documents that optimise the coverage and redundancy variables through binary optimisation.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, differential evolution algorithm is used to look for the optimization combination of the parameters K and α of variational mode decomposition. Differential evolution algorithm includes three operations: mutation operation, crossover operation, and selection operation [11,12]. In mutation operation, the mutation vector is generated by the mutation operator.…”
Section: Adaptive Variational Mode Decomposition Technique With Differential Evolution Algorithmmentioning
confidence: 99%
“…Only a handful of text summarization methods so far have integrated readability assessment to select not only the most informative, but also the most comprehensible sentences. Nandhini and Balasundaram (2014) designed one of such approaches. They represent each document as a set of 4 informative features (sentence position, title similarity, etc.)…”
Section: Related Workmentioning
confidence: 99%