Mining top − k frequent patterns without minimum support threshold

ISSN： 0219-1377

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Mining top-k frequent patterns in the presence of the memory constraint

By Chuang Kun-Ta

The VLDB Journal, Vol. 17, Iss. 5, 2008-08 ,pp. : 1321-1344

Springer Publishing Company

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

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 N-most interesting itemsets without support threshold by the COFI-tree

By Ngan Sze-Chung Lam Tsang Wong Raymond Chi-Wing Fu Ada Wai-Chee

International Journal of Business Intelligence and Data Mining, Vol. 1, Iss. 1, 2005-07 ,pp. : 88-106

Inderscience Publishers

Access to resources Recommend Favorite