The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A heuristic approach to determine an appropriate number of topics in topic modeling
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
MUSCLE: multiple sequence alignment with high accuracy and high throughput
Edgar, R. C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh340 · Cited by 44,662
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Unsupervised Learning by Probabilistic Latent Semantic Analysis
Hofmann, T. (2001) · Machine Learning · doi:10.1023/a:1007617005950 · Cited by 2,456
Blei, D. M., & Jordan, M. I. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860460 · Cited by 1,054
A side effect resource to capture phenotypic effects of drugs
Kuhn, M., Campillos, M., Letunic, I., Jensen, L. J., & Bork, P. (2010) · Molecular Systems Biology · doi:10.1038/msb.2009.98 · Cited by 899
Cited by
The utility of topic modelling for discourse studies: a critical evaluation
Brookes, G., & McEnery, T. (2019) · Discourse Studies · doi:10.1177/1461445618814032 · Cited by 175
Normalized Approach to Find Optimal Number of Topics in Latent Dirichlet Allocation (LDA)
Hasan, M., Rahman, A., Karim, M. R., Khan, M. S. I., & Islam, M. J. (2021) · Advances in Intelligent Systems and Computing · doi:10.1007/978-981-33-4673-4_27 · Cited by 119
Mental health responses to COVID-19 around the world
Olff, M., Primasari, I., Qing, Y., Coimbra, B. M., Hovnanyan, A., Grace, E., Williamson, R. E., Hoeboer, C. M., & Consortium, T. G.-C. (2021) · European Journal of Psychotraumatology · doi:10.1080/20008198.2021.1929754 · Cited by 108
The sustainable start‐up paradox: Predicting the business and climate performance of start‐ups
Leendertse, J., van Rijnsoever, F. J., & Eveleens, C. P. (2021) · Business Strategy and the Environment · doi:10.1002/bse.2667 · Cited by 64
Large-scale analysis of grooming in modern social networks
Lykousas, N., & Patsakis, C. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114808 · Cited by 26
Metadata
- Authors
- Zhao, W., Chen, J. J., Perkins, R., Liu, Z., Ge, W., Ding, Y., & Zou, W.
- Venue
- BMC Bioinformatics
- Published
- 2015-12
- Volume
- 16
- Issue
- S13
- Pages
- S8-S8
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2162317738
- Cited by
- 382
- References
- 16
- FWCI
- 14.08
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A heuristic approach to determine an appropriate number of topics in topic modeling. https://app.cochat.ai/papers/10.1186/1471-2105-16-s13-s8
- The paper
- Zhao, W., Chen, J. J., Perkins, R., Liu, Z., Ge, W., Ding, Y., & Zou, W. (2015). A heuristic approach to determine an appropriate number of topics in topic modeling. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-16-s13-s8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.