A heuristic approach to determine an appropriate number of topics in topic modeling. Issue 13 (December 2015)

• Record Type: Journal Article
• Authors: Zhao, Weizhong; Chen, James; Perkins, Roger; Liu, Zhichao; Ge, Weigong; Ding, Yijun; Zou, Wen
• Is Part Of: BMC bioinformatics. Volume 16:Issue 13(2015)
• Page Start: 1
• Page End: 10
• Publication Date: 2015-12
• Subjects: Rate of perplexity change (RPC) -- perplexity -- topic number -- latent Dirichlet allocation (LDA); Bioinformatics -- Periodicals; Computational biology -- Periodicals; 570.285
• DOI: 10.1186/1471-2105-16-S13-S8
• Languages: English
• ISSNs: 1471-2105

Abstract

Abstract Background Topic modelling is an active research field in machine learning. While mainly used to build models from unstructured textual data, it offers an effective means of data mining where samples represent documents, and different biological endpoints or omics data represent words. Latent Dirichlet Allocation (LDA) is the most commonly used topic modelling method across a wide number of technical fields. However, model development can be arduous and tedious, and requires burdensome and systematic sensitivity studies in order to find the best set of model parameters. Often, time-consuming subjective evaluations are needed to compare models. Currently, research has yielded no easy way to choose the proper number of topics in a model beyond a major iterative approach. Methods and results Based on analysis of variation of statistical perplexity during topic modelling, a heuristic approach is proposed in this study to estimate the most appropriate number of topics. Specifically, the rate of perplexity change (RPC) as a function of numbers of topics is proposed as a suitable selector. We test the stability and effectiveness of the proposed method for three markedly different types of grounded-truth datasets:Salmonella next generation sequencing, pharmacological side effects, and textual abstracts on computational biology and bioinformatics (TCBB) from PubMed. Conclusion The proposed RPC-based method is demonstrated to choose the best number of topics in three numerical experiments of widely different data types, and for databases of very different sizes. The work required was markedly less arduous than if full systematic sensitivity studies had been carried out with number of topics as a parameter. We understand that additional investigation is needed to substantiate the method's theoretical basis, and to establish its generalizability in terms of dataset characteristics.