1531 search results - page 44 / 307 » Learning probabilistic models of the Web |
159
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
149
click to vote
ICDAR
2009
IEEE
16 years 4 days ago
2009
IEEE
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
174
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP...
138
click to vote
WWW
2006
ACM
16 years 6 months ago
2006
ACM
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
184
click to vote
IJCAI
2001
15 years 6 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...