Login / Signup

Efficiently Mining Maximal Frequent Patterns from Traversals on Weighted Directed Graph Using Statistical Theory.

Runian GengXiangjun DongGuoling LiuWenbo Xu
Published in: FSKD (2) (2008)
Keyphrases
  • directed graph
  • random walk
  • directed acyclic graph
  • graph structure
  • shortest path problem
  • maximum flow
  • data mining
  • edge weights
  • graph properties