Sciweavers

286 search results - page 28 / 58
» A Markov Chain Model of the B-Cell Algorithm
Sort
View
CIA
2006
Springer
13 years 11 months ago
Learning to Negotiate Optimally in Non-stationary Environments
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
Vidya Narayanan, Nicholas R. Jennings
KDD
2012
ACM
254views Data Mining» more  KDD 2012»
11 years 10 months ago
Playlist prediction via metric embedding
Digital storage of personal music collections and cloud-based music services (e.g. Pandora, Spotify) have fundamentally changed how music is consumed. In particular, automatically...
Shuo Chen, Josh L. Moore, Douglas Turnbull, Thorst...
UAI
2000
13 years 9 months ago
Minimum Message Length Clustering Using Gibbs Sampling
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...
Ian Davidson
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
13 years 11 months ago
Modeling relational events via latent classes
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
Christopher DuBois, Padhraic Smyth
TOIS
2010
128views more  TOIS 2010»
13 years 5 months ago
Learning author-topic models from text corpora
We propose a new unsupervised learning technique for extracting information about authors and topics from large text collections. We model documents as if they were generated by a...
Michal Rosen-Zvi, Chaitanya Chemudugunta, Thomas L...