Computer Science ›› 2008, Vol. 35 ›› Issue (1): 193-195.
Previous Articles Next Articles
Online:
Published:
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
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2008/V35/I1/193
Cited