পদ্ধতির তুলনা করুন

	ব্যাখ্যাযোগ্য এলডিএ টপিক মডেল	Non-negative Matrix Factorization (NMF)
ক্ষেত্র	গভীর শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Latent structure
উদ্ভবের বছর	2003 (LDA); 2018–present (explainability extensions)	1999
প্রবর্তক	Blei, D. M., Ng, A. Y., & Jordan, M. I. (LDA seminal); explainability extensions by multiple authors	Lee, D. D. & Seung, H. S.
ধরন	Probabilistic generative topic model with interpretability enhancements	Matrix decomposition with non-negativity constraints
মৌলিক উৎস	Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022.	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
অপর নাম	Explainable LDA, Interpretable LDA, XAI-LDA, Transparent Topic Model	NMF, NNMF, nonnegative matrix factorization, non-negative matrix approximation
সম্পর্কিত	4	4
সারসংক্ষেপ	Explainable LDA combines Latent Dirichlet Allocation — the canonical probabilistic topic model introduced by Blei, Ng, and Jordan in 2003 — with post-hoc and intrinsic interpretability tools that make each discovered topic auditable, labeled, and trustworthy for human reviewers. It is widely used in NLP, social science text analysis, and computational humanities where transparency is required alongside discovery.	Non-negative Matrix Factorization (NMF) is a family of algorithms, introduced by Lee and Seung in their landmark 1999 Nature paper, that decomposes a non-negative data matrix V into the product of two lower-rank non-negative matrices W (basis components) and H (encoding coefficients). Unlike PCA or SVD, the non-negativity constraint forces the algorithm to learn strictly additive, parts-based representations, making the factors directly interpretable as building blocks of the original data.