Swarm Based Text Summarization

The scoring mechanism of the text features is the unique way for determining the key ideas in the text to be presented as text summary. The treating of all text features with same level of importance can be considered the main factor causing creating a summary with low quality. In this paper, we introduced a novel text summarization model based on swarm intelligence. The main purpose of the proposed model is for scoring the sentences, emphasizing on dealing with the text features fairly based on their importance. The weights obtained from the training of the model were used to adjust the text features scores, which could play an important role in the selection process of the most important sentences to be included in the final summary. The results show that the human summaries H1 and H2 are 49% similar to each other. The proposed model creates summaries which are 43% similar to the manually generated summaries, while the summaries produced by Ms Word summarizer are 39% similar.

[1]  Hans Peter Luhn,et al.  The Automatic Creation of Literature Abstracts , 1958, IBM J. Res. Dev..

[2]  Chin-Yew Lin.  Training a selection function for extraction , 1999, CIKM '99.

[3]  Lucy Vanderwende,et al.  Enhancing Single-Document Summarization by Combining RankNet and Third-Party Sources , 2007, EMNLP.

[4]  Dianne P. O'Leary,et al.  Text summarization via hidden Markov models , 2001, SIGIR '01.

[5]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[6]  Andries Petrus Engelbrecht,et al.  Data clustering using particle swarm optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[7]  Sun Jian-qing,et al.  A Novel SVM Decision Tree and its application to Face Detection , 2007 .

[8]  Eduard H. Hovy,et al.  Identifying Topics by Position , 1997, ANLP.

[9]  Michal Skubacz,et al.  Content Extraction from News Pages Using Particle Swarm Optimization on Linguistic and Structural Features , 2007 .

[10]  Miles Osborne,et al.  Using maximum entropy for sentence extraction , 2002, ACL 2002.

[11]  Kuan-Yu He,et al.  Improving Identification of Latent User Goals through Search-Result Snippet Classification , 2007 .

[12]  Francine Chen,et al.  A trainable document summarizer , 1995, SIGIR '95.

[13]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[14]  Chin-Yew Lin,et al.  ROUGE: A Package for Automatic Evaluation of Summaries , 2004, ACL 2004.

[15]  Ziqiang Wang,et al.  A PSO-Based Web Document Classification Algorithm , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[16]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[17]  Thomas E. Potok,et al.  Document clustering using particle swarm optimization , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[18]  Naomie Salim,et al.  Swarm based features selection for text summarization , 2009 .

[19]  Fuji Ren,et al.  GA, MR, FFNN, PNN and GMM based models for automatic text summarization , 2009, Comput. Speech Lang..