Name
Abstract | ||
|---|---|---|
Probabilistic topic models are widely used in different contexts to uncover the hidden structure in large text corpora. One of the main (and perhaps strong) assumption of these models is that generative process follows a bag-of-words assumption, i.e. each token is independent from the previous one. We extend the popular Latent Dirichlet Allocation model by exploiting three different conditional Markovian assumptions: (i) the token generation depends on the current topic and on the previous token; (ii) the topic associated with each observation depends on topic associated with the previous one; (iii) the token generation depends on the current and previous topic. For each of these modeling assumptions we present a Gibbs Sampling procedure for parameter estimation. Experimental evaluation over real-word data shows the performance advantages, in terms of recall and precision, of the sequence-modeling approaches. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10994-013-5391-2 | Machine Learning |
Keywords | Field | DocType |
Recommender systems,Collaborative filtering,Probabilistic topic models,Performance | Dynamic topic model,Latent Dirichlet allocation,Collaborative filtering,Pattern recognition,Computer science,Precision and recall,Artificial intelligence,Probabilistic logic,Topic model,Security token,Machine learning,Gibbs sampling | Journal |
Volume | Issue | ISSN |
93 | 1 | 0885-6125 |
Citations | PageRank | References |
11 | 0.63 | 23 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicola Barbieri | 1 | 511 | 29.53 |
| Giuseppe Manco | 2 | 918 | 68.94 |
| Ettore Ritacco | 3 | 171 | 24.86 |
| Marco Carnuccio | 4 | 15 | 2.12 |
| Antonio Bevacqua | 5 | 15 | 2.12 |