From: Statistical algorithms for ontology-based annotation of scientific literature

Input • Un-Labeled Item I • Bayesian Decision Tree T Output • Label Vector in Multiple Categories L Algorithm t = Root(T) SearchList = NULL while t ~= NULL do L = L : Bt(I) for l ϵ B _{t}(I) doSearchList = SearchList : Child(l, t) end for t = SearchList[0] x : SearchList = SearchList end while return L |