Sciweavers

1014 search results - page 73 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
AAAI
2010
13 years 9 months ago
Structure Learning for Markov Logic Networks with Many Descriptive Attributes
Many machine learning applications that involve relational databases incorporate first-order logic and probability. Markov Logic Networks (MLNs) are a prominent statistical relati...
Hassan Khosravi, Oliver Schulte, Tong Man, Xiaoyua...
COLT
2005
Springer
14 years 1 months ago
Learning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
Dana Angluin, Jiang Chen
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 8 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
WACV
2005
IEEE
14 years 1 months ago
Incorporating Object Tracking Feedback into Background Maintenance Framework
Adaptive background modeling/subtraction techniques are popular, in particular, because they are able to cope with background variations that are due to lighting variations. Unfor...
Leonid Taycher, John W. Fisher III, Trevor Darrell
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...