712 search results - page 34 / 143 » A mixture model for random graphs |
ESANN
2007
13 years 11 months ago
2007
We present a generative probabilistic model for the topographic mapping of tree structured data. The model is formulated as constrained mixture of hidden Markov tree models. A nat...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
TFS
2008
2008
Type-2 Fuzzy Markov Random Fields and Their Application to Handwritten Chinese Character Recognition
13 years 10 months ago
In this paper, we integrate type-2 (T2) fuzzy sets with Markov random fields (MRFs) referred to as T2 FMRFs, which may handle both fuzziness and randomness in the structural patter...
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
ESANN
2004
13 years 11 months ago
2004
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...