Sciweavers

18 search results - page 2 / 4
» mlg 2007
Sort
View
MLG
2007
Springer
15 years 11 months ago
DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGs
Alexandre Termier, Yoshinori Tamada, Kazuyuki Numa...
MLG
2007
Springer
15 years 11 months ago
Comparative Evaluation of PL languages
We introduce a framework for an empirical evaluation of probabilistic logic languages and systems.
Manfred Jaeger, Petr Lidman, Juan L. Mateo
143
Voted
MLG
2007
Springer
15 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
15 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
MLG
2007
Springer
15 years 11 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt