Sciweavers

Share
14 search results - page 1 / 3
» Graphs, Hypergraphs, and Inductive Logic Programming
Sort
View
MLG
2007
Springer
10 years 9 months ago
Graphs, Hypergraphs, and Inductive Logic Programming
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...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
ICML
2007
IEEE
11 years 3 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
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...
Gabriel Wachman, Roni Khardon
IPPS
2000
IEEE
10 years 7 months ago
The Parallelization of a Knowledge Discovery System with Hypergraph Representation
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDEDpronounced indee...
Jennifer Seitzer, James P. Buckley, Yi Pan, Lee A....
MST
2008
141views more  MST 2008»
10 years 2 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
JCT
2011
115views more  JCT 2011»
9 years 9 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
books