A trainable document summarizer
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
New Methods in Automatic Extracting
Journal of the ACM (JACM)
Automatic abstracting and indexing—survey and recommendations
Communications of the ACM
A new approach to unsupervised text summarization
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Recent developments in text summarization
Proceedings of the tenth international conference on Information and knowledge management
Extracting multi-document summarization based on local topics
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Semantic network closure structures in dual translation of stochastic languages
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Summary extraction from chinese text for data archives of online news
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Hi-index | 0.00 |
With the rapid growth of the Internet, most of the textual data in the form of newspapers, magazines and journals tend to be available on-line. Summarizing these texts can aid the users access the information content at a faster pace. However, doing this task manually is expensive and time-consuming. Automatic text summarization is a solution for dealing with this problem. For a given text, a text summarization algorithm selects a few salient sentences based on certain features. In the literature, weight-based, foci-based, and machine learning approaches have been proposed. In this paper, we propose a popularity-based approach for text summarization. A popularity of the sentence is determined based on the number of other sentences similar to it. Using the notion of popularity, it is possible to extract potential sentences for summarization that could not be extracted by the existing approaches. The experimental results show that by applying both popularity and weight-based criteria it is possible to extract effective summaries.