Frequent Hypergraph Mining

DOI10.1007/978-3-540-73847-3_26zbMath1201.68088OpenAlexW1489563933MaRDI QIDQ5426051

Luc De Raedt, Tamás L. Horváth, Bjoern Bringmann

Publication date: 15 November 2007

Published in: Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/146193

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Hypergraphs (05C65)

Related Items (4)

Probabilistic frequent subtrees for efficient graph classification and retrieval ⋮ Probabilistic and exact frequent subtree mining in graphs beyond forests ⋮ Efficient frequent connected subgraph mining in graphs of bounded tree-width ⋮ On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay

This page was built for publication: Frequent Hypergraph Mining