A Bayesian feature selection paradigm for text classification

Information Processing and Management

Volumn 48, Issue 2, 2012, Pages 283-302

  Feng, Guozhong ^a   Guo, Jianhua ^a   Jing, Bing Yi ^b   Hao, Lizhu ^a  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Bayesian feature selection; Metropolis search; Mixture model; Text classification

Indexed keywords

COMPUTATIONAL EFFICIENCY; FEATURE EXTRACTION; INFORMATION RETRIEVAL SYSTEMS; PROBABILITY DISTRIBUTIONS; TEXT PROCESSING;

AUTOMATED CLASSIFICATION; BAYESIAN FEATURE SELECTIONS; FEATURE SELECTION PROBLEM; METROPOLIS SEARCHES; MIXTURE MODEL; PROBABILISTIC MODELING; TEXT CLASSIFICATION; TRAINING PROCESS;

CLASSIFICATION (OF INFORMATION);

EID: 84857369324     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2011.08.002     Document Type: Article

References (20)

1. Becker, S., Thrun, S., & Obermayer, K. (2003). Advances in neural information processing systems 15. In Proceedings of the 2002 conference. MIT Press.
2. J.G. Booth, G. Casella, and J.P. Hobert Clustering using objective functions and stochastic search Journal of the Royal Statistical Society, Series B 70 2008 119 139
3. P.J. Brown, M. Vannucci, and T. Fearn Multivariate Bayesian variable selection and prediction Journal of the Royal Statistical Society, Series B. 60 1998 627 641 (Pubitemid 128656803)
4. W-C. Chang On using principal components before separating a mixture of two multivariate normal distributions Applied Statistics 32 1983 267 275
5. D.R. Cox Analysis of binary data 1970 Methuen London
6. A. Gelman, J.B. Carlin, H.S. Stern, and D.B. Rubin Bayesian data analysis 2nd ed. 2004 Chapman & Hall/CRC Florida
7. Hao, L. Z. (2008). Chinese text automatic classification. Ph.D. Thesis, JiLin University China.
8. S. Kim, M.G. Tadesse, and M. Vannucci Variable selection in clustering via Dirichlet process mixture models Biometrika 93 2006 877 893 (Pubitemid 44973874)
9. Koller, D., & Sahami, M. (1996). Toward optimal feature selection, In Proceedings of ICML96, 13th international conference on machine learning, Bari, IT (pp. 284-292).
10. J. Lafferty, and C. Zhai Probabilistic relevance models based on document and query generation W.B. Croft, J. Lafferty, Language modeling and information retrieval 2003 Kluwer Academic Publishers
11. Lewis, D. D. (1998). Naive (Bayes) at forty: The independence assumption in information retrieval. In Proceedings of the 10th European conference on machine learning (ECML98) (pp. 4-15).
12. D.D. Lewis, Y. Yang, T.G. Rose, and F. Li RCV1: A new benchmark collection for text categorization research Journal of Machine Learning Research 5 2004 361 397
13. C.H. Li, and S.C. Park Combination of modified BPNN algorithms and an efficient feature selection method for text categorization Information Processing and Management 45 2009 329 340
14. J.S. Liu, A.F. Neuwald, and C.E. Lawrence Bayesian model for multiple local sequence alignment and gibbs sampling strategies Journal of the American Statistical Association 432 1995 1156 1170 (Pubitemid 126093131)
15. D. Madigan, and J. York Bayesian graphical models for discrete data International Statistical Review 63 1995 215 232
16. S. Richardson, and P.J. Green On Bayesian analysis of mixtures with an unknown number of components (with discussion) Journal of the Royal Statistical Society, Series B 59 1997 731 792 (Pubitemid 127686979)
17. Rogati, M., & Yang, Y. (2002). High-performing feature selection for text classification, CIKM'02, ACM.
18. F. Sebastiani Machine learning in automated text categorization ACM Computing Surveys 34 2002 1 47
19. N. Sha, M. Vannucci, M.G. Tadesse, P.J. Brown, I. Dragoni, and N. Davies Bayesian variable selection in multinomial probit models to identify molecular signatures of disease stage Biometrics 60 2004 812 819 (Pubitemid 39181128)
20. M.G. Tadesse, N. Sha, and M. Vannucci Bayesian variable selection in clustering high-dimensional data Journal of the American Statistical Association 100 2005 602 617 (Pubitemid 40816597)