723 search results - page 97 / 145 » Learning a Hidden Subgraph |
105
click to vote
GG
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
COLT
2003
Springer
15 years 4 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
112
click to vote
DAGSTUHL
2006
15 years 13 days 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...
UAI
2003
15 years 12 days ago
2003
Published experiments on spidering the Web suggest that, given training data in the form of a (relatively small) subgraph of the Web containing a subset of a selected class of tar...
110
click to vote
ACL
2008
15 years 15 days ago
2008
Accurate unsupervised learning of phonemes of a language directly from speech is demonstrated via an algorithm for joint unsupervised learning of the topology and parameters of a ...