Mining N-most interesting itemsets without support threshold by the COFI-tree

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

Publisher： Inderscience Publishers

ISSN： 1743-8187

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

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 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

Krimp: mining itemsets that compress

By Vreeken Jilles  

Data Mining and Knowledge Discovery, Vol. 23, Iss. 1, 2011-07 ,pp. : 169-214

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

Answering constraint-based mining queries on itemsets using previous materialized results

By Esposito Roberto   Meo Rosa   Botta Marco  

Journal of Intelligent Information Systems, Vol. 26, Iss. 1, 2006-01 ,pp. : 95-111

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