723 search results - page 3 / 145 » Learning a Hidden Subgraph |
109
click to vote
ICML
2008
IEEE
15 years 11 months ago
2008
IEEE
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
MLG
2007
Springer
15 years 4 months ago
2007
Springer
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no la...
102
click to vote
ICDAR
2011
IEEE
13 years 10 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
76
Voted
UAI
2008
14 years 11 months ago
2008
We consider the task of learning mappings from sequential data to real-valued responses. We present and evaluate an approach to learning a type of hidden Markov model (HMM) for re...
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...