995 search results - page 76 / 199 » nips 2007 |
113
click to vote
NIPS
2004
15 years 2 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
103
Voted
NIPS
2004
15 years 2 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
NIPS
2004
15 years 2 months ago
2004
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
115
click to vote
NIPS
2004
15 years 2 months ago
2004
A graph-based prior is proposed for parametric semi-supervised classification. The prior utilizes both labelled and unlabelled data; it also integrates features from multiple view...
104
Voted
NIPS
2004
15 years 2 months ago
2004
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...