A trainable document summarizer
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
New Methods in Automatic Extracting
Journal of the ACM (JACM)
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
Proceedings of the 13th international conference on World Wide Web
Text summarization using a trainable summarizer and latent semantic analysis
Information Processing and Management: an International Journal - Special issue: An Asian digital libraries perspective
Multi-candidate reduction: Sentence compression as a tool for document summarization tasks
Information Processing and Management: an International Journal
A complex network approach to text summarization
Information Sciences: an International Journal
Automatic text summarization based on latent semantic indexing
Artificial Life and Robotics
A Survey on Automatic Summarization
IFITA '10 Proceedings of the 2010 International Forum on Information Technology and Applications - Volume 01
Hi-index | 0.00 |
As the rapid development of the internet, we can collect more and more information. it also means we need the abitily to search the information which really useful to us from the amount of information quickly. Automatic summarization is useful to us for handling the huge amount of text information in the Web. This paper proposes a Chinese summarization method based on Affinity Propagation(AP)clustering and latent semantic analysis(LSA). AP is a new clustering algorithm raised by B. J. Frey on science in 2007 that takes as input measures of similarity between pairs of data points and simultaneously considers all data points as potential exemplars. LSA is a technique in natural language processing, in particular in vectorial semantics, of analyzing relationships between a set of sentences. Experiment results show that our method could get more comprehensive and high-quality summarization.