Sciweavers

7943 search results - page 28 / 1589
» A calculus for costed computations
Sort
View
ICML
1999
IEEE
14 years 8 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...
COR
2008
101views more  COR 2008»
13 years 7 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard
PCI
2005
Springer
14 years 26 days ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
ICDM
2003
IEEE
134views Data Mining» more  ICDM 2003»
14 years 20 days ago
Cost-Sensitive Learning by Cost-Proportionate Example Weighting
We propose and evaluate a family of methods for converting classifier learning algorithms and classification theory into cost-sensitive algorithms and theory. The proposed conve...
Bianca Zadrozny, John Langford, Naoki Abe
IPPS
1998
IEEE
13 years 11 months ago
Building BSP Programs Using the Refinement Calculus
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
David B. Skillicorn