95 search results - page 11 / 19 » kdd 2010 |
105
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
61
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
105
click to vote
KDD
2010
ACM
14 years 10 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...