Sciweavers

2190 search results - page 47 / 438
» Learning with the Set Covering Machine
Sort
View
JMLR
2012
11 years 11 months ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...
AIED
2009
Springer
14 years 3 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
AWIC
2003
Springer
14 years 2 months ago
A Machine Learning Based Evaluation of a Negotiation between Agents Involving Fuzzy Counter-Offers
Abstract. Negotiation plays a fundamental role in systems composed of multiple autonomous agents. Some negotiations may require a more elaborated dialogue where agents would explai...
Javier Carbo Rubiera, Agapito Ledezma
IJCAI
2007
13 years 10 months ago
A Machine Learning Approach for Statistical Software Testing
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...
Nicolas Baskiotis, Michèle Sebag, Marie-Cla...