• URL
• PDF

Whitney, M., & Sarkar, A. (2012). Bootstrapping via Graph Propagation. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (ACL-2012). Jeju Island, R. of Korea: Association for Computational Linguistics.

Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via features shared between them. This paper introduces a novel variant of the Yarowsky algorithm based on this view. It is a bootstrapping learning method which uses a graph propagation algorithm with a well defined objective function. The experimental results show that our proposed bootstrapping algorithm achieves state of the art performance or better on several different natural language data sets.

@inproceedings{whitney-sarkar:2012,
  author = {Whitney, Max and Sarkar, Anoop},
  title = {Bootstrapping via Graph Propagation},
  booktitle = {Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (ACL-2012)},
  year = {2012},
  month = {jul},
  address = {Jeju Island, R. of Korea},
  publisher = {Association for Computational Linguistics},
  url = {http://natlang.cs.sfu.ca/software#yarowsky},
  pdf = {http://www2.cs.sfu.ca/~mwhitney/personal/yarowsky-propagation.pdf}
}