video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Learning from Interpretations: A Rooted Kernel for Ordered Hypergraphs

Published on Feb 4, 20254636 Views

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 generalizes previous approache

Related categories

Presentation

Learning from interpretations: A rooted kernel for ordered hypergraphs01:40
Kernel definition-0130:45:38
Kernel definition-0244:43:32
Walk types71:29:59
Graph kernel and variants114:15:23
Edge kernel-01144:08:31
Edge kernel-02170:39:29
A hypergraph kernel-01189:30:57
A hypergraph kernel-02200:37:10
Edge encoding (Gärtner05)236:44:09
Edge encoding-01248:56:01
Edge encoding-02251:38:16
Edge encoding-03254:54:52
Edge encoding-04258:16:31
Edge encoding-05259:22:30
Edge encoding-07260:27:49
Edge encoding-08261:18:39
Results on NCTRER-01270:54:18
Results on NCTRER-02274:37:01
Results-01284:07:17
Results-02300:17:09
Results-03307:26:01
Results-04308:16:51
Results-05327:17:44
Results-06328:29:08
Results-07338:25:40