346 search results - page 18 / 70 » A New Approximate Maximal Margin Classification Algorithm |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...