A new algorithm for fast mining frequent itemsets using N-lists

DOI10.1007/s11432-012-4638-zzbMath1270.68239OpenAlexW2256820277WikidataQ61311896 ScholiaQ61311896MaRDI QIDQ362278

Zhonghui Wang, Zhi-Hong Deng, Jia-Jian Jiang

Publication date: 20 August 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-012-4638-z

zbMATH Keywords

algorithmdata miningdata structurefrequent itemset miningN-lists

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Efficient learning of large sets of locally optimal classification rules ⋮ An efficient approach for mining weighted uncertain interesting patterns

Uses Software

• gSpan
• CLOSET

Cites Work

• An incremental data mining algorithm for compact realization of prototypes

This page was built for publication: A new algorithm for fast mining frequent itemsets using N-lists