Probabilistic frequent subtrees for efficient graph classification and retrieval

DOI10.1007/s10994-017-5688-7zbMath1475.68361OpenAlexW2768237932MaRDI QIDQ1631835

Pascal Welke, Stefan Wrobel, Tamás L. Horváth

Publication date: 7 December 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-017-5688-7

zbMATH Keywords

pattern miningfrequent subgraph miningefficient embedding computationfrequent subtree miningMIN-hashingprobabilistic subtrees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Probabilistic and exact frequent subtree mining in graphs beyond forests

Uses Software

• LIBSVM

Cites Work

• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Min-wise independent permutations
• Faster Subtree Isomorphism
• Learning Theory and Kernel Machines
• Frequent Hypergraph Mining
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic frequent subtrees for efficient graph classification and retrieval