723 search results - page 1 / 145 » Learning a Hidden Subgraph |
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
ICMLC
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we present a new method, time-striding hidden Markov model (TSHMM), to learn from long-term motion for atomic behaviors and the statistical dependencies among them. T...
MLG
2007
Springer
13 years 11 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Graphical relationships among web pages have been leveraged as sources of information in methods for ranking search results. To date, specific graphical properties have been used ...