.png){kind=icon}
Return
Probabilistic topic models for sequence data
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-013-5391-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Recommender systems
Collaborative filtering
Probabilistic topic models
Performance
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
Seismic anisotropy indicates organized melt beneath the Mid-Atlantic Ridge aids seafloor spreading.png)
GeologyOAAI
GeologyIF0
OAAIShareSavePredicting metachronous liver metastasis from colorectal cancer using serum proteomic fingerprinting
PREAI
ShareSaveShareSave
ShareSave
View more