A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
The use of MMR, diversity-based reranking for reordering documents and producing summaries
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Modern Information Retrieval
Advances in Automatic Text Summarization
Advances in Automatic Text Summarization
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Boosting Methods for Regression
Machine Learning
Statistics-Based Summarization - Step One: Sentence Compression
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Information-Content Based Sentence Extraction for Text Summarization
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
The automated acquisition of topic signatures for text summarization
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Centroid-based summarization of multiple documents
Information Processing and Management: an International Journal
Topic themes for multi-document summarization
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
AdaRank: a boosting algorithm for information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
LexRank: graph-based lexical centrality as salience in text summarization
Journal of Artificial Intelligence Research
GSPSummary: a graph-based sub-topic partition algorithm for summarization
AIRS'08 Proceedings of the 4th Asia information retrieval conference on Information retrieval technology
Topic analysis for topic-focused multi-document summarization
Proceedings of the 18th ACM conference on Information and knowledge management
Graph-based multi-modality learning for topic-focused multi-document summarization
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A new approach for multi-document update summarization
Journal of Computer Science and Technology
Improving query focused summarization using look-ahead strategy
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
MCMR: Maximum coverage and minimum redundant text summarization model
Expert Systems with Applications: An International Journal
CDDS: Constraint-driven document summarization models
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
Topic representation mismatch is a key problem in topic-oriented summarization for the specified topic is usually too short to understand/interpret. This paper proposes a novel adaptive model for summarization, AdaSum, under the assumption that the summary and the topic representation can be mutually boosted. AdaSum aims to simultaneously optimize the topic representation and extract effective summaries. This model employs a mutual boosting process to minimize the topic representation mismatch for base summarizers. Furthermore, a linear combination of base summarizers is proposed to further reduce the topic representation mismatch from the diversity of base summarizers with a general learning framework. We prove that the training process of AdaSum can enhance the performance measure used. Experimental results on DUC 2007 dataset show that AdaSum significantly outperforms the baseline methods for summarization (e.g. MRP, LexRank, and GSPS).