Mining frequent closed rooted trees

By Balcázar José   Bifet Albert   Lozano Antoni  

Machine Learning, Vol. 78, Iss. 1-2, 2010-01 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

Mining top-K frequent itemsets from data streams

By Wong Raymond   Fu Ada  

Data Mining and Knowledge Discovery, Vol. 13, Iss. 2, 2006-09 ,pp. : 193-217

Springer Publishing Company

Access to resources Recommend Favorite

Mining top-K frequent itemsets through progressive sampling

By Pietracaprina Andrea   Riondato Matteo   Upfal Eli   Vandin Fabio  

Data Mining and Knowledge Discovery, Vol. 21, Iss. 2, 2010-09 ,pp. : 310-326

Springer Publishing Company

Access to resources Recommend Favorite

Mining top − k frequent patterns without minimum support threshold

By Salam Abdus  

Knowledge and Information Systems, Vol. 30, Iss. 1, 2012-01 ,pp. : 57-86

Springer Publishing Company

Access to resources Recommend Favorite

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