995 search results - page 77 / 199 » nips 2007 |
102
click to vote
NIPS
2004
15 years 2 months ago
2004
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
NIPS
2004
15 years 2 months ago
2004
While clustering is usually an unsupervised operation, there are circumstances in which we believe (with varying degrees of certainty) that items A and B should be assigned to the...
107
Voted
NIPS
2004
15 years 2 months ago
2004
A typical neuron in visual cortex receives most inputs from other cortical neurons with a roughly similar stimulus preference. Does this arrangement of inputs allow efficient read...
NIPS
2004
15 years 2 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
NIPS
2004
15 years 2 months ago
2004
We describe a way of using multiple different types of similarity relationship to learn a low-dimensional embedding of a dataset. Our method chooses different, possibly overlappin...