2011 IEEE 11th International Conference on Data Mining (2011)
Dec. 11, 2011 to Dec. 14, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2011.24
We introduce Semstem, a new method for the reconstruction of so called stemmatic trees, i.e., trees encoding the copying relationships among a set of textual variants. Our method is based on a structural expectation-maximization (structural EM) algorithm. It is the first computer-based method able to estimate general latent tree structures, unlike earlier methods that are usually restricted to bifurcating trees where all the extant texts are placed in the leaf nodes. We present experiments on two well known benchmark data sets, showing that the new method outperforms current state-of-the-art both in terms of a numerical score as well as interpretability.
graphical models, latent trees, EM algorithm, stemmatology, textual criticism
T. Roos and Y. Zou, "Analysis of Textual Variation by Latent Tree Structures," 2011 IEEE 11th International Conference on Data Mining(ICDM), Vancouver, Canada, 2011, pp. 567-576.