222 search results - page 10 / 45 » Experiments with random projections for machine learning |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
IADIS
2004
13 years 9 months ago
2004
The e-learning project GOLEM introduces a group and role-oriented concept to the course "Man-Machine Interfaces" at the University of Technology in Hamburg, Germany. Stu...