49 search results - page 8 / 10 » Learning DNF from Random Walks |
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a novel representation of cyclic human locomotion based on a set of spatio-temporal curves of tracked points on the surface of a person. We start by extracting a set of...
ICML
2003
IEEE
14 years 8 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 ...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Finding a person in a public place, such as in a library, conference hotel, or shopping mall, can be difficult. The difficulty arises from not knowing where the person may be at t...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...