697 search results - page 3 / 140 » Learning a Hidden Hypergraph |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
ICMLC
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we present a new method, time-striding hidden Markov model (TSHMM), to learn from long-term motion for atomic behaviors and the statistical dependencies among them. T...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
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...