3837 search results - page 158 / 768 » Learning Approximate Consistencies |
189
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
117
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
129
click to vote
NIPS
2004
15 years 6 months ago
2004
While clustering is usually an unsupervised operation, there are circumstances in which we believe (with varying degrees of certainty) that items A and B should be assigned to the...
149
click to vote
FOCM
2007
15 years 4 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
137
click to vote
NN
2000
Springer
15 years 4 months ago
2000
Springer
The aim of this paper is to study an Information Theory based learning theory for neural units endowed with adaptive activation functions. The learning theory has the target to fo...