995 search results - page 126 / 199 » Learning Useful Horn Approximations |
94
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
We describe the TiVo television show collaborative recommendation system which has been fielded in over one million TiVo clients for four years. Over this install base, TiVo curre...
150
click to vote
ALT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
103
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
115
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
119
Voted
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...