Maximal frequent subgraph mining
Theexponentialnumberofpossiblesubgraphsmakestheproblemoffrequentsubgraphminingachallenge.Thesetofmaximalfrequentsubgraphsismuchsmallertothatofthesetoffrequentsubgraphs,thusprovidingamplescopeforpruning.MARGINisamaximalsubgraphminingalgorithmthatmovesamongpromisingnodesofthesearchs
下载地址
用户评论
