1897 search results - page 329 / 380 » Sparse Additive Machine |
98
Voted
SEAL
1998
Springer
15 years 4 months ago
1998
Springer
The allocation of office space in any large institution is usually a problematical issue, which often demands a substantial amount of time to perform manually. The result of this a...
103
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
101
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
107
click to vote
AINA
2004
IEEE
15 years 4 months ago
2004
IEEE
Abstract-- As intrusion detection essentially can be formulated as a binary classification problem, it thus can be solved by an effective classification technique-Support Vector Ma...
105
Voted
COLT
2004
Springer
15 years 4 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...