Sciweavers

697 search results - page 14 / 140
» Learning a Hidden Hypergraph
Sort
View
FCT
2009
Springer
14 years 4 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
UAI
2004
13 years 11 months ago
"Ideal Parent" Structure Learning for Continuous Variable Networks
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...
Iftach Nachman, Gal Elidan, Nir Friedman
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 4 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
ICIP
2004
IEEE
14 years 11 months ago
Automatically learning structural units in educational videos with the hierarchical hidden markov models
In this paper we present a coherent approach using the hierarchical HMM with shared structures to extract the structural units that form the building blocks of an education/traini...
Dinh Q. Phung, Svetha Venkatesh, Hung Hai Bui
ICALP
2004
Springer
14 years 3 months ago
Learning a Hidden Subgraph
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...
Noga Alon, Vera Asodi