San Jose, CA, USA
Nov. 29, 2001 to Dec. 2, 2001
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in these data sets is to use graphs. Within that model, the problem of finding frequent patterns becomes that of discovering subgraphs that occur frequently over the entire set of graphs. In this paper we present a computationally efficient algorithm for finding all frequent subgraphs in large graph databases. We evaluated the performance of the algorithm by experiments with synthetic datasets as well as a chemical compound dataset. The empirical results show that our algorithm scales linearly with the number of input transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
Michihiro Kuramochi, George Karypis, "Frequent Subgraph Discovery", ICDM, 2001, Proceedings 2001 IEEE International Conference on Data Mining, Proceedings 2001 IEEE International Conference on Data Mining 2001, pp. 313, doi:10.1109/ICDM.2001.989534