Selecting features of linear-chain conditional random fields via greedy stage-wise algorithms

Pattern Recognition Letters

Volumn 31, Issue 2, 2010, Pages 151-162

  Hou, Cuiqin ^a   Jiao, Licheng ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Feature selection; Greedy stage wise; Linear chain conditional random fields; Pseudo likelihood

Indexed keywords

CONDITIONAL RANDOM FIELD; EVALUATION CRITERIA; FEATURE SELECTION; FEATURE SELECTION ALGORITHM; GREEDY STAGE-WISE; LOG LIKELIHOOD; PSEUDO-LIKELIHOOD; REAL-WORLD PROBLEM; SMALL FEATURES; TESTING TIME; TIME EFFICIENCIES;

CONTENT BASED RETRIEVAL;

FEATURE EXTRACTION;

EID: 71549124016     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.09.025     Document Type: Article

References (30)

1. Berger A.L., Pietra S.A.D., et al. A maximum entropy approach to natural language processing. Comput. Linguist. 22 1 (1996) 39-71
2. Blum A.L. Selection of relevant features and examples in machine learning. Artif. Intell. 97 (1997) 245-271
3. Breiman L., Friedman J.H., Olshen R.A., and Stone C.J. Classification and Regression Trees (1984), Wadsworth and Brooks
4. Culotta, A., Kulp, D., et al., 2005. Gene Prediction with Conditional Random Fields. Technical Report, University of Massachusetts.
5. Das, S., 2001. Filters, wrappers and a boosting-based hybrid for feature selection. In: Proc. 18th Internat. Conf. on Machine Learning, pp. 74-81.
6. Dietterich, T.G., 2002. Machine learning for sequential data: A review. In: Proc. Joint IAPR Internat. Workshop on Structural, Syntactic, and Statistical Pattern Recognition, pp. 15-30.
7. Dietterich, T.G., Ashenfelter, A., et al., 2004. Training conditional random fields via gradient tree boosting. In: Proc. 21st Internat. Conf. on Machine Learning, pp. 217-224.
8. Freitag, D., McCallum, A., 2000. Information extraction with HMM structure learned by stochastic optimization. In: Proc. 17th National Conf. on Artificial Intelligence and 12th Conf. on Innovative Applications of Artificial Intelligence, pp. 584-589.
9. Guyon I., and Elisseeff A. An introduction to variable and feature selection. J. Machine Learn. Res. 3 (2003) 1157-1182
10. Kohavi R., and John G.H. Wrappers for feature subset selection. Artif. Intell. 97 (1997) 273-324
11. Kumar, S., Hebert, M., 2003. Discriminative random fields: A discriminative framework for contextual. In: Proc. 9th IEEE Internat. Conf. on Computer Vision, vol. 2, pp. 1150-1157.
12. Lafferty, J.D., McCallum, A., et al., 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Proc. 18th Internat. Conf. on Machine Learning, pp. 282-289.
13. Lee C., Schmidt M., et al. Segmenting brain tumors with conditional random fields and support vector machines. Lect. Notes Comput. Sci. 3765 (2005) 469-478
14. McCallum, A., 2003. Efficiently inducing features of conditional random fields. In: Proc. 19th Conf. on Uncertainty in Artificial Intelligence, pp. 403-410.
15. Mccallum, A., Freitag, D., et al., 2000. Maximum entropy Markov models for information extraction and segmentation. In: Proc. 17th Internat. Conf. on Machine Learning, pp. 591-598.
16. McCallum, A., Rohanimanesh, K., et al., 2003. Dynamic conditional random fields for jointly labeling multiple sequences. In: NIPS03's Workshop on Syntax, Semantics, Statistics.
17. Quattoni A., Collins M., et al. Conditional random fields for object recognition. Adv. Neural Inform. Process. Syst. 18 (2005) 1097-1104
18. Rabiner L.R. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77 2 (1989) 257-286
19. Sarawagi S., and Cohen W.W. Semi-Markov conditional random fields for information extraction. Adv. Neural Inform. Process. Syst. 18 (2005) 1185-1192
20. Settles, B., 2004. Biomedical named entity recognition using conditional random fields and rich feature sets. In: Internat. Joint Workshop on Natural Language Processing in Biomedicine and its Applications, pp. 107-110.
21. Sha, F., Pereira, F., 2003. Shallow parsing with conditional random fields. In: Proc. 2003 Conf. on North American Chapter of the Association for Computational Linguistics on Human Language Technology, vol. 1, pp. 134-141.
22. Sutton C., and McCallum A. An introduction to conditional random fields for relational learning. In: Getoor L., and Taskar B. (Eds). Introduction to Statistical Relational Learning (2007), The MIT Press 93-122
23. Sutton C., McCallum A., et al. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting. J. Machine Learn. Res. 8 (2007) 693-723
24. Taskar B., Guestrin C., et al. Max margin Markov networks. Adv. Neural Inform. Process. Syst. 16 (2003) 25-32
25. Vincent P., and Bengio Y. Kernel matching pursuit. Machine Learning 48 (2002) 169-191
26. Vishwanathan, S., Schraudolph, N., et al. 2006. Accelerated training of conditional random fields with stochastic Meta-Descent. In: Proc. 23rd Internat. Conf. on Machine Learning, pp. 969-976.
27. Wallach, H., 2002. Efficient Training of Conditional Random Fields. Master of Science, University of Edinburgh.
28. Yu, L., Liu, H., 2003. Feature selection for high-dimensional data: A fast correlation-based filter solution. In: Proc. 20th Internat. Conf. on Machine Learning, pp. 856-863.
29. Yu L., and Liu H. Efficient feature selection via analysis of relevance and redundancy. J. Machine Learn. Res. 5 (2004) 1205-1224
30. Zhu, J., Nie, Z., et al., 2005. 2D conditional random fields for Web information extraction. In: Proc. 22nd Internat. Conf. on Machine Learning, pp. 1044-1051.