2190 search results - page 265 / 438 » Learning with the Set Covering Machine |
MLDM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
COLT
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
KES
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
ML
2002
ACM
13 years 9 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
ML
2007
ACM
13 years 8 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...