Computer Science ›› 2007, Vol. 34 ›› Issue (12): 175-179.

Previous Articles     Next Articles

ZHU Ying-Wen JI Gen-Lin (Department of Computer, Nanjing Normal University, Nanjing 210097)   

  • Online:2018-11-16 Published:2018-11-16

Abstract: In this paper a novel algorithm, named CMPETreeMiner, is presented to discover maximal frequent embedded subtrees from ordered labeled trees. The algorithm uses preorder sequence to store trees. The attribute of node's scope is added in the preorder seque

Key words: Embedded subtree, Frequent subtree, Maximal frequent subtree, Closed frequent subtree, Data mining

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!