An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases

By Wang Ruili   Xu Luofeng   Marsland Stephen   Rayudu Ramesh  

International Journal of Intelligent Systems Technologies and Applications, Vol. 4, Iss. 3-4, 2008-02 ,pp. : 313-326

Inderscience Publishers

Access to resources Recommend Favorite

A Fast Parallel Clustering Algorithm for Large Spatial Databases

By Xu Xiaowei   Jäger Jochen   Kriegel Hans-Peter  

Data Mining and Knowledge Discovery, Vol. 3, Iss. 3, 1999-09 ,pp. : 263-290

Springer Publishing Company

Access to resources Recommend Favorite

DISCOVERING CAUSALITY IN LARGE DATABASES

By Zhang Shichao   Zhang Chengqi  

Applied Artificial Intelligence, Vol. 16, Iss. 5, 2002-05 ,pp. : 333-358

Taylor & Francis Ltd

Access to resources Recommend Favorite

GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets

By Gouda Karam   Zaki Mohammed  

Data Mining and Knowledge Discovery, Vol. 11, Iss. 3, 2005-11 ,pp. : 223-242

Springer Publishing Company

Access to resources Recommend Favorite

Axiomatization of frequent itemsets

By Calders T.   Paredaens J.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 669-693

Elsevier

Access to resources Recommend Favorite