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

DOI10.1007/S11432-012-4638-ZMaRDI QIDQ362278zbMATH OpenOpenAlexWikidataFDO

Authors Zhonghui Wang, Zhihong 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)

Recommendations

• A fast algorithm for mining frequent fuzzy itemsets
• A novel algorithm for fast mining frequent patterns based on support list structure
• An efficient algorithm for mining frequent maximal and closed itemsets
• scientific article; zbMATH DE number 2219521

Cites work

• An incremental data mining algorithm for compact realization of prototypes

Cited in

(4)

• Efficiently using prime-encoding for mining frequent itemsets in sparse data
• A novel algorithm for fast mining frequent patterns based on support list structure
• Efficient learning of large sets of locally optimal classification rules
• An efficient approach for mining weighted uncertain interesting patterns

Describes a project that uses

Uses Software

• gSpan
• CLOSET

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362278)