5329 search results - page 225 / 1066 » The Weighted Majority Algorithm |
171
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
174
click to vote
NIPS
1994
15 years 7 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...
178
click to vote
NIPS
1996
15 years 7 months ago
1996
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
142
click to vote
ENDM
2008
15 years 6 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
169
click to vote
MICS
2008
15 years 6 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...