11910 search results - page 2156 / 2382 » Online Learning Algorithms |
200
click to vote
KDD
2005
ACM
16 years 18 days ago
2005
ACM
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining ap...
218
Voted
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
217
Voted
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
159
Voted
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
189
click to vote
AAAI
1998
15 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...