2190 search results - page 240 / 438 » Learning with the Set Covering Machine |
143
Voted
NIPS
2001
15 years 4 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
126
Voted
PROMISE
2010
14 years 10 months ago
2010
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
129
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Extensive software-based simulation continues to be the mainstream methodology for functional verification of designs. To optimize the use of limited simulation resources, coverag...
122
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
133
Voted
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...