530 search results - page 37 / 106 » Learning Bounds for Domain Adaptation |
108
click to vote
JCO
2010
14 years 11 months ago
2010
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
121
Voted
ICITS
2009
14 years 10 months ago
2009
Abstract. This survey paper studies recent advances in the field of LeakageResilient Cryptography. This booming area is concerned with the design of cryptographic primitives resist...
103
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
106
click to vote
TKDE
2010
14 years 11 months ago
2010
—A major assumption in many machine learning and data mining algorithms is that the training and future data must be in the same feature space and have the same distribution. How...
120
click to vote
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...