Boosting Algorithm with Sequence-Loss Cost Function for Structured Prediction
暂无分享,去创建一个
[1] Daniel Marcu,et al. Practical structured learning techniques for natural language processing , 2006 .
[2] Yunsong Guo,et al. Comparisons of sequence labeling algorithms and extensions , 2007, ICML '07.
[3] Thomas Hofmann,et al. Discriminative Learning for Label Sequences via Boosting , 2002, NIPS.
[4] Ben Taskar,et al. Max-Margin Markov Networks , 2003, NIPS.
[5] Przemyslaw Kazienko,et al. Prediction of Sequential Values for Debt Recovery , 2009, CIARP.
[6] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[7] J. Friedman. Special Invited Paper-Additive logistic regression: A statistical view of boosting , 2000 .
[8] Przemyslaw Kazienko,et al. Hybrid Repayment Prediction for Debt Portfolio , 2009, ICCCI.
[9] John Langford,et al. Search-based structured prediction , 2009, Machine Learning.
[10] Michael Collins,et al. Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms , 2002, EMNLP.
[11] Andrew McCallum,et al. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.
[12] Andrew McCallum,et al. Maximum Entropy Markov Models for Information Extraction and Segmentation , 2000, ICML.
[13] Thomas Hofmann,et al. Large Margin Methods for Structured and Interdependent Output Variables , 2005, J. Mach. Learn. Res..
[14] Dan Roth,et al. The Use of Classifiers in Sequential Inference , 2001, NIPS.