Computer Science ›› 2007, Vol. 34 ›› Issue (7): 146-149.

Previous Articles     Next Articles

  

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

Abstract: Because of the inherent computational complexity, mining the complete frequent itemset in dense datasets remains to be a challenging task. Mining Maximal Frequent Itemset (MFI)is an alternative to address the problem. Set-Enumeration Tree (SET)is a common

Key words: Data mining, Association rule, Maximal frequent itemset, Index array, Set-enumeration tree

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!