Sciweavers

332 search results - page 44 / 67
» Principles of Lifelong Learning for Predictive User Modeling
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ESSMAC
2003
Springer
14 years 27 days ago
Hex: Dynamics and Probabilistic Text Entry
We present a gestural interface for entering text on a mobile device via continuous movements, with control based on feedback from a probabilistic language model. Text is represent...
John Williamson, Roderick Murray-Smith
SIGIR
2009
ACM
14 years 2 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
WWW
2010
ACM
14 years 2 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
ICML
2005
IEEE
14 years 8 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...