Computer Science ›› 2008, Vol. 35 ›› Issue (1): 193-195.

Previous Articles     Next Articles

  

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

Abstract: Discovering frequent closed itemsets is a key problem in data mining application. Many sequential algorithms have been proposed for mining frequent closed itemsets. However, very little work has been done in discovering fre quent closed itemsets in distri

Key words: Data mining, Distributed database, Frequent closed itemsets, Global frequent closed itemsets

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!