Sciweavers

MLG
2007
Springer
13 years 11 months ago
Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, Jose Santos
MLG
2007
Springer
13 years 11 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
MLG
2007
Springer
13 years 11 months ago
Web Graph Parameters and the Pagerank Distribution
Yana Volkovich, Nelly Litvak, Debora Donato
MLG
2007
Springer
13 years 11 months ago
DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGs
Alexandre Termier, Yoshinori Tamada, Kazuyuki Numa...
MLG
2007
Springer
13 years 11 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
MLG
2007
Springer
13 years 11 months ago
Inferring Vertex Properties from Topology in Large Networks
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
Janne Sinkkonen, Janne Aukia, Samuel Kaski
MLG
2007
Springer
13 years 11 months ago
A Polynomial-time Metric for Outerplanar Graphs
Leander Schietgat, Jan Ramon, Maurice Bruynooghe
MLG
2007
Springer
13 years 11 months ago
Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic
d Abstract) Kaspar Riesen, Stefan Fankhauser and Horst Bunke2
Kaspar Riesen, Stefan Fankhauser, Horst Bunke
MLG
2007
Springer
13 years 11 months ago
General Graph Refinement with Polynomial Delay
Jan Ramon, Siegfried Nijssen
MLG
2007
Springer
13 years 11 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens