![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jianfei Zhu Gösta Grahne , Jianfei Zhu: Fast Algorithms for Frequent Itemset Mining Using FP-Trees. IEEE Trans. Knowl. Data Eng. 17 (10): 1347-1362 (2005) Jianfei Zhu, Gösta Grahne : Reducing the Main Memory Consumptions of FPmax* and FPclose. FIMI 2004 Gösta Grahne , Jianfei Zhu: Mining Frequent Itemsets from Secondary Memory. ICDM 2004 : 91-98 Gösta Grahne , Jianfei Zhu: Mining Frequent Itemsets from Secondary Memory CoRR cs.DB/0405069 : (2004) Gösta Grahne , Jianfei Zhu: Efficiently Using Prefix-trees in Mining Frequent Itemsets. FIMI 2003 Gösta Grahne , Jianfei Zhu: Discovering approximate keys in XML data. CIKM 2002 : 453-460 1 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] ![]() ©2006 Association for Computing Machinery |