Sciweavers

495 search results - page 7 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
82
Voted
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
15 years 3 months ago
Enhancing the lift under budget constraints: an application in the mutual fund industry
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...
Lian Yan, Michael Fassino, Patrick Baldasare
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 1 days ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
CEC
2005
IEEE
15 years 3 months ago
A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary alg
This paper presents a study on Hierarchical Surrogate-Assisted Evolutionary Algorithm (HSAEA) using different global surrogate models for solving computationally expensive optimiza...
Zongzhao Zhou, Yew-Soon Ong, My Hanh Nguyen, Dudy ...
FOCS
2000
IEEE
15 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
UAI
2004
14 years 11 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner