- 博客(5)
- 收藏
- 关注
RSS订阅原创 Markov Chain - Monte Carlo method and Gibbs Sampling for Latent Dirichlet Allocation
Markov Chain - Monte Carlo method and Gibbs Sampling for Latent Dirichlet AllocationIn Latent Dirichlet Allocation (LDA), we want to infer the topic allocation of documents, i.e., P(z|w)=P(w,z)∑zP(w,z)
2017-02-22 05:06:01
246
原创 Map Reduce for K-means Clustering(Short Introduction)
Map Reduce Framework for K-means ClusteringK-means is a very simple hard clustering technique. The goal of k-means clustering is to minimize the total distance from all the points to the corresponding
2017-02-09 23:54:28
185
原创 K-NN Searching and Locality Sensitive Hashing
K-NN Searching and Locality Sensitive HashingK Nearest Neighbors searching is one of the most practical techniques that can be applied in information retrieval. The idea is, the retrieval system return
2017-02-08 03:39:42
198
原创 Optimizing Latent Dirichlet Allocation with Variational Inference
Optimizing Latent Dirichlet Allocation with Variational InferenceIn the last article, we discussed how variational inference works. This time, it will be applied to Latent DirichletWe already know that
2017-02-03 01:14:33
164
原创 Learning Variational Inference and Latent Dirichlet Allocation
Learning Variational Inference and Latent Dirichlet AllocationLatent Dirichlet Allocation(LDA) is a generative model which can be used in document clustering or information retrieval. It assumes the ge
2017-02-01 05:35:03
262
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人