active decorate. bad choice?
a couple of days ago, the first round of active learning based on the decorate algorithm, activedecorate, called home. what puzzles me, and which i guess i’ll have to explain in the thesis later on, is that while query-by-boosting gave good results, the activedecorate approach did not. at all. strange. for the experiments reported in the literature, activedecorate outperforms query-by-boosting. but then again, those experiments i’ve encountered didn’t include using active learning for selecting documents based on the sequential tagging of tokens (think named entity recognition).
active learning for probability estimation using jensen-shannon divergence