Performance Evaluation of Frequent Subgraph Discovery Techniques

Algorithm 1

gSpan [11] algorithm.

GraphSet Projection ().

(1) sort the labels in . by their frequency;

(2) remove infrequent vertices and edges;

(3) re-label the remaining vertices and edges;

(4) all frequent 1-edge graphs in ;

(5) sort in DFS lexicographic order;

(6)

(7) for each edge in do

(8) initialize with , set . by graphs which contains ;

(9) Subgraph Mining();

(10)

(11) if < minsup;

(12) break;

Sub_procedure 1 Subgraph Mining()

(1) if #

(2) return;

(3) ;

(4) enumerate in each graph in . and count its children;

(5) for each , is ’ child do

(6) if support() grtequalminsup

(7) :

(8) Subgraph Mining(.);