Patent ID: 6985890
Filing Date: 2006-01-10
Classification: G06F

Abstract:
1. A graph structured data processing method for extracting a frequent graph that has a support level equal to or greater than a minimum support level, from a graph database constituting a set of graph structured data, said method comprising: changing the order of vertex labels and edge labels and extracting frequent graphs in order of size; coupling two size k frequent graphs of size k that match the conditions: i) between the matrixes X ii) between the graphs G(X iii) between the graphs G(X iv) said adjacency matrix X returning a set F when said adjacency matrix c′ deleting, from said set C selecting only one adjacency matrix c′ normalizing the candidate frequent matrix and returning a canonical form from among adjacency matrixes that represent a size k candidate of frequent graph; and extracting a frequent graph.