18 search results - page 3 / 4 » Perceptron Based Learning with Example Dependent and Noisy C... |
ILP
2005
Springer
14 years 1 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
KDD
2009
ACM
14 years 10 days ago
2009
ACM
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
PPSN
1990
Springer
13 years 11 months ago
1990
Springer
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
COLT
1999
Springer
14 years 1 days ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...