98 search results - page 6 / 20 » Learning Relational Features with Backward Random Walks |
156
click to vote
ESANN
2006
15 years 2 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
118
click to vote
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
119
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...
113
click to vote
DAGM
2009
Springer
15 years 8 months ago
2009
Springer
The human ability to learn difficult object categories from just a few views is often explained by an extensive use of knowledge from related classes. In this work we study the use...
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...