Sciweavers

4886 search results - page 865 / 978
» Approximate Data Exchange
Sort
View
NIPS
2007
13 years 10 months ago
On Ranking in Survival Analysis: Bounds on the Concordance Index
In this paper, we show that classical survival analysis involving censored data can naturally be cast as a ranking problem. The concordance index (CI), which quantifies the quali...
Vikas C. Raykar, Harald Steck, Balaji Krishnapuram...
NIPS
2007
13 years 10 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
NIPS
2007
13 years 10 months ago
Bayesian Inference for Spiking Neuron Models with a Sparsity Prior
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
Sebastian Gerwinn, Jakob Macke, Matthias Seeger, M...
UAI
2008
13 years 10 months ago
Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
Eric Laber, Susan Murphy
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 10 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty