3949 search results - page 415 / 790 » Machine Learning and Data Mining |
136
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We present a new approach to multiple instance learning (MIL) that is particularly effective when the positive bags are sparse (i.e. contain few positive instances). Unlike other ...
132
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
The use of domain knowledge in a learner can greatly improve the models it produces. However, high-quality expert knowledge is very difficult to obtain. Traditionally, researchers...
134
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
133
click to vote
ECML
2007
Springer
15 years 11 months ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
156
click to vote
COLT
2000
Springer
15 years 9 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...