Frequent hypergraph mining

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.