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

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

DBC: a condensed representation of frequent patterns for efficient mining

By Bykowski A.   Rigotti C.  

Information Systems, Vol. 28, Iss. 8, 2003-12 ,pp. : 949-977

Elsevier

Access to resources Recommend Favorite

Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

By Han Jiawei   Pei Jian   Yin Yiwen   Mao Runying  

Data Mining and Knowledge Discovery, Vol. 8, Iss. 1, 2004-01 ,pp. : 53-87

Springer Publishing Company

Access to resources Recommend Favorite