MARGIN: Maximal Frequent Subgraph Mining

The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs. We propose an algorithm that mines the maximal frequent subgraphs while pruning the lattice space considerably. This reduces the number of isomorphism computations which is the kernel of all frequent subgraph mining problems. Experimental results validate the utility of the technique proposed.

• Type: Conference
• Year: 2006
• Where: ICDM
• Authors: Lini T. Thomas, Satyanarayana R. Valluri, Kamalakar Karlapalem
• Keywords: Data Mining, Frequent Subgraph, Frequent Subgraph Mining, ICDM 2006, Maximal Frequent Subgraphs