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
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Maximum Entropy Markov Models for Information Extraction and Segmentation
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Large Margin Methods for Structured and Interdependent Output Variables
The Journal of Machine Learning Research
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Comparisons of sequence labeling algorithms and extensions
Proceedings of the 24th international conference on Machine learning
Search-based structured prediction
Machine Learning
Practical structured learning techniques for natural language processing
Practical structured learning techniques for natural language processing
Hybrid Repayment Prediction for Debt Portfolio
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Prediction of Sequential Values for Debt Recovery
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Label-dependent feature extraction in social networks for node classification
SocInfo'10 Proceedings of the Second international conference on Social informatics
A method of label-dependent feature extraction in social networks
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Hi-index | 0.00 |
The problem of sequence prediction i.e annotating sequences appears in many problems across a variety of scientific disciplines, especially in computational biology, natural language processing, speech recognition, etc The paper investigates a boosting approach to structured prediction, AdaBoostSTRUCT, based on proposed sequence-loss balancing function, combining advantages of boosting scheme with the efficiency of dynamic programming method In the paper the method's formalism for modeling and predicting label sequences is introduced as well as examined, presenting its validity and competitiveness.