Stacked Sequential Learning
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 671-675.
Abstract
We describe a new sequential learning scheme called “stacked sequential learning”. Stacked sequential learning is a meta-learning algorithm, in which an arbitrary base learner is augmented so as to make it aware of the labels of nearby examples. We evaluate the method on several “sequential partitioning problems”, which are characterized by long runs of identical labels. We demonstrate that on these problems, sequential stacking consistently improves the performance of non-sequential base learners; that sequential stacking often improves performance of learners (such as CRFs) that are designed specifically for sequential tasks; and that a sequentially stacked maximum-entropy learner generally outperforms CRFs.
@inproceedings{ijcai2005p17,
title = {Stacked Sequential Learning},
author = {Cohen, William W. and de Carvalho, Vitor Rocha},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {671--675},
year = {2005},
url = {https://ijcai.org/proceedings/2005/17},
}
TY - CPAPER TI - Stacked Sequential Learning AU - Cohen, William W. AU - de Carvalho, Vitor Rocha T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 671 EP - 675 UR - https://ijcai.org/proceedings/2005/17 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: