LDA-AdaBoost.MH: Accelerated AdaBoost.MH based on latent Dirichlet allocation for text categorization
- 3 October 2014
- journal article
- research article
- Published by SAGE Publications in Journal of Information Science
- Vol. 41 (1) , 27-40
Abstract
AdaBoost.MH is a boosting algorithm that is considered to be one of the most accurate algorithms for multilabel classification. It works by iteratively building a committee of weak hypotheses of decision stumps. To build the weak hypotheses, in each iteration, AdaBoost.MH obtains the whole extracted features and examines them one by one to check their ability to characterize the appropriate category. Using Bag-Of-Words for text representation dramatically increases the computational time of AdaBoost.MH learning, especially for large-scale datasets. In this paper we demonstrate how to improve the efficiency and effectiveness of AdaBoost.MH using latent topics, rather than words. A well-known probabilistic topic modelling method, Latent Dirichlet Allocation, is used to estimate the latent topics in the corpus as features for AdaBoost.MH. To evaluate LDA-AdaBoost.MH, the following four datasets have been used: Reuters-21578-ModApte, WebKB, 20-Newsgroups and a collection of Arabic news. The experimental results confirmed that representing the texts as a small number of latent topics, rather than a large number of words, significantly decreased the computational time of AdaBoost.MH learning and improved its performance for text categorization.Keywords
This publication has 18 references indexed in Scilit:
- Boosting Algorithms: A Review of Methods, Theory, and Applications2012
- Statistical Bayesian Learning for Automatic Arabic Text CategorizationJournal of Computer Science, 2011
- Latent Dirichlet Allocation for Automatic Document CategorizationLecture Notes in Computer Science, 2009
- Boosting and Additive Trees2008
- Boosting for Text Classification with Semantic FeaturesLecture Notes in Computer Science, 2006
- MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization2006
- Finding scientific topicsProceedings of the National Academy of Sciences of the United States of America, 2004
- Complex Linguistic Features for Text Classification: A Comprehensive Study2004
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- A desicion-theoretic generalization of on-line learning and an application to boosting1995