Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Frequent hypergraph mining

: Horváth, T.; Bringmann, B.; Raedt, L. de

Muggleton, S.:
16th International Conference on Inductive Logic Programming, ILP 2006 : Santiago de Compostela, Spain, August 24-27, 2006; Short papers
Corunna: University of Corunna, 2006
ISBN: 84-9749-206-4
International Conference on Inductive Logic Programming (ILP) <16, 2006, Santiago de Compostela>
Fraunhofer IAIS ()
frequent pattern mining; hypergraphs

The problem class $\\cC {\\rm FHM}$ of frequent hypergraph mining is introduced which generalizes the class of frequent graph mining problems and contains also the frequent itemset mining problem. We study the computational properties of different problems of $\\cC {\\rm FHM}$ and, besides negative results, present practically relevant problems that can be solved in incremental-polynomial time. Our experimental results in the domain of citation analysis show the potential of the framework on problems that have no natural representation as an ordinary graph.