997 search results - page 63 / 200 » Completely Lazy Learning |
NIPS
1998
13 years 11 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
AAAI
2011
12 years 10 months ago
2011
Transfer learning allows knowledge to be extracted from auxiliary domains and be used to enhance learning in a target domain. For transfer learning to be successful, it is critica...
WINE
2010
Springer
13 years 7 months ago
2010
Springer
A common approach to analyzing repeated auctions, such as sponsored search auctions, is to treat them as complete information games, because it is assumed that, over time, players...
COLT
1995
Springer
14 years 1 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...