916 search results - page 49 / 184 » Algorithm selection: a quantitative computation-intensive op... |
115
click to vote
ICML
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
130
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
116
Voted
JMLR
2010
14 years 9 months ago
2010
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...
148
Voted
AROBOTS
2002
15 years 2 months ago
2002
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
126
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...