Frequent Graph Patterns [chapter]

Jun Huan
2016 Encyclopedia of Database Systems  
There are three key concepts in mining graph databases: (i) labeled graph, (ii) subgraph isomorphism, and (iii) graph support value. Based on the concepts, the problem of frequent subgraph mining could be defined in the following discussion. Definition 1 is a set of vertices or nodes and E Â V V is a set of undirected edges. † is a set of (disjoint) vertex and edge labels, and : V [ E ! † is a function that assigns labels to vertices and edges. Typically a total ordering is defined on the
more » ... in †. With the previous definition, a graph database is a set of labeled graphs. Definition 2 if there exists a 1-1 mapping f: V 0 ! V such that 8v 2 V 0 ; oe 0 .
doi:10.1007/978-1-4899-7993-3_168-2 fatcat:34kwotaocfggtfayjlayrwyegm