1658 search results - page 109 / 332 » Learning Unknown Graphs |
129
click to vote
MLDM
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
172
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
156
click to vote
TSP
2011
14 years 11 months ago
2011
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
172
click to vote
ALT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
118
click to vote
ICML
2003
IEEE
16 years 5 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 ...