Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory

Author： Valtchev Petko   Missaoui Rokia   Godin Robert   Meridji Mohamed  

Publisher： Taylor & Francis Ltd

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.14, Iss.2-3, 2002-04, pp. : 115-142

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 minimal non-redundant association rules using frequent itemsets lattice

By Vo Bay   Le Bac  

International Journal of Intelligent Systems Technologies and Applications, Vol. 10, Iss. 1, 2011-01 ,pp. : 92-106

Inderscience Publishers

Access to resources Recommend Favorite

Enhanced Frequent Itemsets Based on Topic Modeling in Information Filtering

By  

International Journal of Software Innovation (IJSI), Vol. 5, Iss. 4, 2017-10 ,pp. : 33-43

IGI Global_journal

Access to resources Recommend Favorite

Axiomatization of frequent itemsets

By Calders T.   Paredaens J.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 669-693

Elsevier

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