An improved algorithm for unsupervised decomposition of a multi‐author document

This article addresses the problem of unsupervised decomposition of a multi‐author text document: identifying the sentences written by each author assuming the number of authors is unknown. An approach, B ayes AD , is developed for solving this problem: apply a B ayesian segmentation algorithm, followed by a segment clustering algorithm. Results are presented from an empirical comparison between BayesAD and AK , a modified version of an approach published by A kiva and K oppel in 2013. B ayes AD exhibited greater accuracy than AK in all experiments. However, B ayes AD has a parameter that needs to be set and which had a nontrivial impact on accuracy. Developing an effective method for eliminating this need would be a fruitful direction for future work. When controlling for topic, the accuracy levels of B ayes AD and AK were, in all but one case, worse than a baseline approach wherein one author was assumed to write all sentences in the input text document. Hence, room for improved solutions exists.