888 search results - page 4 / 178 » Improving Random Projections Using Marginal Information |
NIPS
2007
14 years 11 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
ECML
2004
Springer
15 years 2 months ago
2004
Springer
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
ESANN
2006
14 years 11 months ago
2006
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...