Pushing Convertible Constraints in Frequent Itemset Mining

Author： Pei Jian   Han Jiawei   Lakshmanan Laks V.S.  

Publisher： Springer Publishing Company

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.8, Iss.3, 2004-05, pp. : 227-252

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

An Erratum on #x201C;Pushing Convertible Constraints in Frequent Itemset Mining#x201D;

By Pei Jian   Han Jiawei   Lakshmanan Laks  

Data Mining and Knowledge Discovery, Vol. 12, Iss. 1, 2006-01 ,pp. : 119-119

Springer Publishing Company

Access to resources Recommend Favorite

A time- and memory-efficient frequent itemset discovering algorithm for association rule mining

By Ivancsy Renata   Vajk Istvan  

International Journal of Computer Applications in Technology, Vol. 27, Iss. 4, 2007-01 ,pp. : 270-280

Inderscience Publishers

Access to resources Recommend Favorite

Security and Verification of Server Data Using Frequent Itemset Mining in Ecommerce

By  

International Journal of Synthetic Emotions (IJSE), Vol. 8, Iss. 1, 2017-01 ,pp. : 31-43

IGI Global_journal

Access to resources Recommend Favorite

Meta itemset: a new concise representation of frequent itemset

By Song Wei  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 21, Iss. 4, 2009-12 ,pp. : 259-272

Taylor & Francis Ltd

Access to resources Recommend Favorite

Non-derivable itemset mining

By Calders Toon   Goethals Bart  

Data Mining and Knowledge Discovery, Vol. 14, Iss. 1, 2007-02 ,pp. : 171-206

Springer Publishing Company

Access to resources Recommend Favorite