723 search results - page 3 / 145 » Learning a Hidden Subgraph |
ICML
2008
IEEE
14 years 8 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
14 years 1 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...
ICDAR
2011
IEEE
12 years 7 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...
UAI
2008
13 years 8 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
14 years 8 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...