3250 search results - page 319 / 650 » Parameterized Learning Complexity |
134
click to vote
CIG
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
147
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Record linkage is the process of determining that two records refer to the same entity. A key subprocess is evaluating how well the individual fields, or attributes, of the recor...
169
click to vote
KNINVI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Due to the increasing amount and complexity of knowledge and information in many domains, students who self-regulate their study in e-learning scenarios often suffer from...
169
Voted
COLT
2000
Springer
15 years 9 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
156
click to vote
HIS
2004
15 years 6 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...