METHOD FOR CREATING SEARCH TREE OF CANONIZED GRAPH

摘要

PURPOSE: A method for generating a canonized graph search tree is provided to provide the canonized graph search tree which is used to determine whether a frequent subgraph is a canonized graph or not, thereby easily and rapidly performing determination without repetitive canonized operations. CONSTITUTION: A minimum depth first search (DFS) code of a first frequent subgraph is obtained by performing a canonized operation of the first frequent subgraph (S230). Whether the first frequent subgraph is a canonized graph having the minimum DFS code is determined by comparing a DFS code of the first frequent subgraph and the minimum DFS code of the first frequent subgraph according to an edge expansion order of the first frequent subgraphn (S240). If the first frequent subgraph is the canonized graph, a canonized graph search tree is generated by storing a DFS code of edges composing the first frequent subgraph and a successive expansion pointer between the edges. [Reference numerals] (AA) Start; (BB,CC,FF) Yes; (DD,EE) No; (GG) End; (S210) Input a minimum support rate; (S220) Extract a frequent subgraph; (S230) Generate a DFS code; (S240) Is the subgraph a normal distribution graph ?; (S250) Is the frequent subgraph needed to be expanded; (S260) Does the minimum support rate change ?