Stacked dependency networks for layout document structuring
Boris Chidlovskii, Loïc Lecerf
We address the problem of structuring and annotation of layout-oriented documents. We model the annotation problems as the collective classification on graph-like structures with typed instances and links that capture the domain-specific knowledge. We use the relational dependency networks (RDNs) for the collective inference on the multi-typed graphs. We then describe a variant of RDNs where a stacked approximation replaces the Gibbs sampling in order to accelerate the inference. We report results of evaluation tests for both the Gibbs sampling and stacking inference on two document structuring examples.
The 23rd Annual ACM Symposium on Applied Computing, Fortaleza, Brazil, March 16-20, 2008.
Full paper available on ACM Portal