الگوسازی موضوعات بر پایه‌ روش بیز تغییراتی

در این مقاله، برپایه‌ی روش بیز گوناگونی، نشان می‌دهیم که روش تخصیص پنهان دیریکله که یک مدل احتمالاتی مولّد است و در پردازش زبان‌های طبیعی، متن‌کاوی، کاهش ابعاد، و زیست‌داده‌ورزی کاربرد دارد،  نسبت به روش تحلیل معنایی پنهان احتمالاتی در مدل‌بندی داده‌ها عملکرد بهتری دارد. در این باره، ابتدا یک مدل بیزی را در مدل‌سازی موضوع‌ها شرح می‌دهیم. آنگاه با روش بیز گوناگونی و الگوریتم امیدریاضی-بیشینه‌سازی (em) پارامترهای مدل را برآورد می‌کنیم. سپس الگوریتم ارائه شده، موسوم به الگوریتم em گوناگونی، را برپایه‌ی یک مجموعه‌داده‌ی نوشتاری از داده‌های واقعی در زمینه‌ی تحلیل داده‌های خبری پیاده‌سازی می‌کنیم و مدل‌بندی زبانی را بر اساس ملاک سرگشتگی بررسی می‌کنیم، و دقت خوشه‌بندی موضوع‌ها و کاربرد کاهش ابعاد داده‌های حجیم را با کمک ماشین بردار پشتیبان می‌سنجیم. همچنین در مقایسه‌ای دیگر، کاربرد الگوریتم پیشنهادی را در پالایش همکارانه بررسی می‌کنیم.

topic modeling based on variational bayes method

the latent dirichlet allocation (lda) model is a generative model with several applications in natural language processing, text mining, dimension reduction, and bioinformatics. it is a powerful technique in topic modeling in text mining, which is a data mining method to categorize documents by their topic.basic methods for topic modeling, including tf-idf, unigram, and mixture of unigrams successfully deployed in modern search engines. although these methods have some useful benefits, they don’t provide much summarization and reduction. to overcome these shortcomings, the latent semantic analysis (lsa) has been proposed, which uses singular value decomposition (svd) of word-document matrix to compress big collection of text corpora. user’s search key words can be queried by making a pseudo-document vector. the next improvement step in topic modeling was probabilistic latent semantic analysis (plsa), which has a close relation to lsa and matrix decomposition with svd. by introducing of exchangeability for the words in documents, the topic modeling has been proceeded beyond plsa and leads to lda model.we consider a corpus  contains m  documents, each document  has  words, and each word is an indicator from one of  vocabularies. we defined a generative model for generation of each document as follows. for each document draw its topic  from  and repeatedly for each  draw topic of each word  from  and draw each word from the probability matrix of  with probability of . we can repeat this procedure to generate whole documents of corpus. we want to find corpus related parameters  and  as well as latent variables  and  for each document. unfortunately, the posterior  is intractable, and we have to choose an approximation scheme.in this paper we utilize lda for collection of discrete text corpora. we describe procedures for inference and parameter estimation. since computing posterior distribution of hidden variables given a document is intractable to compute in general, we use approximate inference algorithm called variational bayes method. the basic idea of variational bayes is to consider a family of adjustable lower bound on the posterior, then finds the tightest possible one. to estimate optimal hyper-parameters in the model, we used the empirical bayes method, as well as a specialized expectation-maximization (em) algorithm called variational-em algorithm.the results are reported in document modeling, text classification, and collaborative filtering. the topic modeling of lda and plsa models are compared on a persian news data set. it has been observed that lda has perplexity between  and , while the plsa has perplexity between  and , which shows domination of lda over plsa.the lda model has also been applied for dimension reduction in a document classification problem, along with the support vector machines (svm) classification method. two competitor models are compared, first trained on a low-dimensional representation provided by lda and the second trained on all documents of corpus, with accuracies  and , respectively, this means we lose accuracy but it remains in reasonable range when we use lda model for dimensionality reduction.finally, we used the lda and plsa methods along with the collaborative filtering for movielens 1m data set, and we observed that the predictive-perplexity of lda changes from  to  while it changes from  to  for plsa, again showing the domination of the lda method.