An Algorithm for Mining Connected Closed Frequent Subgraphs Based on FP-Tree
Peng Jia-yang · Computer Technology and Development · 2009
With the deep study of the frequent pattern mining,graphs can be modeled for many transactions widely,and the study of graphs have become increasingly important.Based on FP-Tree,presents an improved FP-Growth algorithm,which can find the closed frequent connected subgraph from the model of unique labeled directed connected graph set.The experiment of biology metabolize pathway dataset demonstrated that the algorithm can get the closed frequent subgraph set effectively,and can get the max frequent subgraph sets of many different threshold by execute once.This algorithm can use for mining the network or graph set which can modeling by unique labeled,directed,connected graph.It can be applied to the subgraph mining in biological networks which is based on the simplification model.