Sciweavers

723 search results - page 21 / 145
» Learning a Hidden Subgraph
Sort
View
IDEAL
2009
Springer
14 years 2 months ago
Clustering with XCS and Agglomerative Rule Merging
Abstract. In this paper, we present a more effective approach to clustering with eXtended Classifier System (XCS) which is divided into two phases. The first phase is the XCS le...
Liangdong Shi, Yinghuan Shi, Yang Gao
IICAI
2007
13 years 9 months ago
Modeling Temporal Behavior via Structured Hidden Markov Models: an Application to Keystroking Dynamics
Structured Hidden Markov Models (S-HMM) are a variant of Hierarchical Hidden Markov Models; it provides an abstraction mechanism allowing a high level symbolic description of the k...
Ugo Galassi, Attilio Giordana, Charbel Julien, Lor...
NIPS
2001
13 years 8 months ago
The Infinite Hidden Markov Model
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
Matthew J. Beal, Zoubin Ghahramani, Carl Edward Ra...
IDA
2007
Springer
13 years 7 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ECML
2005
Springer
14 years 1 months ago
Inducing Hidden Markov Models to Model Long-Term Dependencies
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
Jérôme Callut, Pierre Dupont